论文信息 - Markov chain intersections andtheloop-erased walk

Markov chain intersections andtheloop-erased walk

L etX and Y be independent transient Markov chains on the same state space that have the same transition probabilities. Let L denote the "loop-erased path" obtained from the path of X by erasing cycles when they are created. We prove that if the paths of X and Y have infinitely many intersections a.s., then L and Y also have infinitely many intersections a.s.  2003 Editions scientifiques et medicales Elsevier SAS MSC: primary 60J10; secondary 60G17

Russell Lyons | Yuval Peres | Oded Schramm

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

[2] Steven N. Evans. Polar and Nonpolar Sets for a Tree Indexed Process , 1992 .

[3] W. Woess. Random walks on infinite graphs and groups, by Wolfgang Woess, Cambridge Tracts , 2001 .

[4] Stephen Taylor,et al. Some intersection properties of random walk paths , 1960 .

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

[6] Yuval Peres,et al. Cutpoints and Exchangeable Events for Random Walks , 1997 .

[7] R. Pemantle. Choosing a Spanning Tree for the Integer Lattice Uniformly , 1991, math/0404043.

[8] Thomas S. Salisbury,et al. ENERGY, AND INTERSECTIONS OF MARKOV CHAINS* , 1996 .

[9] G. Lawler. Intersections of random walks , 1991 .

[10] Thomas S. Salisbury,et al. Capacity and energy for multiparameter Markov processes , 1989 .

[11] Gregory F. Lawler. LOOP-ERASED WALKS INTERSECT INFINITELY OFTEN IN FOUR DIMENSIONS , 1998 .

[12] J. Kahane. Some Random Series of Functions , 1985 .

[13] P. Meyer,et al. Probabilités et potentiel , 1966 .

[14] Jay Rosen,et al. The Range of Stable Random Walks , 1991 .

[15] Olle Häggström,et al. Random-cluster measures and uniform spanning trees , 1995 .