Related papers: Contact Process under heavy-tailed renewals on fin…
In the hard-core model on a finite graph we are given a parameter lambda>0, and an independent set I arises with probability proportional to lambda^|I|. On infinite graphs a Gibbs distribution is defined as a suitable limit with the correct…
In the standard SIR model, infected vertices infect their neighbors at rate $\lambda$ independently across each edge. They also recover at rate $\gamma$. In this work we consider the SIR-$\omega$ model where the graph structure itself…
The theme of this paper is the analysis of bootstrap percolation processes on random graphs generated by preferential attachment. This is a class of infection processes where vertices have two states: they are either infected or…
We consider the problem of learning the network of mutual excitations (i.e., the dependency graph) in a non-stationary, multivariate Hawkes process. We consider a general setting where baseline rates at each node are time-varying and delay…
This paper is concerned with a stochastic model for the spread of an SEIR (susceptible -> exposed (=latent) -> infective -> removed) epidemic with a contact tracing scheme, in which removed individuals may name some of their infectious…
In this paper we consider heavy tailed Markov renewal processes and we prove that, suitably renormalised, they converge in law towards the $\ga$-stable regenerative set. We then apply these results to the strip wetting model which is a…
Time-limited states characterise many dynamical processes on networks: disease infected individuals recover after some time, people forget news spreading on social networks, or passengers may not wait forever for a connection. These…
We study the dynamics of secondary infections on networks, in which only the individuals currently carrying a certain primary infection are susceptible to the secondary infection. In the limit of large sparse networks, the model is mapped…
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…
We consider a general class of contact processes on $\mathbb{Z}^d$ with potentially long-range interactions. By adapting well established renormalization arguments to the long-range setting we extend by now classical results for…
This paper presents a novel extension of the edge-based compartmental model for epidemics with arbitrary distributions of transmission and recovery times. Using the message passing approach we also derive a new pairwise-like model for…
We consider a class of strongly edge-reinforced random walks, where the corresponding reinforcement weight function is nondecreasing. It is known, from Limic and Tarr\`{e}s [Ann. Probab. (2007), to appear], that the attracting edge emerges…
In this paper, we propose a modified susceptible-infected-recovered (SIR) model, in which each node is assigned with an identical capability of active contacts, $A$, at each time step. In contrast to the previous studies, we find that on…
We consider a general honest homogeneous continuous-time Markov process with restarts. The process is forced to restart from a given distribution at time moments generated by an independent Poisson process. The motivation to study such…
We address the question of understanding the effect of the underlying network topology on the spread of a virus and the dissemination of information when users are mobile performing independent random walks on a graph. To this end we…
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…
This paper gives an elementary proof for the following theorem: a renewal process can be represented by a doubly-stochastic Poisson process (DSPP) if and only if the Laplace-Stieltjes transform of the inter-arrival times is of the following…
We study a stochastic model of infection spreading on a network. At each time step a node is chosen at random, along with one of its neighbors. If the node is infected and the neighbor is susceptible, the neighbor becomes infected. How many…
A permutation of [n] induces a graph on [n] such that the edges of the graph correspond to inversion pairs of the permutation. This graph is connected if and only if the corresponding permutation is indecomposable. Let s(n,m) denote a…
We derive the exact asymptotics of $P(\sup_{u\leq t}X(u) > x)$ if $x$ and $t$ tend to infinity with $x/t$ constant, for a L\'{e}vy process $X$ that admits exponential moments. The proof is based on a renewal argument and a two-dimensional…