Induced graphs of uniform spanning forests
From MaRDI portal
Publication:2028954
DOI10.1214/20-AIHP1056zbMath1478.60266arXiv1812.03127OpenAlexW3094432826MaRDI QIDQ2028954
Xin Sun, Yuval Peres, Russell Lyons
Publication date: 3 June 2021
Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.03127
Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Processes in random environments (60K37)
Related Items (2)
Persistent Laplacians: Properties, Algorithms and Implications ⋮ Explicit universal minimal constants for polynomial growth of groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum gravity and inventory accumulation
- Recurrent networks and a theorem of Nash-Williams
- Ends in uniform spanning forests
- A self-avoiding random walk
- Choosing a spanning tree for the integer lattice uniformly
- Group-invariant percolation on graphs
- The components of the wired spanning forest are recurrent
- Scaling limits of loop-erased random walks and uniform spanning trees
- Interlacements and the wired uniform spanning forest
- Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
- Uniform spanning forests
- Conformal invariance of planar loop-erased random walks and uniform spanning trees.
- Four-dimensional loop-erased random walk
- The infinite two-sided loop-erased random walk
- The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\)
- Universality of high-dimensional spanning forests and sandpiles
- Indistinguishability of trees in uniform spanning forests
- SLE and the free field: Partition functions and couplings
This page was built for publication: Induced graphs of uniform spanning forests
