| Título: | Loop-Erased Random Walks, Spanning Trees and Hamiltonian Cycles |
| Autores: | Marchal, Philippe; Université Paris 6 |
| Fecha: | 2000-01-01 |
| Publicador: | Electronic communications in probability |
| Fuente: |
 |
| Tipo: |
Peer-reviewed Article |
| Tema: |
Mathematics Loop-erased random walk, spanning tree, Wilson's algorithm 60J10 |
| Descripción: | 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. |
| Idioma: | Inglés |
1 On the Non-Convexity of the Time Constant in First-Passage Percolation por Kesten, Harry; Cornell University | 6 Simulations and Conjectures for Disconnection Exponents por Puckette, Emily E.; Occidental College,Werner, Wendelin; Université Paris-Sud and IUF |
2 A Proof of a Conjecture of Bobkov and Houdré por Kwapien, S.; Warsaw University,Pycia, M.; Warsaw University,Schachermayer, W.; University of Vienna | 7 Excursions Into a New Duality Relation for Diffusion Processes por Jansons, Kalvis M.; University College London |
3 Moderate Deviations for Martingales with Bounded Jumps por Dembo, Amir; Stanford University | 8 Percolation Beyond $Z^d$, Many Questions And a Few Answers por Benjamini, Itai; Weizmann Institute of Science,Schramm, Oded; Microsoft Research |
4 Bounds for Disconnection Exponents por Werner, Wendelin; Université Paris-Sud and IUF | 9 Transportation Approach to Some Concentration Inequalities in Product Spaces por Dembo, Amir; Stanford University,Zeitouni, Ofer; Technion - Israel Institute of Technology |
5 The Dimension of the Frontier of Planar Brownian Motion por Lawler, Gregory F.; Duke University | 10 Surface Stretching for Ornstein Uhlenbeck Velocity Fields por Carmona, Rene; Princeton University,Grishin, Stanislav; Princeton University,Xu, Lin; Princeton University,Molchanov, Stanislav; University of North Carolina at Charlotte |