Related papers: Random Walk on a Co-Compact Fuchsian Group

We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…

We consider the branching random walks in $d$-dimensional integer lattice with time--space i.i.d. offspring distributions. Then the normalization of the total population is a nonnegative martingale and it almost surely converges to a…

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

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…

We introduce a new self-interacting random walk on the integers in a dynamic random environment and show that it converges to a pure diffusion in the scaling limit. We also find a lower bound on the diffusion coefficient in some special…

Let X be a locally finite, connected graph without vertices of degree 1. Non-backtracking random walk moves at each step with equal probability to one of the "forward" neighbours of the actual state, i.e., it does not go back along the…

The paper analyzes a specific class of random walks on quotients of $X:=\text{SL}(k,{\Bbb R})/ \Gamma$ for a lattice $\Gamma$. Consider a one parameter diagonal subgroup, $\{g_t\}$, with an associated abelian expanding horosphere, $U\cong…

We study simple random walk on the class of random planar maps which can be encoded by a two-dimensional random walk with i.i.d. increments or a two-dimensional Brownian motion via a "mating-of-trees" type bijection. This class includes the…

This is the second in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. The first…

We are interested in the Guivarc'h inequality for admissible random walks on finitely generated relatively hyperbolic groups, endowed with a word metric. We show that for random walks with finite super-exponential moment, if this inequality…

We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…

We introduce a discrete-time random walk model on a one-dimensional lattice with a nonconstant sojourn time and prove that the discrete density converges to a solution of a continuum diffusion equation. Our random walk model is not…

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

Let $S=\Gamma\backslash \mathbb{H}$ be a hyperbolic surface of finite topological type, such that the Fuchsian group $\Gamma \le \operatorname{PSL}_2(\mathbb{R})$ is non-elementary, and consider any generating set $\mathfrak S$ of $\Gamma$.…

We introduce a random walk in random environment associated to an underlying directed polymer model in $1+1$ dimensions. This walk is the positive temperature counterpart of the competition interface of percolation and arises as the limit…

We study the occupation measure of various sets for a symmetric transient random walk in $Z^d$ with finite variances. Let $\mu^X_n(A)$ denote the occupation time of the set $A$ up to time $n$. It is shown that $\sup_{x\in…

We introduce the discrete affine group of a regular tree as a finitely generated subgroup of the affine group. We describe the Poisson boundary of random walks on it as a space of configurations. We compute isoperimetric profile and Hilbert…

A recurrent graph $G$ has the infinite collision property if two independent random walks on $G$, started at the same point, collide infinitely often a.s. We give a simple criterion in terms of Green functions for a graph to have this…

We consider a one-dimensional simple symmetric exclusion process in equilibrium, constituting a dynamic random environment for a nearest-neighbor random walk that on occupied/vacant sites has two different local drifts to the right. We…

We study the asymptotic behaviour of a random walk whose evolution is dependent on the state of an itself dynamically evolving environment. In particular, we extend our previous results in [Bethuelsen and V\"ollering, 2016] and prove a…