Interlacements and the wired uniform spanning forest
From MaRDI portal
Publication:1746152
DOI10.1214/17-AOP1203zbMath1391.60021arXiv1512.08509OpenAlexW3103172259MaRDI QIDQ1746152
Publication date: 24 April 2018
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.08509
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Probability theory on algebraic and topological structures (60B99)
Related Items
Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting), The diameter of uniform spanning trees in high dimensions, Indistinguishability of collections of trees in the uniform spanning forest, Mean-field avalanche size exponent for sandpiles on Galton-Watson trees, Harnack inequality and one-endedness of UST on reversible random graphs, Random interlacement is a factor of i.i.d., Logarithmic corrections to scaling in the four-dimensional uniform spanning tree, Finitary random interlacements and the Gaboriau-Lyons problem, The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\), UNIFORM SPANNING FORESTS OF PLANAR GRAPHS, Induced graphs of uniform spanning forests, Universality of high-dimensional spanning forests and sandpiles, A reverse Aldous-Broder algorithm, Random walks with local memory, Infinite-step stationarity of rotor walk and the wired spanning forest, Hyperbolic and parabolic unimodular random maps, The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Invariant monotone coupling need not exist
- Topics in occupation times and Gaussian free fields
- Minimal configurations and sandpile measures
- Wired cycle-breaking dynamics for uniform spanning forests
- Subsequential scaling limits of simple random walk on the two-dimensional uniform spanning tree
- The Fourier spectrum of critical percolation
- Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
- Minimal spanning forests
- Vacant set of random interlacements and percolation
- A note on percolation on \(\mathbb Z^d\): isoperimetric profile via exponential cluster repulsion
- Ends in uniform spanning forests
- Interlacement percolation on transient weighted graphs
- A self-avoiding random walk
- Choosing a spanning tree for the integer lattice uniformly
- The components of the wired spanning forest are recurrent
- Scaling limits of loop-erased random walks and uniform spanning trees
- Indistinguishability of the components of random spanning forests
- Anchored expansion, percolation and speed. (With an appendix by Gábor Pete)
- Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
- Sandpile models
- Uniform spanning forests
- Conformal invariance of planar loop-erased random walks and uniform spanning trees.
- Random interlacements and amenability
- Indistinguishability of trees in uniform spanning forests
- The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus
- Processes on unimodular random networks
- Probability theory. A comprehensive course.
- Infinite volume limit of the abelian sandpile model in dimensions \(d \geq 3\)
- Invariant coupling of determinantal measures on sofic groups
- Probability on Trees and Networks
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- A survey on dynamical percolation
- Couplings of uniform spanning forests
- Self-organized critical state of sandpile automaton models
- An Introduction to Random Interlacements
- The asymptotic determinant of the discrete Laplacian
- Local time on the exceptional set of dynamical percolation and the incipient infinite cluster