Translator Disclaimer
2000 Loop-Erased Random Walks, Spanning Trees and Hamiltonian Cycles
Philippe Marchal
Author Affiliations +
Electron. Commun. Probab. 5: 39-50 (2000). DOI: 10.1214/ECP.v5-1016

Abstract

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.

Citation

Download Citation

Philippe Marchal. "Loop-Erased Random Walks, Spanning Trees and Hamiltonian Cycles." Electron. Commun. Probab. 5 39 - 50, 2000. https://doi.org/10.1214/ECP.v5-1016

Information

Accepted: 3 December 1999; Published: 2000
First available in Project Euclid: 2 March 2016

zbMATH: 0954.60055
MathSciNet: MR1736723
Digital Object Identifier: 10.1214/ECP.v5-1016

Subjects:
Primary: 60J10

JOURNAL ARTICLE
12 PAGES


SHARE
Back to Top