Dataset Information

Systematic Approximations to Susceptible-Infectious-Susceptible Dynamics on Networks.

ABSTRACT: Network-based infectious disease models have been highly effective in elucidating the role of contact structure in the spread of infection. As such, pair- and neighbourhood-based approximation models have played a key role in linking findings from network simulations to standard (random-mixing) results. Recently, for SIR-type infections (that produce one epidemic in a closed population) on locally tree-like networks, these approximations have been shown to be exact. However, network models are ideally suited for Sexually Transmitted Infections (STIs) due to the greater level of detail available for sexual contact networks, and these diseases often possess SIS-type dynamics. Here, we consider the accuracy of three systematic approximations that can be applied to arbitrary disease dynamics, including SIS behaviour. We focus in particular on low degree networks, in which the small number of neighbours causes build-up of local correlations between the state of adjacent nodes that are challenging to capture. By examining how and when these approximation models converge to simulation results, we generate insights into the role of network structure in the infection dynamics of SIS-type infections.

SUBMITTER: Keeling MJ

PROVIDER: S-EPMC5283726 | biostudies-literature | 2016 Dec

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Systematic Approximations to Susceptible-Infectious-Susceptible Dynamics on Networks.

Keeling Matt J MJ House Thomas T Cooper Alison J AJ Pellis Lorenzo L

PLoS computational biology 20161220 12

Network-based infectious disease models have been highly effective in elucidating the role of contact structure in the spread of infection. As such, pair- and neighbourhood-based approximation models have played a key role in linking findings from network simulations to standard (random-mixing) results. Recently, for SIR-type infections (that produce one epidemic in a closed population) on locally tree-like networks, these approximations have been shown to be exact. However, network models are i ...[more]

PMID: 27997542

Similar Datasets

Project description:With increasing real-time constraints being put on the use of Deep Neural Networks (DNNs) by real-time scenarios, there is the need to review information representation. A very challenging path is to employ an encoding that allows a fast processing and hardware-friendly representation of information. Among the proposed alternatives to the IEEE 754 standard regarding floating point representation of real numbers, the recently introduced Posit format has been theoretically proven to be really promising in satisfying the mentioned requirements. However, with the absence of proper hardware support for this novel type, this evaluation can be conducted only through a software emulation. While waiting for the widespread availability of the Posit Processing Units (the equivalent of the Floating Point Unit (FPU)), we can already exploit the Posit representation and the currently available Arithmetic-Logic Unit (ALU) to speed up DNNs by manipulating the low-level bit string representations of Posits. As a first step, in this paper, we present new arithmetic properties of the Posit number system with a focus on the configuration with 0 exponent bits. In particular, we propose a new class of Posit operators called L1 operators, which consists of fast and approximated versions of existing arithmetic operations or functions (e.g., hyperbolic tangent (TANH) and extended linear unit (ELU)) only using integer arithmetic. These operators introduce very interesting properties and results: (i) faster evaluation than the exact counterpart with a negligible accuracy degradation; (ii) an efficient ALU emulation of a number of Posits operations; and (iii) the possibility to vectorize operations in Posits, using existing ALU vectorized operations (such as the scalable vector extension of ARM CPUs or advanced vector extensions on Intel CPUs). As a second step, we test the proposed activation function on Posit-based DNNs, showing how 16-bit down to 10-bit Posits represent an exact replacement for 32-bit floats while 8-bit Posits could be an interesting alternative to 32-bit floats since their performances are a bit lower but their high speed and low storage properties are very appealing (leading to a lower bandwidth demand and more cache-friendly code). Finally, we point out how small Posits (i.e., up to 14 bits long) are very interesting while PPUs become widespread, since Posit operations can be tabulated in a very efficient way (see details in the text).

Project description:We consider cumulative merging percolation (CMP), a long-range percolation process describing the iterative merging of clusters in networks, depending on their mass and mutual distance. For a specific class of CMP processes, which represents a generalization of degree-ordered percolation, we derive a scaling solution on uncorrelated complex networks, unveiling the existence of diverse mechanisms leading to the formation of a percolating cluster. The scaling solution accurately reproduces universal properties of the transition. This finding is used to infer the critical properties of the susceptible-infected-susceptible model for epidemics in infinite and finite power-law distributed networks. Here, discrepancies between analytical approaches and numerical results regarding the finite-size scaling of the epidemic threshold are a crucial open issue in the literature. We find that the scaling exponent assumes a nontrivial value during a long preasymptotic regime. We calculate this value, finding good agreement with numerical evidence. We also show that the crossover to the true asymptotic regime occurs for sizes much beyond currently feasible simulations. Our findings allow us to rationalize and reconcile all previously published results (both analytical and numerical), thus ending a long-standing debate. Summary Complex networks represent the interaction pattern for many real-world phenomena such as epidemic spreading. The simplest and most fundamental model for the diffusion of infectious diseases without acquired immunity predicts a vanishing epidemic threshold in the limit of large systems. In other words, no matter how small the infectiousness of the disease, there is always a finite fraction of the overall population which is infected for long times. So far, the detailed mechanism underlying this phenomenology has remained unclear. Here, we provide a complete and quantitative understanding of the model’s behavior. While the role of hubs (individuals with high connectivity) was already believed to be important, we fully clarify its nature, pointing out the highly nontrivial interplay among hubs. Each hub acts as an infection hotbed and the global epidemic emerges from hubs reinfecting each other. Surprisingly, this mechanism is at work even when the hubs are not in direct mutual contact but transmit the infection through chains of low-connectivity individuals. The survival of the epidemic is then a manifestation of a novel, long-range, percolation process among distant hubs, whose properties explain the behavior of the epidemic model. These findings rationalize and reconcile previously published results and point out long-range indirect interactions as potentially crucial ingredients for other collective phenomena in networked systems.

Dataset Information

Systematic Approximations to Susceptible-Infectious-Susceptible Dynamics on Networks.

Publications

Systematic Approximations to Susceptible-Infectious-Susceptible Dynamics on Networks.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets