Related papers: On Random Walks in large compact Lie groups

In this work, we will introduce and study the notion of local randomness for compact metric groups. We prove a mixing inequality as well as a product result for locally random groups under an additional dimension condition on the volume of…

Mixing properties of discrete-time quantum walks on two-dimensional grids with torus-like boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an…

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…

We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…

This paper is concerned with random walks on a family of dyadic-valued solvable matrix groups. A description of the Poisson boundary of these groups for probability measures of finite first moment and non-zero displacements (or drifts) is…

In this paper, we derive explicit formulas for the surface averaged first exit time of a discrete random walk on a finite lattice. We consider a wide class of random walks and lattices, including random walks in a non-trivial potential…

This document contains supplementary material for the main articles in our Random Cayley Graphs project. We prove refined results about simple random walks on the integers and on the cycle. We are primarily interested in the entropy of…

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…

We prove a conjecture raised by the work of Diaconis and Shahshahani (1981) about the mixing time of random walks on the permutation group induced by a given conjugacy class. To do this we exploit a connection with coalescence and…

We study models of continuous time, symmetric, $\Z^d$-valued random walks in random environments. One of our aims is to derive estimates on the decay of transition probabilities in a case where a uniform ellipticity assumption is absent. We…

In this short note we give various near optimal characterizations of random walks over finite Abelian groups with large maximum discrepancy from the uniform measure. We also provide several interesting connections to existing results in the…

We consider nearest neighbor weighted random walks on the $d$-dimensional box $[n]^d$ that are governed by some function $g:[0,1] \ra [0,\iy)$, by which we mean that standing at $x$, a neighbor $y$ of $x$ is picked at random and the walk…

Let $X$ be a lazy random walk on a graph $G$. If $G$ is undirected, then the mixing time is upper bounded by the maximum hitting time of the graph. This fails for directed chains, as the biased random walk on the cycle $\mathbb{Z}_n$ shows.…

We study the random walk on the symmetric group $S_n$ generated by the conjugacy class of cycles of length $k$. We show that the convergence to uniform measure of this walk has a cut-off in total variation distance after $\frac{n}{k} log n$…

We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…

The mixing process of discrete-time quantum walks on one-dimensional lattices is revisited in a setting where the walker is coupled to an environment, and the time evolution of the walker and the environment is unitary. The mixing process…

Multiplex networks are receiving increasing interests because they allow to model relationships between networked agents on several layers simultaneously. In this supplementary material for the paper "Navigability of interconnected networks…

We study using large deviation theory the fluctuations of time-integrated functionals or observables of the unbiased random walk evolving on Erd\"os-R\'enyi random graphs, and construct a modified, biased random walk that explains how these…

We briefly review the random matrix theory for large N by N matrices viewed as free random variables in a context of stochastic diffusion. We establish a surprising link between the spectral properties of matrix-valued multiplicative…

A proof is provided of a strong law of large numbers for a one-dimensional random walk in a dynamic random environment given by a supercritical contact process in equilibrium. The proof is based on a coupling argument that traces the…