Related papers: Hitting probabilities and uniformly $S$-transient …
Let $G$ be a Cayley graph of a nonamenable group with spectral radius $\rho < 1$. It is known that branching random walk on $G$ with offspring distribution $\mu$ is transient, i.e., visits the origin at most finitely often almost surely, if…
We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…
It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…
We consider a random walk on a second countable locally compact topological space endowed with an invariant Radon measure. We show that if the walk is symmetric and if every subset which is invariant by the walk has zero or infinite…
We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…
We prove an estimate for the probability that a simple random walk in a simply connected subset A of Z^2 starting on the boundary exits A at another specified boundary point. The estimates are uniform over all domains of a given inradius.…
This paper presents necessary and sufficient conditions for on- and off-diagonal transition probability estimates for random walks on weighted graphs. On the integer lattice and on may fractal type graphs both the volume of a ball and the…
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$,…
For a homogeneous random walk in the quarter plane with nearest-neighbor transitions, starting from some state $(i_0,j_0)$, we study the event that the walk reaches the vertical axis, before reaching the horizontal axis. We derive an exact…
We give sharp, uniform estimates for the probability that a random walk of n steps on the reals avoids a half-line [y,infinity) given that it ends at the point x. The estimates hold for general continuous or lattice distributions provided…
We study the problem of detecting a random walk on a graph from a sequence of noisy measurements at every node. There are two hypotheses: either every observation is just meaningless zero-mean Gaussian noise, or at each time step exactly…
We analyze the dynamics of random walks with long-term memory (binary chains with long-range correlations) in the presence of an absorbing boundary. An analytically solvable model is presented, in which a dynamical phase-transition occurs…
It is shown that the path of a simple random walk on any graph, consisting of all vertices visited and edges crossed by the walk, is almost surely a recurrent subgraph.
For any graph having a suitable uniform Poincare inequality and volume growth regularity, we establish two-sided Gaussian transition density estimates and parabolic Harnack inequality, for constant speed continuous time random walks…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We study the algebraic decay of the survival probability in open hierarchical graphs. We present a model of a persistent random walk on a hierarchical graph and study the spectral properties of the Frobenius-Perron operator. Using a…
We consider a random walk on a $d$-regular graph $G$ where $d\to\infty$ and $G$ satisfies certain conditions. Our prime example is the $d$-dimensional hypercube, which has $n=2^d$ vertices. We explore the likely component structure of the…
Particle hopping is a common feature in heterogeneous media. We explore such motion by using the widely applicable formalism of the continuous time random walk and focus on the statistics of rare events. Numerous experiments have shown that…
We study a simple random walk on an n-dimensional hypercube. For any starting position we find the probability of hitting vertex a before hitting vertex b, whenever a and b share the same edge. This generalizes the model in Doyle, P., and…
The usual random walk on a group (homogeneous both in time and in space) is determined by a probability measure on the group. In a random walk with random transition probabilities this single measure is replaced with a stationary sequence…