Related papers: Topological and Geometrical Random Walks on Bidisp…
In this paper, the leading term of the asymptotics of the number of possible final positions of a random walk on a directed Hamiltonian metric graph is found. Consideration of such dynamical systems could be motivated by problems of…
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.
The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of…
We study a discrete time self interacting random process on graphs, which we call Greedy Random Walk. The walker is located initially at some vertex. As time evolves, each vertex maintains the set of adjacent edges touching it that have not…
In this note, we compute the probability that a two-dimensional symmetric random walk visits more vertices than expected, for deviations on scales between the mean behavior and linear growth.
In this article we consider transient random walks on free products of graphs. We prove that the asymptotic range of these random walks exists and is strictly positive. In particular, we show that the range varies real-analytically in terms…
We prove limit theorems for random walks with $n$ steps in the $d$-dimensional Euclidean space as both $n$ and $d$ tend to infinity. One of our results states that the path of such a random walk, viewed as a compact subset of the…
Random walks by single-node agents have been systematically conducted on various types of complex networks in order to investigate how their topologies can affect the dynamics of the agents. However, by fitting any network node, these…
We study the operator associated to a random walk on $\R^d$ endowed with a probability measure. We give a precise description of the spectrum of the operator near $1$ and use it to estimate the total variation distance between the iterated…
Consider a collaborative dynamic of $k$ independent random walks on a finite connected graph $G$. We are interested in the size of the set of vertices visited by at least one walker and study how the number of walkers relates to the…
We consider the operator associated to a random walk on finite volume surfaces with hyperbolic cusps. We study the spectral gap (upper and lower bound) associated to this operator and deduce some rate of convergence of the iterated kernel…
We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…
This paper studies the on- and off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.
Consider a continuous time random walk in $\mathbb{Z}$ with independent and exponentially distributed jumps $\pm1$. The model in this paper consists in an infinite number of such random walks starting from the complement of…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…
Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…
We study graph-theoretic properties of the trace of a random walk on a random graph. We show that for any $\varepsilon>0$ there exists $C>1$ such that the trace of the simple random walk of length $(1+\varepsilon)n\ln{n}$ on the random…
Refining previous results, we establish a sharp asymptotic estimate on the expected graph distance between the origin and the terminal point of the trace of the first $n$ steps of the walk. A similar conclusion is drawn for the resistance…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
Consider a symmetric aperiodic random walk in $Z^d$, $d\geq 3$. There are points (called heavy points) where the number of visits by the random walk is close to its maximum. We investigate the local times around these heavy points and show…