Related papers: Large deviations for the maximum of a branching ra…
We investigate the probabilities of large deviations for the position of the front in a stochastic model of the reaction $X+Y \to 2X$ on the integer lattice in which $Y$ particles do not move while $X$ particles move as independent simple…
We take the point of view of a particle performing random walk with bounded jumps on $\mathbb{Z}^d$ in a stationary and ergodic random environment. We prove the quenched large deviation principle (LDP) for the pair empirical measure of the…
A large deviation principle is derived for stochastic partial differential equations with slow-fast components. The result shows that the rate function is exactly that of the averaged equation plus the fluctuating deviation which is a…
Consider a one-dimensional shift-invariant attractive spin-flip system in equilibrium, constituting a dynamic random environment, together with a nearest-neighbor random walk that on occupied sites has a local drift to the right but on…
We establish large deviations properties valid for almost every sample path of a class of stationary mixing processes $(X_1,..., X_n,...)$. These properties are inherited from those of $S_n=\sum_{i=1}^nX_i$ and describe how the local…
We consider a general discrete-time branching random walk on a countable set X. We relate local, strong local and global survival with suitable inequalities involving the first-moment matrix M of the process. In particular we prove that,…
We establish a large deviation principle for the trajectories of Wiener processes subject to random resets to the origin occurring according to a Poisson process. In addition to the pathwise large deviation principle, we identify the rate…
A probabilistic method for solving the Monge-Kantorovich mass transport problem on $R^d$ is introduced. A system of empirical measures of independent particles is built in such a way that it obeys a doubly indexed large deviation principle…
This paper is a collection of recent results on discrete-time and continuous-time branching random walks. Some results are new and others are known. Many aspects of this theory are considered: local, global and strong local survival, the…
We consider a branching random walk in a random space-time environment of disasters where each particle is killed when meeting a disaster. This extends the model of the "random walk in a disastrous random environment" introduced by [15]. We…
Consider a critical nearest neighbor branching random walk on the $d$-dimensional integer lattice initiated by a single particle at the origin. Let $G_{n}$ be the event that the branching random walk survives to generation $n$. We obtain…
Record numbers are basic statistics in random walks, whose deviation principles are not very clear so far. In this paper, the asymptotic probabilities of large and moderate deviations for numbers of weak records in right continuous or left…
We study a continuous-time branching random walk on the lattice $\mathbb{Z}^{d}$, $d\in \mathbb{N}$, with a single source of branching, that is the lattice point where the birth and death of particles can occur. The random walk is assumed…
Branching-stable processes have recently appeared as counterparts of stable subordinators, when addition of real variables is replaced by branching mechanism for point processes. Here, we are interested in their domains of attraction and…
We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph $G_N$ with vertex set $[N] = \{1,\dots,N\}$ for which the pair of vertices $i,j \in [N]$, $i\neq j$, is connected by an edge with probability $r(\tfrac{i}{N},\tfrac{j}{N})$,…
We define a random walk of a particle in $\mathbb{R}^3$ where the space is rotating. The particle is not glued to the space and will collide with it at random times, resulting in changes in its velocity and direction. After many collisions,…
We present a comparative study of several algorithms for an in-plane random walk with a variable step. The goal is to check the efficiency of the algorithm in the case where the random walk terminates at some boundary. We recently found…
Given a branching random walk $(Z_n)_{n\geq0}$ on $\mathbb{R}$, let $Z_n(A)$ be the number of particles located in interval $A$ at generation $n$. It is well known (e.g., \cite{biggins}) that under some mild conditions, $Z_n(\sqrt…
We derive large- and moderate-deviation results in random networks given as planar directed navigations on homogeneous Poisson point processes. In this non-Markovian routing scheme, starting from the origin, at each consecutive step a…
We consider the simple random walk on random graphs generated by discrete point processes. This random graph has a random subset of a cubic lattice as the vertices and lines between any consecutive vertices on lines parallel to each…