Related papers: The contact process as seen from a random walk

What is the long-time behavior of the law of a contact process started with a single infected site, distributed according to counting measure on the lattice? This question is related to the configuration as seen from a typical infected site…

We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…

In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…

We consider the contact process on a countable-infinite and connected graph of bounded degree. For this process started from the upper invariant measure, we prove certain uniform mixing properties under the assumption that the infection…

We use point processes theory to describe the asymptotic distribution of all upper order statistics for observations collected at renewal times. As a corollary, we obtain limiting theorems for corresponding extremal processes.

We consider a random walk in random environment in the low disorder regime on $\mathbb Z^d$. That is, the probability that the random walk jumps from a site $x$ to a nearest neighboring site $x+e$ is given by $p(e)+\epsilon \xi(x,e)$, where…

We consider a branching random walk on a $d$-ary tree of height $n$ ($n \in \mathbb{N}$), under the presence of a hard wall which restricts each value to be positive, where $d$ is a natural number satisfying $d\geqslant2$. The question of…

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…

We consider the contact process on finite and connected graphs and study the behavior of the extinction time, that is, the amount of time that it takes for the infection to disappear in the process started from full occupancy. We prove,…

We give an elementary probabilistic proof of Veraverbeke's Theorem for the asymptotic distribution of the maximum of a random walk with negative drift and heavy-tailed increments. The proof gives insight into the principle that the maximum…

Let a simple random walk run inside a torus of dimension three or higher for a number of steps which is a constant proportion of the volume. We examine geometric properties of the range, the random subgraph induced by the set of vertices…

We consider connectivity properties of the Branching Interlacements model in $\mathbb{Z}^d,~d\ge5$, recently introduced by Angel, R\'ath and Zhu in 2016. Using stochastic dimension techniques we show that every two vertices visited by the…

We consider shock measures in a class of conserving stochastic particle systems on Z. These shock measures have a product structure with a step-like density profile and include a second class particle at the shock position. We show for the…

We prove sharp asymptotic estimates for the rate of escape of the two-dimensional simple random walk conditioned to avoid a fixed finite set. We derive it from asymptotics available for the continuous analogue of this process (cf…

We prove a Central Limit Theorem for the proportion of infected individuals for an epidemic model by dealing with a discrete time system of simple random walks on a complete graph with n vertices. Each random walk makes a role of a virus.…

We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…

We give a construction of a tree in which the contact process with any positive infection rate survives but, if a certain privileged edge $e^*$ is removed, one obtains two subtrees in which the contact process with infection rate smaller…

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…

We consider a discrete time simple symmetric random walk on Z^d, d>=1, where the path of the walk is perturbed by inserting deterministic jumps. We show that for any time n and any deterministic jumps that we insert, the expected number of…

We establish an invariance principle for a one-dimensional random walk in a dynamical random environment given by a speed-change exclusion process. The jump probabilities of the walk depend on the configuration of the exclusion in a finite…