论文信息 - Loop-Erased Random Walks, Spanning Trees and Hamiltonian Cycles

Loop-Erased Random Walks, Spanning Trees and Hamiltonian Cycles

We establish a formula for the distribution of loop-erased random walks at certain random times. Several classical results on spanning trees, including Wilson's algorithm, follow easily, as well as a method to construct random Hamiltonian cycles.

Philippe Marchal

[1] David Bruce Wilson,et al. How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph , 1998, J. Algorithms.

[2] Gregory F. Lawler. Loop-Erased Random Walk , 1999 .

[3] Russell Lyons,et al. Uniform spanning forests , 2001 .

[4] G. Kirchhoff. Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .

[5] Richard Kenyon,et al. The asymptotic determinant of the discrete Laplacian , 2000, math-ph/0011042.