Related papers: Random walks on combs

In this paper we study the asymptotic behavior of Brownian motion in both comb-shaped planar domains, and comb-shaped graphs. We show convergence to a limiting process when both the spacing between the teeth \emph{and} the width of the…

We study the asymptotic behavior the exit times of random walk from Euclidean balls around the origin of the incipient infinite cluster in a manner inspired by [26]. We do this by obtaining bounds on the effective resistance between the…

We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…

We consider a random walk in an i.i.d. random environment on Z that is perturbed by cookies of strength 1. The number of cookies per site is assumed to be i.i.d. Results on the speed of the random walk are obtained. Our main tool is the…

This letter treats the quantum random walk on the line determined by a 2 times 2 unitary matrix U. A combinatorial expression for the mth moment of the quantum random walk is presented by using 4 matrices, P, Q, R and S given by U. The…

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…

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…

We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…

Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…

Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not…

We compute the exponential decay of the probability that a given multi-dimensional random walk stays in a convex cone up to time $n$, as $n$ goes to infinity. We show that the latter equals the minimum, on the dual cone, of the Laplace…

In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…

We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…

The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…

In this paper we study some properties of random walks perturbed at extrema, which are generalizations of the walks considered e.g., in Davis (1999). This process can also be viewed as a version of {\em excited random walk}, studied…

In this paper, we derive the distribution of a two-dimensional (complex) random walk in which the angle of each step is restricted to a subset of the circle. This setting appears in various domains, such as in over-the-air computation in…

We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…

In this paper, we give some sufficient conditions for the infinite collisions of independent simple random walks on a wedge comb with profile $\{f(n), n\in \ZZ\}$. One interesting result is that if $f(n)$ has a growth order as $n\log n$,…

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 study here a detailed conjecture regarding one of the most important cases of anomalous diffusion, i.e the behavior of the "ant in the labyrinth". It is natural to conjecture (see [16] and [8]) that the scaling limit for random walks on…