Related papers: Explicit expanders with cutoff phenomena
We study perfect state transfer in Grover walks on two important classes of graphs: strongly regular graphs and strongly walk-regular graphs. The latter class is a generalization of the former. We first give a complete classification of…
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…
Statistical inference for exponential-family models of random graphs with dependent edges is challenging. We stress the importance of additional structure and show that additional structure facilitates statistical inference. A simple…
It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…
A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…
This paper is a survey of various proofs of the so called {\em fundamental theorem of Markov chains}: every ergodic Markov chain has a unique positive stationary distribution and the chain attains this distribution in the limit independent…
Locally Markov walks are natural generalizations of classical Markov chains, where instead of a particle moving independently of the past, it decides where to move next depending on the last action performed at the current location. We…
In this article, we consider the number of collisions of three independent simple random walks on a subgraph of the two-dimensional square lattice obtained by removing all horizontal edges with vertical coordinate not equal to 0 and then,…
We present a recurrence-transience classification for discrete-time Markov chains on manifolds with negative curvature. Our classification depends only on geometric quantities associated to the increments of the chain, defined via the…
Let $(S_n)_n$ be a $R^d$-valued random walk ($d\geq2$). Using Babillot's method [2], we give general conditions on the characteristic function of $S_n$ under which $(S_n)_n$ satisfies the same renewal theorem as the classical one obtained…
We prove the cut-off phenomenon in total variation distance for the Brownian motions traced on the classical symmetric spaces of compact type, that is to say: (1) the classical simple compact Lie groups: special orthogonal groups, special…
A piecewise-deterministic Markov process, specified by random jumps and switching semi-flows, as well as the associated Markov chain given by its post-jump locations, are investigated in this paper. The existence of an exponentially…
We consider Activated Random Walks on arbitrary finite networks, with particles being inserted at random and absorbed at the boundary. Despite the non-reversibility of the dynamics and the lack of knowledge on the stationary distribution,…
We establish conditions on sequences of graphs which ensure that the mixing times of the random walks on the graphs in the sequence converge. The main assumption is that the graphs, associated measures and heat kernels converge in a…
Sood and Grassberger studied in [Phys. Rev. Lett. 99, 098701 (2007)] random walks on random graphs that are biased towards a fixed target point. They put forward a critical bias strength b_c such that a random walker on an infinite graph…
We construct new examples of expander Cayley graphs of finite groups, arising as congruence quotients of non-elementary subgroups of $SL_2 (\mathbb{F}_p [t])$ modulo certain square-free ideals. We describe some applications of our results…
We discuss sufficient conditions that guarantee the existence of asymptotic expansions for the Central Limit Theorem for weakly dependent random variables including observations arising from sufficiently chaotic dynamical systems like…
We study the cut-off phenomenon for a family of stochastic small perturbations of a one dimensional dynamical system. We will focus in a semi-flow of a deterministic differential equation which is perturbed by adding to the dynamics a white…
We investigate the cutoff phenomenon for Markov processes under information divergences such as $f$-divergences and R\'enyi divergences. We classify most common divergences into four types, namely $L^2$-type, $\mathrm{TV}$-type,…
Random walk on the irreducible representations of the symmetric and general linear groups is studied. A separation distance cutoff is proved and the exact separation distance asymptotics are determined. A key tool is a method for writing…