Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-04T18:23:13.016Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on spider walks

Published online by Cambridge University Press:  05 January 2012

Christophe Gallesco ,
Sebastian Müller  and
Serguei Popov
Christophe Gallesco
Affiliation:
Instituto de Matemática e Estatística, Universidade de São Paulo, rua do Matão 1010, CEP 05508–090, São Paulo, SP, Brazil. [email protected]
Sebastian Müller
Affiliation:
Institut für Mathematische Strukturtheorie, Technische Universität Graz, Steyrergasse 30, 8010 Graz, Austria. [email protected]
Serguei Popov
Affiliation:
Department of Statistics, Institute of Mathematics, Statistics and Scientific Computation, University of Campinas–UNICAMP, rua Sérgio Buarque de Holanda 651, CEP 13083–859, Campinas SP, Brazil. [email protected]; http://www.ime.unicamp.br/~popov
Get access

Abstract

Spider walks are systems of interacting particles. The particles move independently as long as their movements do not violate some given rules describing the relative position ofthe particles; moves that violate the rules are not realized. The goal of this paper is to study qualitative properties, as recurrence, transience, ergodicity, and positive rate of escape of these Markov processes.

Keywords

Spider walkrecurrencetransiencerate of escape
Type
Research Article
Information
ESAIM: Probability and Statistics , Volume 15: Supplement: In honor of Marc Yor , 2011 , pp. 390 - 401
Copyright
© EDP Sciences, SMAI, 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

T. Antal, P.L. Krapivsky and K. Mallick, Molecular spiders in one dimension. J. Stat. Mech. (2007).
G. Fayolle, V.A. Malyshev and M.V. Menshikov, Topics in the constructive theory of countable Markov chains. Cambridge University Press, Cambridge (1995).
C. Gallesco, S. Müller, S. Popov and M. Vachkovskaia, Spiders in random environment. arXiv:1001.2533 (2010).
Kanai, M., Rough isometries and the parabolicity of Riemannian manifolds. J. Math. Soc. Jpn 38 (1986) 227–238. CrossRef
J.G. Kemeny, J.L. Snell and A.W. Knapp, Denumerable Markov Chains. Graduate Text in Mathematics 40, 2nd edition, Springer Verlag (1976).
Lamperti, J., Criterion for the recurrence or transience of stochastic process. I. J. Math. Anal. Appl. 1 (1960) 314–330. CrossRef
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).
W. Woess, Random walks on infinite graphs and groups, Cambridge Tracts in Mathematics 138. Cambridge University Press, Cambridge (2000).
W. Woess, Denumerable Markov chains. EMS Textbooks in Mathematics, European Mathematical Society (EMS), Zürich (2009).