Spanning forests and the vector bundle Laplacian

Details Spanning forests and the vector bundle Laplacian Spanning forests and the vector bundle Laplacian

2010-01-22

arxiv.org/abs/1001.4028v3

Annals of Probability 2011, Vol. 39, No. 5, 1983-2017

Mathematics

Probability

Published in at http://dx.doi.org/10.1214/10-AOP596 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of

Scientific paper

10.1214/10-AOP596

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.

Affiliated with

Also associated with

No associations

Rating

Spanning forests and the vector bundle Laplacian does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spanning forests and the vector bundle Laplacian, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spanning forests and the vector bundle Laplacian will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-656155