Determinants of Laplacians on graphs

DOI10.1016/0040-9383(93)90035-TzbMath0780.05041MaRDI QIDQ2367212

Robin Forman

Publication date: 18 August 1993

Published in: Topology (Search for Journal in Brave)

zbMATH Keywords

determinantscharacteristic polynomialadjacency matrixLaplacianLaplacian matrixfinite graph

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99)

Related Items (33)

Abelian networks IV. Dynamics of nonhalting networks ⋮ Spanning trees, cycle-rooted spanning forests on discretizations of flat surfaces and analytic torsion ⋮ Finite difference method on flat surfaces with a flat unitary vector bundle ⋮ Growth and the spectrum of the Laplacian of an infinite graph ⋮ Magnetic eigenmaps for the visualization of directed networks ⋮ Morse theory for cell complexes ⋮ From cycle rooted spanning forests to the critical Ising model: an explicit construction ⋮ Sandpile probabilities on triangular and hexagonal lattices ⋮ Pfaffian Formulas for Spanning Tree Probabilities ⋮ Links in surfaces and Laplacian modules ⋮ Graph coverings and twisted operators ⋮ Determinants of Laplacians on discretizations of flat surfaces and analytic torsion ⋮ Principal minors Pfaffian half-tree theorem ⋮ Spectral decimation of the magnetic Laplacian on the Sierpinski gasket: solving the Hofstadter-Sierpinski butterfly ⋮ Spanning forests and the vector bundle Laplacian ⋮ Matrix-tree theorems and discrete path integration ⋮ A proof of the transfer-current theorem in absence of reversibility ⋮ The bundle Laplacian on discrete tori ⋮ Multipoint correlators in the Abelian sandpile model ⋮ Schramm’s formula for multiple loop-erased random walks ⋮ Algebraic Properties of Generalized Graph Laplacians: Resistor Networks, Critical Groups, and Homological Algebra ⋮ A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees ⋮ A colourful path to matrix-tree theorems ⋮ Random forests and networks analysis ⋮ The critical Ising model via Kac-Ward matrices ⋮ Learning about critical phenomena from scribbles and sandpiles ⋮ Lehmer's question, graph complexity growth and links ⋮ Dimers on Riemann surfaces. II: Conformal invariance and scaling limit ⋮ Laminations of a graph on a pair of pants ⋮ Forest matrices around the Laplacian matrix ⋮ Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs ⋮ Asymptotics of height change on toroidal Temperleyan dimer models ⋮ Diffusions on graphs, Poisson problems and spectral geometry

This page was built for publication: Determinants of Laplacians on graphs