Loop-erased random walks, spanning trees and Hamiltonian cycles.
Electronic Communications in Probability [electronic only] (2000)
- Volume: 5, page 39-50
- ISSN: 1083-589X
Access Full Article
topHow to cite
topMarchal, Philippe. "Loop-erased random walks, spanning trees and Hamiltonian cycles.." Electronic Communications in Probability [electronic only] 5 (2000): 39-50. <http://eudml.org/doc/120780>.
@article{Marchal2000,
author = {Marchal, Philippe},
journal = {Electronic Communications in Probability [electronic only]},
keywords = {Markov chain; random walk; spanning tree; cycle; Wilson's algorithm},
language = {eng},
pages = {39-50},
publisher = {University of Washington},
title = {Loop-erased random walks, spanning trees and Hamiltonian cycles.},
url = {http://eudml.org/doc/120780},
volume = {5},
year = {2000},
}
TY - JOUR
AU - Marchal, Philippe
TI - Loop-erased random walks, spanning trees and Hamiltonian cycles.
JO - Electronic Communications in Probability [electronic only]
PY - 2000
PB - University of Washington
VL - 5
SP - 39
EP - 50
LA - eng
KW - Markov chain; random walk; spanning tree; cycle; Wilson's algorithm
UR - http://eudml.org/doc/120780
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.