Laplacian matrices and spanning trees of tree graphs
Philippe Biane, Guillaume Chapuy

TL;DR
This paper investigates the structure of Laplacian matrices and spanning trees of directed graphs, revealing a factorization of determinants of lifted Schr"odinger operators into products related to subgraphs, with combinatorial insights and applications.
Contribution
It introduces a novel factorization of determinants of lifted Schr"odinger operators on the graph of spanning trees, with a combinatorial description of multiplicities and block structures.
Findings
Determinant of lifted Schr"odinger operator factors into subgraph determinants.
Provides a combinatorial exploration procedure for multiplicities.
Reproduces Bernardi's formula for spanning forests of the hypercube.
Abstract
If is a strongly connected finite directed graph, the set of rooted directed spanning trees of is naturally equipped with a structure of directed graph: there is a directed edge from any spanning tree to any other obtained by adding an outgoing edge at its root vertex and deleting the outgoing edge of the endpoint. Any Schr\"odinger operator on , for example the Laplacian, can be lifted canonically to . We show that the determinant of such a lifted Schr\"odinger operator admits a remarkable factorization into a product of determinants of the restrictions of Schr\"odinger operators on subgraphs of and we give a combinatorial description of the multiplicities using an exploration procedure of the graph. A similar factorization can be obtained from earlier ideas of C. Athaniasadis, but this leads to a different expression of the multiplicities,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
