Related papers: Explicit LDP for a slowed RW driven by a symmetric…
We consider a random walker in a dynamic random environment given by a system of independent simple symmetric random walks. We obtain ballisticity results under two types of perturbations: low particle density, and strong local drift on…
This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…
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…
Letting~$N=\left\{N(t), t\geq0\right\}$ be a standard Poisson process, Stroock~ \cite{Stroock-1981} constructed a family of continuous processes by $$\Theta_{\epsilon}(t)=\int_0^t\theta_{\epsilon}(r)dr, \ \ \ \ \ 0 \le t \le 1,$$ where…
We prove a {\it{quenched}} large deviation principle (LDP) for a simple random walk on a supercritical percolation cluster on $\Z^d$, $d\geq 2$.. We take the point of view of the moving particle and first prove a quenched LDP for the…
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…
Let $X$ be a L\'evy process with regularly varying L\'evy measure $\nu$. We obtain sample-path large deviations for scaled processes $\bar X_n(t) \triangleq X(nt)/n$ and obtain a similar result for random walks. Our results yield detailed…
The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…
We consider a discrete random walk (RW) in n dimensions . The RW is adapted with a geometric absorption process: at any discrete time there is a constant probability that absorption occurs in the current state. To model the RW with…
In this work, we study the large deviation properties of random walk in a random environment on $\mathbb{Z}^d$ with $d\geq1$. We start with the quenched case, take the point of view of the particle, and prove the large deviation principle…
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…
We combine hydrodynamic and modulated energy techniques to study the large deviations of systems of particles with pairwise singular repulsive interactions and additive noise. Specifically, we examine periodic Riesz interactions indexed by…
A global picture of a random particle movement is given by the convex hull of the visited points. We obtained numerically the probability distributions of the volume and surface of the convex hulls of a selection of three types of…
We study an inhomogeneous sparse random graph on [N] = {1, . . . , N } as introduced in a seminal paper by Bollobas, Janson and Riordan (2007): vertices have a type (here in a compact metric space S), and edges between different vertices…
We introduce a Kac's type walk whose rate of binary collisions preserves the total momentum but not the kinetic energy. In the limit of large number of particles we describe the dynamics in terms of empirical measure and flow, proving the…
We prove a large deviation principle for the point process associated to $k$-element connected components in $\mathbb R^d$ with respect to the connectivity radii $r_n\to\infty$. The random points are generated from a homogeneous Poisson…
We investigate a model of continuous-time simple random walk paths in $\mathbb{Z}^d$ undergoing two competing interactions: an attractive one towards the large values of a random potential, and a self-repellent one in the spirit of the…
The $W$-random graphs provide a flexible framework for modeling large random networks. Using the Large Deviation Principle (LDP) for $W$-random graphs from [9], we prove the LDP for the corresponding class of random symmetric…
In this paper, we consider the $(L,1)$ state-dependent reflecting random walk (RW) on the half line, which is a RW allowing jumps to the left at a maxial size $L$. For this model, we provide an explicit criterion for (positive) recurrence…
A random walk with echoed steps (RWES) is a process $\{\tilde{S}_n\}_{n\geq1}=\{\tilde{X}_1+\cdots+\tilde{X}_n\}_{n\geq1}$ that inserts memory and echo into an ordinary random walk (ORW) with i.i.d. steps, $X_1+\cdots+X_n$. The RWES is…