The Looping Rate and Sandpile Density of Planar Graphs

DOI10.4169/amer.math.monthly.123.1.19zbMath1342.82035arXiv1402.4169OpenAlexW3098063006WikidataQ58122609 ScholiaQ58122609MaRDI QIDQ2812186

Adrien Kassel, David Bruce Wilson

Publication date: 16 June 2016

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.4169

zbMATH Keywords

loop-erased random walkinfinite latticefinite planar graph

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (11)

The Sandpile Cellular Automaton ⋮ Random two-component spanning forests ⋮ Universality conjectures for activated random walk ⋮ Laplacian growth, sandpiles, and scaling limits ⋮ Spectral decimation of the magnetic Laplacian on the Sierpinski gasket: solving the Hofstadter-Sierpinski butterfly ⋮ The spectrum of the abelian sandpile model ⋮ Learning about critical phenomena from scribbles and sandpiles ⋮ Sandpile models ⋮ Cut-off for sandpiles on tiling graphs ⋮ The generating function of planar Eulerian orientations ⋮ Transfer current and pattern fields in spanning trees

This page was built for publication: The Looping Rate and Sandpile Density of Planar Graphs