Random curves on surfaces induced from the Laplacian determinant

We define natural probability measures on cycle-rooted spanning forests (CRSFs) on graphs embedded on a surface with a Riemannian metric. These measures arise from the Laplacian determinant and depend on the choice of a unitary connection on the tangent bundle to the surface. We show that, for a sequence of graphs $(G_n)$ conformally approximating the surface, the measures on CRSFs of $G_n$ converge and give a limiting probability measure on finite multicurves (finite collections of pairwise disjoint simple closed curves) on the surface, independent of the approximating sequence. Wilson's algorithm for generating spanning trees on a graph generalizes to a cycle-popping algorithm for generating CRSFs for a general family of weights on the cycles. We use this to sample the above measures. The sampling algorithm, which relates these measures to the loop-erased random walk, is also used to prove tightness of the sequence of measures, a key step in the proof of their convergence. We set the framework for the study of these probability measures and their scaling limits and state some of their properties.

[1]  Wendelin Werner,et al.  Conformal invariance of planar loop-erased random walks and uniform spanning trees , 2001 .

[2]  David Bruce Wilson,et al.  Trees and Matchings , 2000, Electron. J. Comb..

[3]  D. Aldous.  On the time taken by random walks on finite groups to visit every state , 1983 .

[4]  R. Pemantle,et al.  PR ] 2 A pr 2 00 4 LOCAL CHARACTERISTICS , ENTROPY AND LIMIT THEOREMS FOR SPANNING TREES AND DOMINO TILINGS VIA TRANSFER-IMPEDANCES Running Head : LOCAL BEHAVIOR OF SPANNING TREES , 1993 .

[5]  Oded Schramm,et al.  Scaling limits of loop-erased random walks and uniform spanning trees , 1999, math/9904022.

[6]  Moduli spaces of local systems and higher Teichmüller theory , 2003, math/0311149.

[7]  D Wehn,et al.  PROBABILITIES ON LIE GROUPS. , 1962, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Y. Peres,et al.  Determinantal Processes and Independence , 2005, math/0503110.

[9]  David Bruce Wilson,et al.  Generating random spanning trees more quickly than the cover time , 1996, STOC '96.

[10]  N. Biggs.  Algebraic Potential Theory on Graphs , 1997 .

[11]  Scaling limits for minimal and random spanning trees in two dimensions , 1998, math/9809145.

[12]  R. Forman.  Determinants of Laplacians on graphs , 1993 .

[13]  R. Kenyon.  Spanning forests and the vector bundle Laplacian , 2010, 1001.4028.

[14]  V. B. Priezzhev,et al.  Waves of topplings in an Abelian sandpile , 1994 .

[15]  Almut Burchard,et al.  Holder Regularity and Dimension Bounds for Random Curves , 1998 .

[16]  V. Koltchinskii,et al.  Empirical graph Laplacian approximation of Laplace–Beltrami operators: Large sample results , 2006, math/0612777.

[17]  R. Bass,et al.  Review: P. Billingsley, Convergence of probability measures , 1971 .