论文信息 - A NOTE ON SPIDER WALKS

A NOTE ON SPIDER WALKS

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.

[1] G. Fayolle,et al. Topics in the Constructive Theory of Countable Markov Chains: Ideology of induced chains , 1995 .

[2] Serguei Popov,et al. Spiders in random environment , 2010 .

[3] G. Fayolle,et al. Topics in the Constructive Theory of Countable Markov Chains , 1995 .

[4] M. Kanai. Rough isometries and the parabolicity of riemannian manifolds , 1986 .

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

[6] John Lamperti,et al. Criteria for the recurrence or transience of stochastic process. I , 1960 .

[7] Tibor Antal,et al. Molecular spiders in one dimension , 2007, Journal of statistical mechanics.

[8] Wolfgang Woess,et al. Denumerable Markov Chains: Generating Functions, Boundary Theory, Random Walks on Trees , 2009 .

[9] L. Saloff‐Coste. RANDOM WALKS ON INFINITE GRAPHS AND GROUPS (Cambridge Tracts in Mathematics 138) , 2001 .