Related papers: From coalescing random walks on a torus to Kingman…

We study the Coulomb chain where particles are restricted to one dimension and experience three-dimensional Coulomb interactions with their nearest and next-to-nearest neighbours. The distances between consecutive particles are treated as…

We investigate a model of continuous-time simple random walk paths in $\mathbb{Z}^d$ undergoing two competing interactions: an attractive one towards the large values of a random potential, and a self-repellent one in the spirit of the…

We consider a simple discrete-time Markov chain with values in $[0,\infty)^{Z^d}$. The Markov chain describes various interesting examples such as oriented percolation, directed polymers in random environment, time discretizations of binary…

We give bounds in total variation distance for random walks associated to pure central states on free orthogonal quantum groups. As a consequence, we prove that the analogue of the uniform plane Kac walk on this quantum group has a cut-off…

We consider percolation on the discrete torus $\mathbb{Z}_n^d$ at $p_c(\mathbb{Z}^d)$, the critical value for percolation on the corresponding infinite lattice $\mathbb{Z}^d$, and within the scaling window around it. We assume that $d$ is a…

In this paper we study the rate of convergence of the iterates of \iid random piecewise constant monotone maps to the time-$1$ transport map for the process of coalescing Brownian motions. We prove that the rate of convergence is given by a…

We study the asymptotic behavior for large N of the disconnection time T_N of simple random walk on a discrete cylinder with base a d-dimensional discrete torus of side-length N. When d is sufficiently large, we are able to substantially…

We consider the set of points visited by the random walk on the discrete torus $(\mathbb{Z}/N\mathbb{Z})^d$, for $d \geq 3$, at times of order $uN^d$, for a parameter $u>0$ in the large-$N$ limit. We prove that the vacant set left by the…

Random walks on the circle group $\mathbb{R}/\mathbb{Z}$ whose elementary steps are lattice variables with span $\alpha \not\in \mathbb{Q}$ or $p/q \in \mathbb{Q}$ taken mod $\mathbb{Z}$ exhibit delicate behavior. In the rational case we…

The cutoff phenomenon describes a sharp transition in the convergence of a family of ergodic finite Markov chains to equilibrium. Many natural families of chains are believed to exhibit cutoff, and yet establishing this fact is often…

We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we…

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where basically $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that $X_1$ is…

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

Consider $a$ particles performing simple, symmetric, non-intersecting random walks, starting at points $2(j-1)$, $1\le j\le a$ at time 0 and ending at $2(j-1)+c-b$ at time $b+c$. This can also be interpreted as a random rhombus tiling of an…

A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…

We prove the optimal rate of quantitative propagation of chaos, uniformly in time, for interacting diffusions. Our main examples are interactions governed by convex potentials and models on the torus with small interactions. We show that…

We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…

We provide an analysis of the expected meeting time of two independent random walks on a regular graph. For 1-D circle and 2-D torus graphs, we show that the expected meeting time can be expressed as the sum of the inverse of non-zero…

An individual-based model of an infinite system of point particles in $\mathbb{R}^d$ is proposed and studied. In this model, each particle at random produces a finite number of new particles and disappears afterwards. The phase space for…

We consider a discrete time simple symmetric random walk on Z^d, d>=1, where the path of the walk is perturbed by inserting deterministic jumps. We show that for any time n and any deterministic jumps that we insert, the expected number of…