Abstract
Let be a finite tree graph, be the Cartesian power graph of , and be the graph distance metric on . Also let be the sphere of radius centered at and be the spherical maximal averaging operator on given by We will show that for any fixed , the operator norm of , i.e. grows exponentially in the dimension . In particular, if is the probability that a random vertex of is a leaf, then , although this is not a sharp bound. This exponential growth phenomenon extends to a class of graphs strictly larger than trees, which we will call \emph{global antipode graphs}. This growth result stands in contrast to the work of Greenblatt, Harrow, Kolla, Krause, and Schulman that proved that the spherical maximal bounds (for ) are dimension-independent for finite cliques.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.