Unimodular random trees
From MaRDI portal
Publication:5245325
DOI10.1017/etds.2013.56zbMath1328.05166arXiv1207.1752OpenAlexW2015375519MaRDI QIDQ5245325
Oded Schramm, Russell Lyons, Itai Benjamini
Publication date: 8 April 2015
Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.1752
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Probability theory on algebraic and topological structures (60B99) Random walks on graphs (05C81)
Related Items
Local limits of spatial Gibbs random graphs, Local limits of bipartite maps with prescribed face degrees in high genus, On the speed of distance stationary sequences, Local weak convergence for PageRank, The half plane UIPT is recurrent, Mean quantum percolation, Sparse expanders have negative curvature, Estimating global subgraph counts by sampling, Non-intersection of transient branching random walks, Comparing Graphs of Different Sizes, Ising critical exponents on random trees and graphs, The Ihara zeta function for infinite graphs, Finite-energy infinite clusters without anchored expansion, Invariance, quasi-invariance, and unimodularity for random graphs, Empirical spectral measures of quantum graphs in the Benjamini-Schramm limit, Age evolution in the mean field forest fire model via multitype branching processes, Recent results of quantum ergodicity on graphs and further investigation, Weak density of orbit equivalence classes of free group actions, Large deviations of empirical neighborhood distribution in sparse random graphs, Route lengths in invariant spatial tree networks, Eternal Family Trees and dynamics on unimodular random graphs, Shift-coupling of random rooted graphs and networks, Hyperbolic and parabolic unimodular random maps, Random intersection graphs with communities, Unimodular measures on the space of all Riemannian manifolds, On local weak limit and subgraph counts for sparse random graphs, Classification of half-planar maps
Cites Work
- Ergodic theory on stationary random graphs
- Exponential tail bounds for loop-erased random walk in two dimensions
- On the limit of large girth graph sequences
- A measurable-group-theoretic solution to von Neumann's problem
- Choosing a spanning tree for the integer lattice uniformly
- Spectral analysis on infinite Sierpiński gaskets
- Group-invariant percolation on graphs
- Uniform infinite planar triangulations
- Periodicity and circle packings of the hyperbolic plane
- Recurrence of distributional limits of finite planar graphs
- A lemma for cost attained
- Processes on unimodular random networks
- The Canophy graph and level statistics for random operators on trees
- Fundamental domains for lattices in (R-)rank 1 semisimple Lie groups
- Percolation in the hyperbolic plane
- An amenable equivalence relation is generated by a single transformation
- Sparse graphs: Metrics and random models