Spanning forests and the vector bundle Laplacian
From MaRDI portal
Publication:651010
DOI10.1214/10-AOP596zbMATH Open1252.82029arXiv1001.4028OpenAlexW2086886817MaRDI QIDQ651010FDOQ651010
Authors: Richard Kenyon 
Publication date: 8 December 2011
Published in: The Annals of Probability (Search for Journal in Brave)
Abstract: The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial interpretation of their determinants in terms of so-called cycle rooted spanning forests (CRSFs). We construct natural measures on CRSFs for which the edges form a determinantal process. This theory gives a natural generalization of the spanning tree process adapted to graphs embedded on surfaces. We give a number of other applications, for example, we compute the probability that a loop-erased random walk on a planar graph between two vertices on the outer boundary passes left of two given faces. This probability cannot be computed using the standard Laplacian alone.
Full work available at URL: https://arxiv.org/abs/1001.4028
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Dominos and the Gaussian free field.
- Conformal invariance of planar loop-erased random walks and uniform spanning trees.
- Moduli spaces of local systems and higher Teichmüller theory
- Title not available (Why is that?)
- Dimers and cluster integrable systems
- Determinantal processes and independence
- The dissection of rectangles into squares
- Choosing a spanning tree for the integer lattice uniformly
- The asymptotic determinant of the discrete Laplacian
- Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
- Loop statistics in the toroidal honeycomb dimer model
- Long-range properties of spanning trees
- Determinants of Laplacians on graphs
- Critical resonance in the non-intersecting lattice path model
- Title not available (Why is that?)
- Monotone loop models and rational resonance
Cited In (52)
- A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees
- Dimers on Riemann surfaces. II: Conformal invariance and scaling limit
- Schramm’s formula for multiple loop-erased random walks
- A colourful path to matrix-tree theorems
- The looping constant of \(\mathbb Z^d\)
- A proof of the transfer-current theorem in absence of reversibility
- Spectral decimation of the magnetic Laplacian on the Sierpinski gasket: solving the Hofstadter-Sierpinski butterfly
- The dimer and Ising models on Klein bottles
- Sandpile probabilities on triangular and hexagonal lattices
- Transfer matrix for spanning trees, webs and colored forests
- Principal minors Pfaffian half-tree theorem
- The bundle Laplacian on discrete tori
- Spectra of biperiodic planar networks
- Title not available (Why is that?)
- Asymptotics of the determinant of discrete Laplacians on triangulated and quadrangulated surfaces
- Covariant Symanzik identities
- Laminations of a graph on a pair of pants
- Learning about critical phenomena from scribbles and sandpiles
- Graph coverings and twisted operators
- The geometry of synchronization problems and learning group actions
- Random walks, conductance, and resistance for the connection graph Laplacian
- Semiclassical limits of quantum partition functions on infinite graphs
- Harmonic cycles for graphs
- Toward a spectral theory of cellular sheaves
- Pfaffian Formulas for Spanning Tree Probabilities
- Determinants of Laplacians on discretizations of flat surfaces and analytic torsion
- Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
- The planar Ising model and total positivity
- Loop-erased partitioning via parametric spanning trees: monotonicities \& 1D-scaling
- Transfer current and pattern fields in spanning trees
- Deformed Laplacians and spectral ranking in directed networks
- Determinantal probability measures on Grassmannians
- Holomorphic spinor observables in the critical Ising model
- Lehmer's question, graph complexity growth and links
- Conformal invariance of loops in the double-dimer model
- Title not available (Why is that?)
- Generalized Schrödinger semigroups on infinite graphs
- Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems
- Matrix-tree theorems and discrete path integration
- Discrete and zeta-regularized determinants of the Laplacian on polygonal domains with Dirichlet boundary conditions
- Finite difference method on flat surfaces with a flat unitary vector bundle
- Brownian loops topology
- Links in surfaces and Laplacian modules
- Abelian networks IV. Dynamics of nonhalting networks
- Spanning trees, cycle-rooted spanning forests on discretizations of flat surfaces and analytic torsion
- Laplacian growth, sandpiles, and scaling limits
- Maximal accretive extensions of Schrödinger operators on vector bundles over infinite graphs
- Random forests and networks analysis
- Multipoint correlators in the Abelian sandpile model
- Magnetic eigenmaps for the visualization of directed networks
- Grassmann integral representation for spanning hyperforests
- Asymptotics of height change on toroidal Temperleyan dimer models
This page was built for publication: Spanning forests and the vector bundle Laplacian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651010)
