Related papers: On large deviations for the range of a two-dimensi…

We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdos-Renyi random graphs and Barabasi-Albert scale free networks, these walks are…

We study large deviations for random walks on stratified (Carnot) Lie groups. For such groups, there is a natural collection of vectors which generates their Lie algebra, and we consider random walks with increments in only these…

In this paper the multi-dimensional random walk models governed by distributed fractional order differential equations and multi-term fractional order differential equations are constructed. The scaling limits of these random walks to a…

In this paper, we study the dynamics of a random walker diffusing on a disordered one-dimensional lattice with random trappings. The distribution of escape probabilities is computed exactly for any strength of the disorder. These…

Although the theoretical behavior of one-dimensional random walks in random environments is well understood, the numerical evaluation of various characteristics of such processes has received relatively little attention. This paper develops…

Let S_1(n),...,S_p(n) be independent symmetric random walks in Z^d. We establish moderate deviations and law of the iterated logarithm for the intersection of the ranges #{S_1[0,n]\cap... \cap S_p[0,n]} in the case d=2, p\ge 2 and the case…

We consider a model for random walks on random environments (RWRE) with random subset of Z^d as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We…

In this paper, we find a natural four dimensional analog of the moderate deviation results for the capacity of the random walk, which corresponds to Bass, Chen and Rosen \cite{BCR} concerning the volume of the random walk range for $d=2$.…

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…

Random walks are studied on disordered cellular networks in 2-and 3-dimensional spaces with arbitrary curvature. The coefficients of the evolution equation are calculated in term of the structural properties of the cellular system. The…

Let $\Gamma$ be a countable group acting on a geodesic hyperbolic metric space $X$ and $\mu$ a probability measure on $\Gamma$ which generates a non elementary semi-group. Under the necessary assumption that $\mu$ has a finite exponential…

Let $d$ be a positive integer and $A$ a set in $\mathbb{Z}^d$, which contains finitely many points with integer coordinates. We consider $X$ a standard random walk perturbed on the set $A$, that is, a Markov chain whose transition…

A previous paper (hep-lat/9311011) proposed a new kind of random walk on a spherically-symmetric lattice in arbitrary noninteger dimension $D$. Such a lattice avoids the problems associated with a hypercubic lattice in noninteger dimension.…

We consider a discrete time simple symmetric random walk on Z^d, d>=1, where the path of the walk is perturbed by inserting deterministic jumps. We show that for any time n and any deterministic jumps that we insert, the expected number of…

Using an inverse of the standard linear congruential random number generator, large randomly occupied lattices can be visited by a random walker without having to determine the occupation status of every lattice site in advance. In seven…

We consider a branching random walk on a $d$-ary tree of height $n$ ($n \in \mathbb{N}$), under the presence of a hard wall which restricts each value to be positive, where $d$ is a natural number satisfying $d\geqslant2$. The question of…

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…

The possibility to identify the nature (e.g. random or scale free) of complex networks while performing respective random walks is investigated with respect to autonomous agents based on Bayesian decision theory and humans navigating…

A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.

In this paper we study the asymptotic behavior of the Random-Walk Metropolis algorithm on probability densities with two different `scales', where most of the probability mass is distributed along certain key directions with the…