Related papers: Optimal co-adapted coupling for a random walk on t…

Let X and Y be two simple symmetric continuous-time random walks on the vertices of the n-dimensional hypercube. We consider the class of co-adapted couplings of these processes, and describe an intuitive coupling which is shown to be the…

Consider a Brownian motion on the circumference of the unit circle, which jumps to the opposite point of the circumference at incident times of an independent Poisson process of rate $\lambda$. We examine the problem of coupling two copies…

Answering a question by Angel, Holroyd, Martin, Wilson and Winkler, we show that the maximal number of non-colliding coupled simple random walks on the complete graph $K_N$, which take turns, moving one at a time, is monotone in $N$. We use…

We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…

We examine the question of whether a collection of random walks on a graph can be coupled so that they never collide. In particular, we show that on the complete graph on n vertices, with or without loops, there is a Markovian coupling…

We derive an exact closed-form analytical expression for the distribution of the cover time for a random walk over an arbitrary graph. In special case, we derive simplified exact expressions for the distributions of cover time for a…

We address the correspondence search problem among multiple graphs with complex properties while considering the matching consistency. We describe each pair of graphs by combining multiple attributes, then jointly match them in a unified…

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 study optimal Markovian couplings of Markov processes, where the optimality is understood in terms of minimization of concave transport costs between the time-marginal distributions of the coupled processes. We provide explicit…

We study the convergence rate of translation-invariant discrete-time quantum dynamics on a one-dimensional lattice. We prove that the cumulative distributions function of the ballistically scaled position $X(n)/{n}$ after $n$ steps…

Random walks on graphs are an essential primitive for many randomised algorithms and stochastic processes. It is natural to ask how much can be gained by running $k$ multiple random walks independently and in parallel. Although the cover…

A coupling of random walkers on the same finite graph, who take turns sequentially, is said to be an avoidance coupling if the walkers never collide. Previous studies of these processes have focused almost exclusively on complete graphs, in…

Let $G = (V,E)$ be a graph on $n$ vertices and let $m^*(G)$ denote the size of a maximum matching in $G$. We show that for any $\delta > 0$ and for any $1 \leq k \leq (1-\delta)m^*(G)$, the down-up walk on matchings of size $k$ in $G$ mixes…

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

This paper explores the mixing time of the random transposition walk on the symmetric group. While it has long been known that this walk mixes in order n*log(n) time, this result has not previously been attained using coupling. A coupling…

Coalescing-branching random walks, or {\em cobra walks} for short, are a natural variant of random walks on graphs that can model the spread of disease through contacts or the spread of information in networks. In a $k$-cobra walk, at each…

What can one say on convergence to stationarity of a finite state Markov chain that behaves "locally" like a nearest neighbor random walk on ${\mathbb Z}$ ? The model we consider is a version of nearest neighbor lazy random walk on the…

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…

Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let $\mathcal{G}(n,W)$ be the random graph obtained by independently including each edge $jk$ with probability $W_{jk}$. Given a degree sequence ${\bf d}=(d_1,\ldots,…

For a graph G=(V,E), finding a set of disjoint edges that do not share any vertices is called a matching problem, and finding the maximum matching is a fundamental problem in the theory of distributed graph algorithms. Although local…