A note on spider walks

ESAIM - Probability and Statistics

Volumn 15, Issue , 2011, Pages 390-401

  Gallesco, Christophe ^a   Müller, Sebastian ^b   Popov, Serguei ^c  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^c UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Rate of escape; Recurrence; Spider walk; Transience

Indexed keywords

ERGODICITY; INTERACTING PARTICLES; QUALITATIVE PROPERTIES; RATE OF ESCAPE; RECURRENCE; RELATIVE POSITIONS; SPIDER WALK; TRANSIENCE;

STATISTICS;

MARKOV PROCESSES;

EID: 79959624439     PISSN: 12928100     EISSN: 12623318     Source Type: Journal    
DOI: 10.1051/ps/2010008     Document Type: Article

References (9)

1. T. Antal, P.L. Krapivsky and K. Mallick, Molecular spiders in one dimension. J. Stat. Mech. (2007).
2. G. Fayolle, V.A. Malyshev and M.V. Menshikov, Topics in the constructive theory of countable Markov chains. Cambridge University Press, Cambridge (1995).
3. C. Gallesco, S. Müller, S. Popov and M. Vachkovskaia, Spiders in random environment. arXiv:1001.2533 (2010).
4. M. Kanai, Rough isometries and the parabolicity of Riemannian manifolds. J. Math. Soc. Jpn 38 (1986) 227-238.
5. J.G. Kemeny, J.L. Snell and A.W. Knapp, Denumerable Markov Chains. Graduate Text in Mathematics 40, 2nd edition, Springer Verlag (1976).
6. J. Lamperti, Criterion for the recurrence or transience of stochastic process. I. J. Math. Anal. Appl. 1 (1960) 314-330.
7. R. Lyons and Y. Peres, Probability on Trees and Networks. Cambridge University Press. In preparation. Current version available at http://mypage.iu.edu/rdlyons/, (2009).
8. W. Woess, Random walks on infinite graphs and groups, Cambridge Tracts in Mathematics 138. Cambridge University Press, Cambridge (2000).
9. EMS Textbooks in Mathematics, European Mathematical Society (EMS), Zürich (2009).