Related papers: On Rapid mixing for random walks on nilmanifolds

Considering homogeneous and oscillating random walks on the integers, we simplify classical works on recurrence of Spitzer and Kemperman, respectively. Some links with renewal theory are discussed.

We give a simple non-analytic proof of Biggins' theorem on martingale convergence for branching random walks.

We study the dynamics of random walks hopping on homogeneous hyper-cubic lattices and multiplying at a fertile site. In one and two dimensions, the total number $\mathcal{N}(t)$ of walkers grows exponentially at a Malthusian rate depending…

We investigate three aspects of weak* convergence of the $n$-step distributions of random walks on finite volume homogeneous spaces $G/\Gamma$ of semisimple real Lie groups. First, we look into the obvious obstruction to the upgrade from…

In this paper we study random walks on the hypergroup of conics in finite fields. We investigate the behavior of random walks on this hypergroup, the equilibrium distribution and the mixing times. We use the coupling method to show that the…

Random walk has wide applications in many fields, such as machine learning, biology, physics, and chemistry. Random walk can be discrete or continuous in time and space. Asymmetric random walk could be described by drift-diffusion equation.…

Graph vertex embeddings based on random walks have become increasingly influential in recent years, showing good performance in several tasks as they efficiently transform a graph into a more computationally digestible format while…

We study a distinguished random walk on affine buildings of type Ar , which was already considered by Cartwright, Saloff-Coste and Woess. In rank r=2, it is the simple random walk and we obtain optimal global bounds for its transition…

Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…

We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…

We evaluate the limit distribution of the maximal excursion of a random walk in any dimension for homogeneous environments and for self-similar supports under the assumption of spherical symmetry. This distribution is obtained in closed…

Several algorithms have been used for mass transfer between particles undergoing advective and macro-dispersive random walks. The mass transfer between particles is required for general reactions on, and among, particles. The mass transfer…

Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in determining not only the existence of cutoff and the order of…

We study an example of a {\em hit-and-run} random walk on the symmetric group $\mathbf S_n$. Our starting point is the well understood {\em top-to-random} shuffle. In the hit-and-run version, at each {\em single step}, after picking the…

Consider the random walk on the permutation group obtained when the step distribution is uniform on a given conjugacy class. It is shown that there is a critical time at which two phase transitions occur simultaneously. On the one hand, the…

Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…

Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…

In this paper we study a random walk on an affine building of type $\tilde{A}_r$, whose radial part, when suitably normalized, converges to the Brownian motion of the Weyl chamber. This gives a new discrete approximation of this process,…

We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…

We consider multidimensional random walks in pyramids, which by definition are cones formed by finite intersections of half-spaces. The main object of interest is the survival probability $\mathbb{P}(\tau>n)$, $\tau$ denoting the first exit…