Related papers: A random walk on the symmetric group generated by …

We consider the probability $p(S_n)$ that a pair of random permutations generates either the alternating group $A_n$ or the symmetric group $S_n$. Dixon (1969) proved that $p(S_n)$ approaches $1$ as $n\to\infty$ and conjectured that…

In this paper, we discuss asymptotic behavior of the capacity of the range of symmetric simple random walks on finitely generated groups. We show the corresponding strong law of large numbers and central limit theorem.

Random walk on the irreducible representations of the symmetric and general linear groups is studied. A separation distance cutoff is proved and the exact separation distance asymptotics are determined. A key tool is a method for writing…

The starting point is the known fact that some much-studied random walks on permutations, such as the Tsetlin library, arise from walks on real hyperplane arrangements. This paper explores similar walks on complex hyperplane arrangements.…

We study models of continuous time, symmetric, $\Z^d$-valued random walks in random environments. One of our aims is to derive estimates on the decay of transition probabilities in a case where a uniform ellipticity assumption is absent. We…

Using spectral graph theory, we show how to obtain inequalities for the number of walks in graphs from nonnegative polynomials and present a new family of such inequalities.

This survey is concerned with random walks on mapping class groups. We illustrate how the actions of mapping class groups on Teichm\"uller spaces or curve complexes reveal the nature of random walks, and vice versa. Our emphasis is on the…

An involution is a permutation that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathbf{N}_{n}(\sigma)$ denote the number of ways to write $\sigma$ as a product of two involutions of $[n].$ If we endow the symmetric…

We consider a discrete-time random motion, Markov chain on the Poincar\'{e} disk. In the basic variant of the model a particle moves along certain circular arcs within the disk, its location is determined by a composition of random…

Random walks are powerful tools to analyze spatial-temporal patterns produced by living organisms ranging from cells to humans. At the same time, it is evident that these patterns are not completely random but are results of a convolution…

Starting with a percolation model in $\Z^d$ in the subcritical regime, we consider a random walk described as follows: the probability of transition from $x$ to $y$ is proportional to some function $f$ of the size of the cluster of $y$.…

Let G be a free product of a finite family of finite groups, with the set of generators being formed by the union of the finite groups. We consider a transient nearest-neighbour random walk on G. We give a new proof of the fact that the…

In [3] the radius of convergence of the generating function of the collision local time of two independent copies of an irreducible, symmetric and transient random walk on Zd, d \geq 1, was studied. Two versions were considered: z1, the…

Reflecting boundary conditions cause two one-dimensional random walks to synchronize if a common direction is chosen in each step. The mean synchronization time and its standard deviation are calculated analytically. Both quantities are…

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…

The investigation of random walks is central to a variety of stochastic processes in physics, chemistry, and biology. To describe a transport phenomenon, we study a variant of the one-dimensional persistent random walk, which we call a…

We analyze random walks on a class of semigroups called ``left-regular bands''. These walks include the hyperplane chamber walks of Bidigare, Hanlon, and Rockmore. Using methods of ring theory, we show that the transition matrices are…

Let H(n) be the group of 3x3 uni-uppertriangular matrices with entries in Z/nZ, the integers mod n. We show that the simple random walk converges to the uniform distribution in order n^2 steps. The argument uses Fourier analysis and is…

Random walks over directed graphs are used to model activities in many domains, such as social networks, influence propagation, and Bayesian graphical models. They are often used to compute the importance or centrality of individual nodes…

We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…