Christophe Gallesco, Sebastian Müller, Serguei Popov
Published 2009-10-19, updated 2010-03-17Version 2
Spider walks are systems of interacting particles. The particles move independently as long as their movement 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.
Comments: revised version; to appear in ESAIM-PS
Stein's method for diffusive limit of Markov processes
Markov processes on the path space of the Gelfand-Tsetlin graph and on its boundary
The criterion for uniqueness of quasi-stationary distributions of Markov processes and their domain of attraction problem
![QR code for arXiv:0910.3584 [math.PR]](http://oss.arxitics.com/images/favicon.svg)