Related papers: Exact solution for random walks on the triangular …
We study random walks on the integers driven by a sample of time-dependent nearest-neighbor conductances that are bounded but are permitted to vanish over time intervals of positive Lebesgue-length. Assuming only ergodicity of the…
We obtain expected number of arrivals, absorption probabilities and expected time before absorption for a discrete random walk on the integers with an infinite set of equidistant multiple function barriers
This paper is concerned with random walks on a family of dyadic-valued solvable matrix groups. A description of the Poisson boundary of these groups for probability measures of finite first moment and non-zero displacements (or drifts) 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…
Consider uniformly elliptic random walk on $\bbZ^d$ with independent jump rates across nearest neighbour bonds of the lattice. We show that the infinite volume effective diffusion matrix can be almost surely recovered as the limit of finite…
A return probability of random walks is one of the interesting subjects. As it is well known, the return probability strongly depends on the structure of the space where the random waker moves. On the other hand, the return probability of…
We consider a supercritical symmetric continuous-time branching random walk on a multidimensional lattice with a finite number of particle generation sources of varying positive intensities without any restrictions on the variance of jumps…
Looptrees have recently arisen in the study of critical percolation on the uniform infinite planar triangulation. Here we consider random infinite looptrees defined as the local limit of the looptree associated with a critical…
We consider random walks on $\Z^8$ indexed by the infinite invariant tree, which consists of an infinite spine and finite random trees attached to it on both sides. We establish the precise order of the non-intersection probability between…
We study the recurrence behaviour of random walks on partially oriented honeycomb lattices. The vertical edges are undirected while the orientation of the horizontal edges is random: depending on their distribution, we prove a.s. transience…
Quantum random walks have received much interest due to their non-intuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable…
We derive a functional central limit theorem for the excursion of a random walk conditioned on sweeping a prescribed geometric area. We assume that the increments of the random walk are integer-valued, centered, with a third moment equal to…
The process by which one may take a discrete model of a biophysical process and construct a continuous model based on it is of mathematical interest as well as being of practical use. In this paper, we first study the singular limit of a…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
We show that the scaling limit exists and is invariant to dilations and rotations. We give some tools that might be useful to show universality.
An intrinsic branching structure within the transient random walk on a strip in a random environment is revealed. As applications, which enables us to express the hitting time explicitly, and specifies the density of the absolutely…
We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on $Z^d \times Z_+$. In dimensions $d>6$, we obtain bounds on exit times, transition probabilities, and the range of the…
This paper is about the construction of displacement interpolations on a discrete metric graph. Our approach is based on the approximation of any optimal transport problem whose cost function is a distance on a discrete graph by a sequence…
In this article, we study a branching random walk in an environment which depends on the time. This time-inhomogeneous environment consists of a sequence of macroscopic time intervals, in each of which the law of reproduction remains…
In this paper, we consider the problem of identifying a single moving point source for a three-dimensional wave equation from boundary measurements. Precisely, we show that the knowledge of the field generated by the source at six different…