Related papers: Walks on graphs and lattices -- effective bounds a…

We construct a continuous-time non-commutative random walk on $U(\mathfrak{gl}_N)$ with dilation maps $U(\mathfrak{gl}_N)\rightarrow L^2(U(N))^{\otimes\infty}$. This is an analog of a continuous-time non-commutative random walk on the group…

Let $\Cal S$ be an abelian group of automorphisms of a probability space $(X, {\Cal A}, \mu)$ with a finite system of generators $(A_1, ..., A_d)$. Let $A^{\el}$ denote $A_1^{\ell_1} ... A_d^{\ell_d}$, for ${\el}= (\ell_1, ..., \ell_d)$. If…

Consider the random walk $G_n : = g_n \ldots g_1$, $n \geq 1$, where $(g_n)_{n\geq 1}$ is a sequence of independent and identically distributed random elements with law $\mu$ on the general linear group ${\rm GL}(V)$ with $V=\mathbb R^d$.…

We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…

Let $(g_n)_{n\geq 1}$ be a sequence of independent and identically distributed random elements with law $\mu$ on the general linear group $\textup{GL}(V)$, where $V=\mathbb R^d$. Consider the random walk $G_n : = g_n \ldots g_1$, $n \geq…

A discrete Gibbsian line ensemble $\mathfrak{L} = (L_1,\dots,L_N)$ consists of $N$ independent random walks on the integers conditioned not to cross one another, i.e., $L_1 \geq \cdots \geq L_N$. In this paper we provide sufficient…

In this paper, we extend a result of Kesten and Spitzer (1979). Let us consider a stationary sequence $(\xi\_k:=f(T^k(.)))\_k$ given by an invertible probability dynamical system and some centered function $f$. Let $(S\_n)\_n$ be a simple…

We study the transition probability, say $p_A^n(x,y)$, of a one-dimensional random walk on the integer lattice killed when entering into a non-empty finite set $A$. The random walk is assumed to be irreducible and have zero mean and a…

We consider random walks on finite vertex-transitive graphs $\Gamma$ of bounded degree. We find a simple geometric condition which characterises the cover time fluctuations: the suitably normalised cover time converges to a standard Gumbel…

Let $G$ be a connected simple real Lie group, $\Lambda_{0}\subseteq G$ a lattice and $\Lambda \unlhd \Lambda_{0}$ a normal subgroup such that $\Lambda_{0}/\Lambda\simeq \mathbb{Z}^d$. We study the drift of a random walk on the…

We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…

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…

Let L be a Lie group and Lambda a lattice in L. Suppose G is a non-compact simple Lie group realized as a Lie subgroup of L, and the image of G on L/Lambda is dense. Let c be a diagonalizable element of G not contained in a compact…

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…

For a generalized step reinforced random walk, starting from the origin, the first step is taken according to the first element of an innovation sequence. Then in subsequent epochs, it recalls a past epoch with probability proportional to a…

Let $\Gamma$ be a countable group acting on a geodesic Gromov-hyperbolic metric space $X$ and $\mu$ a probability measure on $\Gamma$ whose support generates a non-elementary subsemigroup. Under the assumption that $\mu$ has a finite…

In this paper we study random walks on a finitely generated group $G$ which has a free action on a $\mathbb{Z}^n$-tree. We show that if $G$ is non-abelian and acts minimally, freely and without inversions on a locally finite…

We study a model of random walk on a fluctuating rough surface using the field-theoretic renormalization group (RG). The surface is modelled by the well-known Kardar--Parisi--Zhang (KPZ) stochastic equation while the random walk is…

We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…

We consider the Grover walk model on a connected finite graph with two infinite length tails and we set an $\ell^\infty$-infinite external source from one of the tails as the initial state. We show that for any connected internal graph, a…