2013
DOI: 10.1214/ecp.v18-2796
|View full text |Cite
|
Sign up to set email alerts
|

Grounded Lipschitz functions on trees are typically flat

Abstract: A grounded M -Lipschitz function on a rooted d-ary tree is an integer-valued map on the vertices that changes by at most M along edges and attains the value zero on the leaves. We study the behavior of such functions, specifically, their typical value at the root v0 of the tree. We prove that the probability that the value of a uniformly chosen random function at v0 is more than M + t is doubly-exponentially small in t. We also show a similar bound for continuous (real-valued) grounded Lipschitz functions.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
9
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 10 publications
(10 citation statements)
references
References 8 publications
(15 reference statements)
1
9
0
Order By: Relevance
“…Galvin and Engbers [5] established the analog of the conjecture, and more general rigidity results for graph homomorphisms, in the limit when n is fixed and d tends to infinity. Similar rigidity results on expander and tree graphs are established in [21,22,23].…”
Section: Background and Related Worksupporting
confidence: 72%
See 1 more Smart Citation
“…Galvin and Engbers [5] established the analog of the conjecture, and more general rigidity results for graph homomorphisms, in the limit when n is fixed and d tends to infinity. Similar rigidity results on expander and tree graphs are established in [21,22,23].…”
Section: Background and Related Worksupporting
confidence: 72%
“…The translation trichotomy, Theorem 3.4, and the relations ( 21) and (22) imply that Type(U ) = 1, establishing (19). Now observe that U c , V c are also translation respecting and satisfy V c ⊆ U c .…”
Section: Corollaries Of the Trichotomymentioning
confidence: 82%
“…Observe that any large component B of X satisfies |∂B| ≥ d 2 (by Corollary 2.3b) and ∂B ⊂ ∂Y . Therefore, by (36) and (37),…”
Section: 2mentioning
confidence: 88%
“…These may be used to prove bounds on the tail of 1 To the best of our knowledge this is the first instance when a uniformly distributed Lipschitz function is proven to have logarithmically diverging variance. Previously known results establish that the variance is bounded (referred to as localisation) in high dimensions [32], or when the underlying graph is a tree [33] or an expander [34]. The conjectured convergence of the height function to the GFF indicates that localisation should also hold on lattices in dimensions three and above.…”
Section: Uniform Lipschitz Functionsmentioning
confidence: 93%