Related papers: Uniformity of hitting times of the contact process
We consider a symmetric, finite-range contact process with two types of infection; both have the same (supercritical) infection rate and heal at rate 1, but sites infected by Infection 1 are immune to Infection 2. We take the initial…
We consider a two-type contact process on $\Z$ in which both types have equal finite range and supercritical infection rate. We show that a given type becomes extinct with probability 1 if and only if, in the initial configuration, it is…
The supercritical series expansion of the survival probability for the one-dimensional contact process in heterogeneous and disordered lattices is used for the evaluation of the loci of critical points and critical exponents $\beta$. The…
We consider a symmetric finite-range contact process on $\mathbb{Z}$ with two types of particles (or infections), which propagate according to the same supercritical rate and die (or heal) at rate $1$. Particles of type $1$ can enter any…
We show that the contact process on a random $d$-regular graph initiated by a single infected vertex obeys the "cutoff phenomenon" in its supercritical phase. In particular, we prove that when the infection rate is larger than the critical…
For one-dimensional symmetric L\'{e}vy processes, which hit every point with positive probability, we give sharp bounds for the tail function of the first hitting time of B which is either a single point or an interval. The estimates are…
We consider a symmetric finite-range contact process on $\mathbb{Z}$ with two types of particles (or infections), which propagate according to the same supercritical rate and die (or heal) at rate $1$. Particles of type 1 can occupy any…
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…
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 the problem of characterizing the expected hitting times for a robust generalization of continuous-time Markov chains. This generalization is based on the theory of imprecise probabilities, and the models with which we work…
We consider the extinction time of the contact process on increasing sequences of finite graphs obtained from a variety of random graph models. Under the assumption that the infection rate is above the critical value for the process on the…
We consider the following definition of connectivity in $k$-uniform hypergraphs: Two $j$-sets are $j$-connected if there is a walk of edges between them such that two consecutive edges intersect in at least $j$ vertices. We determine the…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
Given a large connected graph $G=(V,E)$, and two vertices $w,\neq v$, let $T_{w,v}$ be the first hitting time to $v$ starting from $w$ for the simple random walk on $G$. We prove a general theorem that guarantees, under some assumptions on…
Hitting times for discrete quantum walks on graphs give an average time before the walk reaches an ending condition. To be analogous to the hitting time for a classical walk, the quantum hitting time must involve repeated measurements as…
We study a one-dimensional contact process with two infection parameters, one giving the infection rates at the boundaries of a finite infected region and the other one the rates within that region. We prove that the critical value of each…
We present general results for the contact process by a method which applies to all transitive graphs of bounded degree, including graphs of exponential growth. The model's infection rates are varied through a control parameter, for which…
We present a short and self-contained proof of a classical result due to Bollob\'as (1990): in the random hypercube process, with high probability the hitting time of connectedness equals the hitting time of having minimum degree at least…
We provide asymptotic results and develop high frequency statistical procedures for time-changed L\'evy processes sampled at random instants. The sampling times are given by first hitting times of symmetric barriers whose distance with…
A multiplicative identity in law connecting the hitting times of completely asymmetric $\alpha-$stable L\'evy processes in duality is established. In the spectrally positive case, this identity allows with an elementary argument to compute…