Related papers: Effective Drift Estimates for Random Walks on Grap…

This paper concerns a random walk on a planar graph and presents certain estimates concerning the harmonic measures for the walk in a grid domain which estimates are useful for showing the convergence of a LERW (loop-erased random walk) to…

In [3] the radius of convergence of the generating function of the collision local time of two independent copies of an irreducible, symmetric and transient random walk on Zd, d \geq 1, was studied. Two versions were considered: z1, the…

We determine the precise asymptotic behaviour (in space) of the Green kernel of simple random walk with drift on the Diestel-Leader graph $DL(q,r)$, where $q,r \ge 2$. The latter is the horocyclic product of two homogeneous trees with…

Let $\nu$ be a probability distribution over the semi-group of square matrices of size $d \ge 2$ over a locally compact field $\mathbb{K}$, \textit{e.g.} $\mathbb{R}$. We consider the random walk $\overline{\gamma}_n :=…

We consider a discrete-time quantum walk $W_{t,\kappa}$ at time $t$ on a graph with joined half lines $\mathbb{J}_\kappa$, which is composed of $\kappa$ half lines with the same origin. Our analysis is based on a reduction of the walk on a…

The entropy, the spectral radius and the drift are important numerical quantities associated to random walks on countable groups. We prove sharp inequalities relating those quantities for walks with a finite second moment, improving upon…

We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models…

In this paper, we analyse a sub-class of two-dimensional homogeneous nearest neighbour (simple) random walk restricted on the lattice using the matrix geometric approach. In particular, we first present an alternative approach for the…

For $G$ a finitely generated group and $g \in G$, we say $g$ is detected by a normal subgroup $N \lhd G$ if $g \notin N$. The depth $D_G(g)$ of $g$ is the lowest index of a normal, finite index subgroup $N$ that detects $g$. In this paper…

We consider random walk on a finite group $G$ as follows. We can consider $G$ as a group of substitutions. Randomly (i.e. with probability $U(g)=|G|^{-1}$ ) we choose a substitution $g \in G$ and execute it twice in a row, i.e. execute a…

Consider the following computational problem: given a regular digraph $G=(V,E)$, two vertices $u,v \in V$, and a walk length $t\in \mathbb{N}$, estimate the probability that a random walk of length $t$ from $u$ ends at $v$ to within $\pm…

The Rado graph, also known as the random graph $G(\infty, p)$, is a classical limit object for finite graphs. We study natural ball walks as a way of understanding the geometry of this graph. For the walk started at $i$, we show that order…

Given a connected graph $G$ with some subset of its vertices excited and a fixed target vertex, in the geodesic-biased random walk on $G$, a random walker moves as follows: from an unexcited vertex, she moves to a uniformly random…

We study the statistics of the number of records $R_n$ for a symmetric, $n$-step, discrete jump process on a $1D$ lattice. At a given step, the walker can jump by arbitrary lattice units drawn from a given symmetric probability…

Drift analysis is one of the state-of-the-art techniques for the runtime analysis of randomized search heuristics (RSHs) such as evolutionary algorithms (EAs), simulated annealing etc. The vast majority of existing drift theorems yield…

For a simple (unbiased) random walk on a connected graph with $n$ vertices, the cover time (the expected number of steps it takes to visit all vertices) is at most $O(n^3)$. We consider locally biased random walks, in which the probability…

Garbe, Hladk\'y, \v{S}ileikis and Skerman [Ann. Inst. Henri Poincar\'e Probab. Stat., 60 (2024), pp. 2878-2922] recently introduced a general class of random graph processes called flip processes and proved that the typical evolution of…

Consider the braid group $B_3=< a,b| aba=bab>$ and the nearest neighbor random walk defined by a probability $\nu$ with support $\{a,a^{-1},b,b^{-1}\}$. The rate of escape of the walk is explicitly expressed in function of the unique…

We study the limit behaviour of a class of random walk models taking values in the $d$-dimensional unit standard simplex, $d\ge 1$, defined as follows. From an interior point $z$, the process chooses one of the $d+1$ vertices of the…

We establish the (non-lattice) local limit theorem for products of i.i.d. random variables on an arbitrary simply connected nilpotent Lie group $G$, where the variables are allowed to be non-centered. Our result also improves on the known…