Spanning forests and the vector bundle Laplacian
From MaRDI portal
(Redirected from Publication:651010)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1256746 (Why is no real title available?)
- scientific article; zbMATH DE number 2174437 (Why is no real title available?)
- scientific article; zbMATH DE number 5794277 (Why is no real title available?)
- Choosing a spanning tree for the integer lattice uniformly
- Conformal invariance of planar loop-erased random walks and uniform spanning trees.
- Critical resonance in the non-intersecting lattice path model
- Determinantal processes and independence
- Determinants of Laplacians on graphs
- Dimers and cluster integrable systems
- Dominos and the Gaussian free field.
- Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
- Long-range properties of spanning trees
- Loop statistics in the toroidal honeycomb dimer model
- Moduli spaces of local systems and higher Teichmüller theory
- Monotone loop models and rational resonance
- The asymptotic determinant of the discrete Laplacian
- The dissection of rectangles into squares
Cited in
(55)- Grassmann integral representation for spanning hyperforests
- 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
- Sandpile probabilities on triangular and hexagonal lattices
- The dimer and Ising models on Klein bottles
- Transfer matrix for spanning trees, webs and colored forests
- Principal minors Pfaffian half-tree theorem
- The bundle Laplacian on discrete tori
- Asymptotics of the determinant of discrete Laplacians on triangulated and quadrangulated surfaces
- Spectra of biperiodic planar networks
- Covariant Symanzik identities
- Learning about critical phenomena from scribbles and sandpiles
- Graph coverings and twisted operators
- The geometry of synchronization problems and learning group actions
- Laminations of a graph on a pair of pants
- 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
- 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
- Holomorphic spinor observables in the critical Ising model
- The power of vertex sparsifiers in dynamic graph algorithms
- Determinantal probability measures on Grassmannians
- Lehmer's question, graph complexity growth and links
- Conformal invariance of loops in the double-dimer model
- scientific article; zbMATH DE number 6909317 (Why is no real title available?)
- Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems
- Matrix-tree theorems and discrete path integration
- Generalized Schrödinger semigroups on infinite graphs
- Discrete and zeta-regularized determinants of the Laplacian on polygonal domains with Dirichlet boundary conditions
- Multipoint correlators in the abelian sandpile model
- Finite difference method on flat surfaces with a flat unitary vector bundle
- Determinantal spanning forests on planar graphs
- A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees
- Brownian loops topology
- The Z-invariant massive Laplacian on isoradial graphs
- Schramm's formula for multiple loop-erased random walks
- Pfaffian formulas for spanning tree probabilities
- Dimers on Riemann surfaces. II: Conformal invariance and scaling limit
- Links in surfaces and Laplacian modules
- Spanning trees, cycle-rooted spanning forests on discretizations of flat surfaces and analytic torsion
- Abelian networks IV. Dynamics of nonhalting networks
- Maximal accretive extensions of Schrödinger operators on vector bundles over infinite graphs
- Random forests and networks analysis
- Laplacian growth, sandpiles, and scaling limits
- Laplacian matrices and spanning trees of tree graphs
- Magnetic eigenmaps for the visualization of directed networks
- 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)
