In this paper we establish a connection between epidemic models on random networks with general infection times considered in [2] and first passage percolation. Using techniques developed in [6], when each vertex has infinite contagious periods, we extend results on the epidemic curve in [2] from bounded degree graphs to general sparse random graphs with degrees having finite third moments as n ¿ 8. We also study the epidemic trail between the source and typical vertices in the graph. This connection to first passage percolation can be also be used to study epidemic models with general contagious periods as in [2] without bounded degree assumptions
In this paper, an SIS (susceptible-infected-susceptible)-type epidemic propagation is studied on a s...
The Newman–Watts model is given by taking a cycle graph of n vertices and then adding each possible ...
In an important paper, M.E.J. Newman claimed that a general network-based stochastic Susceptible-Inf...
In this paper we establish a connection between epidemic models on random networks with general infe...
Abstract. In this paper we establish a connection between epidemic models on random networks with ge...
We study competing first passage percolation on graphs generated by the configuration model. At time...
Many real-world networks display a community structure. We study two random graph models that create...
We introduce a new 1-dependent percolation model to describe and analyze the spread of an epidemic o...
We analyze the contact process on random graphs generated according to the preferential attachment s...
In [3], we considered first passage percolation on the configuration model equipped with general ind...
In this paper we consider a model for the spread of a stochastic SIR (Susceptible → Infectious → Rec...
This paper is concerned with the growth rate of SIR (Susceptible-Infectious-Recovered) epidemics wit...
Local interactions on a graph will lead to global dynamic behaviour. In this thesis we focus on two ...
A bootstrap percolation process on a graph $$G$$ G is an "infection” process which evolves in rounds...
In this paper, an SIS (susceptible-infected-susceptible)-type epidemic propagation is studied on a s...
The Newman–Watts model is given by taking a cycle graph of n vertices and then adding each possible ...
In an important paper, M.E.J. Newman claimed that a general network-based stochastic Susceptible-Inf...
In this paper we establish a connection between epidemic models on random networks with general infe...
Abstract. In this paper we establish a connection between epidemic models on random networks with ge...
We study competing first passage percolation on graphs generated by the configuration model. At time...
Many real-world networks display a community structure. We study two random graph models that create...
We introduce a new 1-dependent percolation model to describe and analyze the spread of an epidemic o...
We analyze the contact process on random graphs generated according to the preferential attachment s...
In [3], we considered first passage percolation on the configuration model equipped with general ind...
In this paper we consider a model for the spread of a stochastic SIR (Susceptible → Infectious → Rec...
This paper is concerned with the growth rate of SIR (Susceptible-Infectious-Recovered) epidemics wit...
Local interactions on a graph will lead to global dynamic behaviour. In this thesis we focus on two ...
A bootstrap percolation process on a graph $$G$$ G is an "infection” process which evolves in rounds...
In this paper, an SIS (susceptible-infected-susceptible)-type epidemic propagation is studied on a s...
The Newman–Watts model is given by taking a cycle graph of n vertices and then adding each possible ...
In an important paper, M.E.J. Newman claimed that a general network-based stochastic Susceptible-Inf...