Related papers: Stochastic homogenization of random walks on point…
For a symmetric random walk in $Z^2$ with $2+\delta$ moments, we represent $|\mathcal{R}(n)|$, the cardinality of the range, in terms of an expansion involving the renormalized intersection local times of a Brownian motion. We show that for…
A particle moves randomly over the integer points of the real line. Jumps of the particle outside the membrane (a fixed "locally perturbating set") are i.i.d., have zero mean and finite variance, whereas jumps of the particle from the…
Our model is a constrained homogeneous random walk in a nonnegative orthant Z_+^d. The convergence to stationarity for such a random walk can often be checked by constructing a Lyapunov function. The same Lyapunov function can also be used…
We study a non-reversible random walk advected by the symmetric simple exclusion process, so that the walk has a local drift of opposite sign when sitting atop an occupied or an empty site. We prove that the back-tracking probability of the…
Characterizing the occupation statistics of a radiation flow through confined geometries is key to such technological issues as nuclear reactor design and medical diagnosis. This amounts to assessing the distribution of the travelled length…
We study the statistics of the number of records $R_n$ for a symmetric, $n$-step, discrete jump process on a $1D$ lattice. At a given step, the walker can jump by arbitrary lattice units drawn from a given symmetric probability…
We prove the quenched version of the central limit theorem for the displacement of a random walk in doubly stochastic random environment, under the $H_{-1}$-condition, with slightly stronger, $L^{2+\varepsilon}$ (rather than $L^2$)…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
In this paper we consider a stochastic process that may experience random reset events which bring suddenly the system to the starting value and analyze the relevant statistical magnitudes. We focus our attention on monotonous…
Consider a stochastic process that behaves as a $d$-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the…
The aim of this note is to give an alternative construction of interlacements - as introduced by Sznitman - which makes use of classical probabilistic potential theory. In particular, we outline that the intensity measure of an…
Among random sampling methods, Markov Chain Monte Carlo algorithms are foremost. Using a combination of analytical and numerical approaches, we study their convergence properties towards the steady state, within a random walk Metropolis…
We consider random walks and L\'evy processes in a homogeneous group $G$. For all $p > 0$, we completely characterise (almost) all $G$-valued L\'evy processes whose sample paths have finite $p$-variation, and give sufficient conditions…
We study a general non-homogeneous Skellam-type process with jumps of arbitrary fixed size. We express this process in terms of a linear combination of Poisson processes and study several properties, including the summation of independent…
In this paper, we establish an abstract framework for the approximation of the invariant probability measure for a Markov semigroup. Following Pag{\`e}s and Panloup [40] we use an Euler scheme with decreasing step (unadjusted Langevin…
Random walk has wide applications in many fields, such as machine learning, biology, physics, and chemistry. Random walk can be discrete or continuous in time and space. Asymmetric random walk could be described by drift-diffusion equation.…
We are concerned with homogenization of stochastic differential equations (SDE) with stationary coefficients driven by Poisson random measures and Brownian motions in the critical case, that is when the limiting equation admits both a…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
We consider a two-speed branching random walk, which consists of two macroscopic stages with different reproduction laws. We prove that the centered maximum converges in law to a Gumbel variable with a random shift and the extremal process…
A one-dimensional confined Nonlinear Random Walk is a tuple of $N$ diffeomorphisms of the unit interval driven by a probabilistic Markov chain. For generic such walks, we obtain a geometric characterization of their ergodic stationary…