Volume 15, 2011
|Page(s)||390 - 401|
|Published online||05 January 2012|
A note on spider walks
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. firstname.lastname@example.org
2 Institut für Mathematische Strukturtheorie, Technische Universität Graz, Steyrergasse 30, 8010 Graz, Austria. email@example.com
3 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. firstname.lastname@example.org; http://www.ime.unicamp.br/~popov
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 of the 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.
Mathematics Subject Classification: 60J27 / 60K99
Key words: Spider walk / recurrence / transience / rate of escape
© EDP Sciences, SMAI, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.