Related papers: A strong stationary time for random transpositions

We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…

The usual random walk on a group (homogeneous both in time and in space) is determined by a probability measure on the group. In a random walk with random transition probabilities this single measure is replaced with a stationary sequence…

The mixing time of a random walk, with or without backtracking, on a random graph generated according to the configuration model on $n$ vertices, is known to be of order $\log n$. In this paper we investigate what happens when the random…

We study random walks on the lampshuffler group $\mathrm{FSym}(H)\rtimes H$, where $H$ is a finitely generated group and $\mathrm{FSym}(H)$ is the group of finitary permutations of $H$. We show that for any step distribution $\mu$ with a…

We give a simple and direct treatment of the strong convergence of quantum random walks to quantum stochastic operator cocycles, via the semigroup decomposition of such cocycles. Our approach also delivers convergence of the pointwise…

We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…

We consider random walk on a finite group $G$ as follows. We can consider $G$ as a group of substitutions. Randomly (i.e. with probability $U(g)=|G|^{-1}$ ) we choose a substitution $g \in G$ and execute it twice in a row, i.e. execute a…

The Diaconis--Gangolli random walk is an algorithm that generates an almost uniform random graph with prescribed degrees. In this paper, we study the mixing time of the Diaconis--Gangolli random walk restricted on $n\times n$ contingency…

We study the mixing time of a non-Markovian process, the step-reinforced random walk (SRRW) on a finite group. This process differs from a classical random walk in that at each integer time, with probability $\alpha$ the next step is chosen…

We present a derivation of the exact sign-time distribution for a random walker in the presence of a boundary moving with constant velocity.

The random walk to be considered takes place in the d- spherical dual of the group U(n + 1), for a fixed finite dimensional irreducible representation d of U(n). The transition matrix comes from the three term recursion relation satisfied…

We bound the rate of convergence to stationarity for a signed generalization of the Bernoulli-Laplace diffusion model; this signed generalization is a Markov chain on the homogeneous space (Z_2 \wr S_n) / (S_r \times S_{n-r}). Specifically,…

Let G be a countable group which acts by isometries on a separable, but not necessarily proper, Gromov hyperbolic space X. We say the action of G is weakly hyperbolic if G contains two independent hyperbolic isometries. We show that a…

Given a symmetric random walk in $Z^2$ with finite second moments, let $R_n$ be the range of the random walk up to time $n$. We study moderate deviations for $R_n -E R_n$ and $E R_n -R_n$. We also derive the corresponding laws of the…

We consider a family of continuous time symmetric random walks indexed by $k\in \mathbb{N}$, $\{X_k(t),\,t\geq 0\}$. For each $k\in \mathbb{N}$ the matching random walk take values in the finite set of states…

We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…

We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…

Our aim is to unify and extend the large deviation upper and lower bounds for the occupation times of a Markov process with $L_2$ semigroups under minimal conditions on the state space and the process trajectories; for example, no strong…

We study analytically the order statistics of a time series generated by the successive positions of a symmetric random walk of n steps with step lengths of finite variance \sigma^2. We show that the statistics of the gap d_{k,n}=M_{k,n}…

We bound the rate of convergence to uniformity for certain random walks on the complete monomial groups G \wr S_n for any group G. These results provide rates of convergence for random walks on a number of groups of interest: the…