Related papers: Speed exponents of random walks on groups

We study a class of nearest-neighbor discrete time integer random walks introduced by Zerner, the so called multi-excited random walks. The jump probabilities for such random walker have a drift to the right whose intensity depends on a…

We study a simple model in which the growth of a network is determined by the location of one or more random walkers. Depending on walker speed, the model generates a spectrum of structures situated between well-known limiting cases. We…

Fix $k\geq 2$, choose $\frac{\log n}{n^{(k-1)/k}}\leq p\leq 1-\Omega(\frac{\log^4 n}{n})$, and consider $G\sim G(n,p)$. For any pair of vertices $v,w\in V(G)$, we give a simple and precise formula for the expected number of steps that a…

A number of papers have examined various aspects of "random random" walks on finite groups; the purpose of this article is to provide a survey of this work and to show, bring together, and discuss some of the arguments and results in this…

We prove that the law of a random walk $X_n$ is determined by the one-dimensional distributions of $\max(X_n, 0)$ for $n = 1, 2, \ldots$, as conjectured recently by Lo\"ic Chaumont and Ron Doney. Equivalently, the law of $X_n$ is determined…

In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…

Recently, many streaming algorithms have utilized generalizations of the fact that the expected maximum distance of any $4$-wise independent random walk on a line over $n$ steps is $O(\sqrt{n})$. In this paper, we show that $4$-wise…

We consider the simple random walk on the infinite cluster of the Bernoulli bond percolation of trees, and investigate the relation between the speed of the simple random walk and the retaining probability p by studying three classes of…

A random walk on a regular tree (or any non-amenable graph) has positive speed. We ask whether such a walk can be slowed down by applying carefully chosen time-dependent permutations of the vertices. We prove that on trees the random walk…

On a locally compact group $E$ with countable base, we consider a random walk $X$ that has a unique (up to a positive factor) $r$-invariant measure for some $r>0$. Under some weak conditions on the measure, there is a unique continuous…

Discrete pedestrian simulation models are viable alternatives to particle based approaches based on a continuous spatial representation. The effects of discretisation, however, also imply some difficulties in modelling certain phenomena…

Several cycle lexicographical orders are found to describe the relative likelihood of elements of the random walks on the symmetric group generated by the conjugacy classes of transpositions, 3-cycles, and n-cycles. Spectral analysis finds…

An action trace is a function naturally associated to a probability measure preserving action of a group on a standard probability space. For countable amenable groups, we characterise stability in permutations using action traces. We…

We study a self-attractive random walk such that each trajectory of length $N$ is penalised by a factor proportional to $\exp ( - |R_N|)$, where $R_N$ is the set of sites visited by the walk. We show that the range of such a walk is close…

We consider a population of $N$ labeled random walkers moving on a substrate, and an excitation jumping among the walkers upon contact. The label $\mathcal{X}(t)$ of the walker carrying the excitation at time $t$ can be viewed as a…

We consider nondegenerate, finitely supported random walks on a finitely generated Gromov hyperbolic group. We show that the entropy and the escape rate are Lipschitz functions of the probability if the support remains constant.

Random walk is an explainable approach for modeling natural processes at the molecular level. The Random Permutation Set Theory (RPST) serves as a framework for uncertainty reasoning, extending the applicability of Dempster-Shafer Theory.…

We study linearly edge-reinforced random walks on $\mathbb{Z}_+$, where each edge $\{x,x+1\}$ has the initial weight $x^{\alpha} \vee 1$, and each time an edge is traversed, its weight is increased by $\Delta$. It is known that the walk is…

We analyze Jim Propp's P-machine, a simple deterministic process that simulates a random walk on $Z^d$ to within a constant. The proof of the error bound relies on several estimates in the theory of simple random walks and some careful…

Let $G$ be a finitely generated group equipped with a finite symmetric generating set and the associated word length function $|\cdot |$. We study the behavior of the probability of return for random walks driven by symmetric measures $\mu$…