Related papers: On Random Walks in large compact Lie groups
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…
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…
We present an overview of the representation theoretic techniques used to study the mixing times of random walks on finite groups. We focus on the card shuffle studied by Diaconis and Shahshahani in the 1980s and a recent improvement on…
In this paper we study continuous-time quantum walks on Cayley graphs of the symmetric group, and prove various facts concerning such walks that demonstrate significant differences from their classical analogues. In particular, we show that…
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…
This article rigorously analyzes the meeting time between pursuers and evaders performing random walks on digraphs. There exist several bounds on the expected meeting time between random walkers on graphs in the literature, however,…
This work focuses on the quantum mixing time, which is crucial for efficient quantum sampling and algorithm performance. We extend Richter's previous analysis of continuous time quantum walks on the periodic lattice $\mathbb{Z}_{n_1}\times…
We study the asymptotic probability that a random walk with heavy-tailed increments crosses a high boundary on a random time interval. We use new techniques to extend results of Asmussen [Ann. Appl. Probab. 8 (1998) 354-374] to completely…
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…
We study the robustness under perturbations of mixing times, by studying mixing times of random walks in percolation clusters inside boxes in $\Z^d$. We show that for $d \geq 2$ and $p > p_c(\Z^d)$, the mixing time of simple random walk on…
Strong ratio limit theorems associated with a broad class of spread out random walks on unimodular groups were proved in the preceding paper, where these random walks were assumed to have the convergence parameter $R=1$. In the present…
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…
In this paper, we will study the behavior of the space of positive harmonic functions associated with the random walk on a discrete group under the change of probability measure by a randomized stopping time. We show that this space remains…
We analyze continuous-time quantum walks on necklace graphs - cyclical graphs consisting of many copies of a smaller graph (pearl). Using a Bloch-type ansatz for the eigenfunctions, we block-diagonalize the Hamiltonian, reducing the…
We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…
We prove a law of large numbers for certain random walks on certain attractive dynamic random environments when initialised from all sites equal to the same state. This result applies to random walks on $\mathbb{Z}^d$ with $d\geq1$. We…
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…
In this note, we demonstrate an instance of bounded-degree graphs of size $n$, for which the total variation mixing time for the random walk is decreased by a factor of $\log n/ \log\log n$ if we multiply the edge-conductances by bounded…
We study the cut-off phenomenon for random walks on free unitary quantum groups coming from quantum conjugacy classes of classical reflections. We obtain in particular a quantum analogue of the result of U. Porod concerning certain mixtures…
In this paper we survey the theory of random walks on buildings and associated groups of Lie type and Kac-Moody groups. We begin with an introduction to the theory of Coxeter systems and buildings, taking a largely combinatorial…