Related papers: Mixing trichotomy for random walks on directed sto…
We consider a dynamic random graph on $n$ vertices that is obtained by starting from a random graph generated according to the configuration model with a prescribed degree sequence and at each unit of time randomly rewiring a fraction…
This paper considers non-backtracking random walks on random graphs generated according to the configuration model. The quantity of interest is the scaling of the mixing time of the random walk as the number of vertices of the random graph…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
In this paper, we are interested in the impact of communities on the mixing behavior of the non-backtracking random walk. We consider sequences of sparse random graphs of size $N$ generated according to a variant of the classical…
We consider the generalised PageRank walk on a digraph $G$, with refresh probability $\alpha$ and resampling distribution $\lambda$. We analyse convergence to stationarity when $G$ is a large sparse random digraph with given degree…
We study convergence to stationarity for random walks on dynamic random digraphs with given degree sequences. The digraphs undergo full regeneration at independent geometrically distributed random time intervals with parameter $\alpha$.…
Given a sequence $(\mathfrak{X}_i, \mathscr{K}_i)_{i=1}^\infty$ of Markov chains, the cut-off phenomenon describes a period of transition to stationarity which is asymptotically lower order than the mixing time. We study mixing times and…
We study random walks on dynamically evolving graphs, where the environment is given by a time-dependent subset of the edges of an underlying graph. Concretely, following the recently introduced framework of Lelli and Stauffer, we consider…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
We analyze the bootstrap percolation process on the stochastic block model (SBM), a natural extension of the Erd\H{o}s--R\'{e}nyi random graph that incorporates the community structure observed in many real systems. In the SBM, nodes are…
The theory of rapid mixing random walks plays a fundamental role in the study of modern randomised algorithms. Usually, the mixing time is measured with respect to the worst initial position. It is well known that the presence of…
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…
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 introduce a general class of random walks on the $N$-hypercube, study cut-off for the mixing time, and provide several types of representation for the transition probabilities. We observe that for a sub-class of these processes with long…
Bootstrap percolation provides an emblematic instance of phase behavior characterised by an abrupt transition with diverging critical fluctuations. This unusual hybrid situation generally occurs in particle systems in which the occupation…
The random-cluster model is a unifying framework for studying random graphs, spin systems and electrical networks that plays a fundamental role in designing efficient Markov Chain Monte Carlo (MCMC) sampling algorithms for the classical…
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 prove that the mixing time of driven-dissipative activated random walk on an interval of length $n$ with uniform or central driving exhibits cutoff at $n$ times the critical density for activated random walk on the integers. The proof…
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…
How many shuffles are needed to mix up a deck of cards? This question may be answered in the language of a random walk on the symmetric group, $S_{52}$. This generalises neatly to the study of random walks on finite groups, themselves a…