Related papers: The stratum of random mapping classes
We consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…
We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such walk by studying the phase diagram…
We consider random self-avoiding walks between two points on the boundary of a finite subdomain of Z^d (the probability of a self-avoiding trajectory gamma is proportional to mu^{-length(gamma)}). We show that the random trajectory becomes…
In this paper, the local asymptotic estimation for the supremum of a random walk and its applications are presented. The summands of the random walk have common long-tailed and generalized strong subexponential distribution. This…
We study the support (i.e. the set of visited sites) of a t step random walk on a two-dimensional square lattice in the large t limit. A broad class of global properties M(t) of the support is considered, including, e.g., the number S(t) of…
Let S be a nonexceptional oriented surface of finite type. We construct an uncountable family of probability measures on the space of area on holomorphic quadratic differentials over the moduli space for S containing the usual Lebesgue…
We give explicit pseudo-Anosov homeomorphisms with vanishing Sah-Arnoux-Fathi invariant. Any translation surface whose Veech group is commensurable to any of a large class of triangle groups is shown to have an affine pseudo-Anosov…
The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…
We show that anomalous diffusion can result when the steps of a random walk are not statistically independent. We present an algorithm that counts all the possible paths of particles diffusing on random graphs with arbitrary degree…
Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…
We prove a general noncommutative law of large numbers. This applies in particular to random walks on any locally finite homogeneous graph, as well as to Brownian motion on Riemannian manifolds which admit a compact quotient. It also…
Many seemingly disparate Markov chains are unified when viewed as random walks on the set of chambers of a hyperplane arrangement. These include the Tsetlin library of theoretical computer science and various shuffling schemes. If only…
We prove that in any recurrent reversible random rooted graph, two independent simple random walks started at the same vertex collide infinitely often almost surely. This applies to the Uniform Infinite Planar Triangulation and…
In this paper, we analyze the natural homomorphism from the genus g handlebody group to the outer automorphism group of the free group with rank g, in terms of length spectra. In general, the preimage of each fully irreducible outer…
We investigate the structure of the characteristic polynomial det(xI-T) of a transition matrix T that is associated to a train track representative of a pseudo-Anosov map [F] acting on a surface. As a result we obtain three new polynomial…
We consider random walks in dynamic random environments, with an environment generated by the time-reversal of a Markov process from the oriented percolation universality class. If the influence of the random medium on the walk is small in…
This paper is concerned with random walks on a family of dyadic-valued solvable matrix groups. A description of the Poisson boundary of these groups for probability measures of finite first moment and non-zero displacements (or drifts) is…
We define and characterise regular sequences in affine buildings, thereby giving the "$p$-adic analogue" of the fundamental work of Kaimanovich. As applications we prove limit theorems for random walks on affine buildings and their…
We introduce a class of generative network models that insert edges by connecting the starting and terminal vertices of a random walk on the network graph. Within the taxonomy of statistical network models, this class is distinguished by…
Let $X_1$, $X_2$, $...$ be a sequence of independently and identically distributed random variables with $\mathsf{E}X_1=0$, and let $S_0=0$ and $S_t=S_{t-1}+X_t$, $t=1,2,...$, be a random walk. Denote $\tau={cases}\inf\{t>1: S_t\leq0\},…