Uniform spanning forests on biased Euclidean lattices
From MaRDI portal
Publication:2077334
DOI10.1214/20-AIHP1119zbMath1483.05165arXiv1805.01615OpenAlexW3185246823WikidataQ114060531 ScholiaQ114060531MaRDI QIDQ2077334
Publication date: 25 February 2022
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/1805.01615
Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Enumeration in graph theory (05C30) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Infinite graphs (05C63) Random walks on graphs (05C81)
Related Items
Local geometry of the rough-smooth interface in the two-periodic Aztec diamond ⋮ An invariance principle and a large deviation principle for the biased random walk on
Cites Work
- Speed of the biased random walk on a Galton-Watson tree
- The Liouville and the intersection properties are equivalent for planar graphs
- Random walks on the lamplighter group
- Computationally efficient bounds for the Catalan numbers
- A self-avoiding random walk
- Choosing a spanning tree for the integer lattice uniformly
- Markov chain intersections and the loop-erased walk
- Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
- Uniform spanning forests
- Random-cluster measures and uniform spanning trees
- Biased random walks on Galton-Watson trees
- The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\)
- Probability and Statistical Physics in St. Petersburg
- Probability on Trees and Networks
- The Poisson boundary for homogeneous random walks
- Lyons‐Pemantle‐Peres Monotonicity Problem for High Biases
- Unnamed Item
- Unnamed Item
