Unimodular random trees
From MaRDI portal
Abstract: We consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to give a new proof that URTs are sofic, a result of Elek. We show that ends of invariant forests in the hyperbolic plane converge to ideal boundary points. We also prove that uniform integrability of the degree distribution of a family of finite graphs implies tightness of that family for local convergence, also known as random weak convergence.
Recommendations
- Invariance, quasi-invariance, and unimodularity for random graphs
- Indistinguishability of trees in uniform spanning forests
- Hyperbolic and parabolic unimodular random maps
- The continuum random tree is the scaling limit of unlabeled unrooted trees
- Invariant embeddings of unimodular random planar graphs
Cites work
- A lemma for cost attained
- A measurable-group-theoretic solution to von Neumann's problem
- An amenable equivalence relation is generated by a single transformation
- Choosing a spanning tree for the integer lattice uniformly
- Ergodic theory on stationary random graphs
- Exponential tail bounds for loop-erased random walk in two dimensions
- Fundamental domains for lattices in (R-)rank 1 semisimple Lie groups
- Group-invariant percolation on graphs
- On the limit of large girth graph sequences
- Percolation in the hyperbolic plane
- Periodicity and circle packings of the hyperbolic plane
- Processes on unimodular random networks
- Recurrence of distributional limits of finite planar graphs
- Sparse graphs: metrics and random models
- Spectral analysis on infinite Sierpiński gaskets
- The Canophy graph and level statistics for random operators on trees
- Uniform infinite planar triangulations
Cited in
(34)- Ising critical exponents on random trees and graphs
- Finite-energy infinite clusters without anchored expansion
- Unimodular measures on the space of all Riemannian manifolds
- On local weak limit and subgraph counts for sparse random graphs
- Macroscopic loops in the loop O(n) model via the XOR trick
- Eternal family trees and dynamics on unimodular random graphs
- Mean quantum percolation
- Hyperbolic and parabolic unimodular random maps
- Classification of half-planar maps
- Large deviations of empirical neighborhood distribution in sparse random graphs
- Local limits of bipartite maps with prescribed face degrees in high genus
- Empirical spectral measures of quantum graphs in the Benjamini-Schramm limit
- Route lengths in invariant spatial tree networks
- Age evolution in the mean field forest fire model via multitype branching processes
- Coupling from the past for the null recurrent Markov chain
- Non-intersection of transient branching random walks
- Weak density of orbit equivalence classes of free group actions
- Unimodular random one-ended planar graphs are sofic
- Recent results of quantum ergodicity on graphs and further investigation
- Estimating global subgraph counts by sampling
- Optimal unimodular matchings
- Comparing graphs of different sizes
- Growth dichotomy for unimodular random rooted trees
- Random intersection graphs with communities
- On the speed of distance-stationary sequences
- Sparse expanders have negative curvature
- The Ihara zeta function for infinite graphs
- Unimodularity for multi-type Galton-Watson trees
- The half plane UIPT is recurrent
- Invariance, quasi-invariance, and unimodularity for random graphs
- Local limits of spatial Gibbs random graphs
- Shift-coupling of random rooted graphs and networks
- Local weak convergence for PageRank
- Invariant embeddings of unimodular random planar graphs
This page was built for publication: Unimodular random trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5245325)
