相关论文: Central limit theorems for SIR epidemics and perco…
We address the issue of the Central Limit Theorem for (both local and global) empirical measures of diffusions interacting on a possibly diluted Erd\H{o}s-R\'enyi graph. Special attention is given to the influence of initial condition (not…
We consider sub-critical configuration models and show that the central limit theorem for any additive statistic holds when the statistics satisfies a fourth moment assumption, a variance lower bound and the degree sequence of graph…
We study the SIR epidemic model with infections carried by $k$ particles making independent random walks on a random regular graph. Here we assume $k\leq n^{\epsilon}$, where $n$ is the number of vertices in the random graph, and $\epsilon$…
A bootstrap percolation process on a graph $G$ is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round each uninfected node which has at least $r$ infected neighbours…
We use the susceptible-infected-recovered (SIR) model for disease spread over a network, and empirically study how well various centrality measures perform at identifying which nodes in a network will be the best spreaders of disease on 10…
We consider a stochastic directed graph on the integers whereby a directed edge between $i$ and a larger integer $j$ exists with probability $p_{j-i}$ depending solely on the distance between the two integers. Under broad conditions, we…
In this paper, we derive nonasymptotic theoretical bounds for the influence in random graphs that depend on the spectral radius of a particular matrix, called the Hazard matrix. We also show that these results are generic and valid for a…
This paper presents a law of large numbers result, as the size of the population tends to infinity, of SIR stochastic epidemic models, for a population distributed over $L$ distinct patches (with migrations between them) and $K$ distinct…
We investigate the expected time to extinction in the susceptible-infectious-susceptible (SIS) model of disease spreading. Rather than using stochastic simulations, or asymptotic calculations in network models, we solve the extinction time…
We introduce a new percolation model to describe and analyze the spread of an epidemic on a general directed and locally finite graph. We assign a two-dimensional random weight vector to each vertex of the graph in such a way that the…
By means of numerical simulations and epidemic analysis, the transition point of the stochastic, asynchronous Susceptible-Infected-Recovered (SIR) model on a square lattice is found to be c_0=0.1765005(10), where c is the probability a…
We consider a stochastic network model for epidemics, based on a random graph proposed by Ross [Journal of Applied Probability, 18, 309-315 (1981)]. Members of a population occupy nodes of the graph, with each member being in contact with…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. Assuming that the nodes of the wireless network are distributed as a…
To simplify mathematical models of disease spread, we often assume equal contact rates among hosts, but real-world scenarios differ. Network-based frameworks help capture these complexities and structural variations in actual systems. We…
We introduce an extension to Kermack and McKendrick's classic susceptible-infected-recovered (SIR) model in epidemiology, whose underlying mechanism of infection consists of individuals attending randomly generated social gatherings. This…
Infection spread among individuals is modelled with a continuous time Markov chain, in which subject interactions depend on their distance in space. The well known SIR model and non local variants of the latter are then obtained as large…
The spread of an infectious disease depends on intrinsic properties of the disease as well as the connectivity and actions of the population. This study investigates the dynamics of an SIR type model which accounts for human tendency to…
We study a well mixed SIR epidemic model with heterogeneous susceptibility and infectivity, allowing for an arbitrary joint distribution of these traits. Using an exact final size formulation and a branching process approximation for early…
Consider the problem of determining the maximal induced subgraph in a random $d$-regular graph such that its components remain bounded as the size of the graph becomes arbitrarily large. We show, for asymptotically large $d$, that any such…
We study the diffusion of epidemics on networks that are partitioned into local communities. The gross structure of hierarchical networks of this kind can be described by a quotient graph. The rationale of this approach is that individuals…