Related papers: Cutoff for conjugacy-invariant random walks on the…

In the interchange process on a graph $G=(V,E)$, distinguished particles are placed on the vertices of $G$ with independent Poisson clocks on the edges. When the clock of an edge rings, the two particles on the two sides of the edge…

A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the…

Suppose we are given finitely generated groups $\Gamma_1,...,\Gamma_m$ equipped with irreducible random walks. Thereby we assume that the expansions of the corresponding Green functions at their radii of convergence contain only logarithmic…

The mixing time of a discrete-time quantum walk on the hypercube is considered. The mean probability distribution of a Markov chain on a hypercube is known to mix to a uniform distribution in time O(n log n). We show that the mean…

In this paper, we study the biased random transposition shuffle, a natural generalization of the classical random transposition shuffle studied by Diaconis and Shahshahani. We diagonalize the transition matrix of the shuffle and use these…

We investigate the asymptotic disconnection time of a large discrete cylinder $(\mathbb{Z}/N\mathbb{Z})^{d}\times \mathbb{Z}$, $d\geq 2$, by simple and biased random walks. For simple random walk, we derive a sharp asymptotic lower bound…

We consider a continuous-time random walk which is the generalization, by means of the introduction of waiting periods on sites, of the one-dimensional nonhomogeneous random walk with a position-dependent drift known in the mathematical…

Families of symmetric simple random walks on Cayley graphs of Abelian groups with a bound on the number of generators are shown to never have sharp cut off in the sense of [1], [3], or [5]. Here convergence to the stationary distribution is…

A convergence theorem is obtained for quantum random walks with particles in an arbitrary normal state. This result unifies and extends previous work on repeated-interactions models, including that of the author (2010, J. London Math. Soc.…

This article proves that, in terms of local times, the rescaled and recentered cover times of finite subsets of the discrete cylinder by simple random walk converge in law to the Gumbel distribution, as the cardinality of the set goes to…

We give criteria for ergodicity, transience and null recurrence for the random walk in random environment on {0,1,2,...}, with reflection at the origin, where the random environment is subject to a vanishing perturbation. Our results…

Dynamical evolution of systems with sparse Hamiltonians can always be recognized as continuous time quantum walks (CTQWs) on graphs. In this paper, we analyze the short time asymptotics of CTQWs. In recent studies, it was shown that for the…

We study a natural random walk over the upper triangular matrices, with entries in the field $\Z_2$, generated by steps which add row $i+1$ to row $i$. We show that the mixing time of the lazy random walk is $O(n^2)$ which is optimal up to…

Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example…

We point out a connection between fusion coefficients and random walks in a fixed level alcove associated to the root system of an affine Lie algebra and use this connection to solve completely the Dirichlet problem on such an alcove for a…

We study the time evolution of continuous-time quantum walks on randomly changing graphs. At certain moments edges of the graph appear or disappear with a given probability. We focus on the case when the time interval between subsequent…

We consider a variant of the configuration model with an embedded community structure and study the mixing properties of a simple random walk on it. Every vertex has an internal $\mathrm{deg}^{\text{int}}\geq 3$ and an outgoing…

We consider random interlacements on Z^d, with d bigger or equal to 3, when their vacant set is in a strongly percolative regime. We derive an asymptotic upper bound on the probability that the random interlacements disconnect a box of…

We analyze a semi-infinite one-dimensional random walk process with a biased motion that is incremental in one direction and long-range in the other. On a network with a fixed hierarchy of long-range jumps, we find with exact…

Given a labelled tournament on $[n]$, \emph{inverting} a vertex subset $X$ means reversing every edge with both endpoints in $X$. Alon, Powierski, Savery, Scott, and Wilmer~\cite{AlonPowierskiSaveryScottWilmer2024} asked for the mixing time…