Searcharxiv⌕ Search

arXiv subjects

Nino Antulov-Fantulin

Publications and source records attributed to Nino Antulov-Fantulin.

39 records · Page 3Linked to original sources

Epidemic centrality - is there an underestimated epidemic impact of network peripheral nodes?

In the study of disease spreading on empirical complex networks in SIR model, initially infected nodes can be ranked according to some measure of their epidemic impact. The highest ranked nodes, also referred to as "superspreaders", are associated to dominant epidemic risks and therefore deserve special attention. In simulations on studied empirical complex networks, it is shown that the ranking depends on the dynamical regime of the disease spreading. A possible mechanism leading to this dependence is illustrated in an analytically tractable example. In systems where the allocation of resources to counter disease spreading to individual nodes is based on their ranking, the dynamical regime of disease spreading is frequently not known before the outbreak of the disease. Therefore, we introduce a quantity called epidemic centrality as an average over all relevant regimes of disease spreading as a basis of the ranking. A recently introduced concept of phase diagram of epidemic spreading is used as a framework in which several types of averaging are studied. The epidemic centrality is compared to structural properties of nodes such as node degree, k-cores and betweenness. There is a growing trend of epidemic centrality with degree and k-cores values, but the variation of epidemic centrality is much smaller than the variation of degree or k-cores value. It is found that the epidemic centrality of the structurally peripheral nodes is of the same order of magnitude as the epidemic centrality of the structurally central nodes. The implications of these findings for the distributions of resources to counter disease spreading are discussed.

physics.soc-ph↗

FastSIR Algorithm: A Fast Algorithm for simulation of epidemic spread in large networks by using SIR compartment model

The epidemic spreading on arbitrary complex networks is studied in SIR (Susceptible Infected Recovered) compartment model. We propose our implementation of a Naive SIR algorithm for epidemic simulation spreading on networks that uses data structures efficiently to reduce running time. The Naive SIR algorithm models full epidemic dynamics and can be easily upgraded to parallel version. We also propose novel algorithm for epidemic simulation spreading on networks called the FastSIR algorithm that has better average case running time than the Naive SIR algorithm. The FastSIR algorithm uses novel approach to reduce average case running time by constant factor by using probability distributions of the number of infected nodes. Moreover, the FastSIR algorithm does not follow epidemic dynamics in time, but still captures all infection transfers. Furthermore, we also propose an efficient recursive method for calculating probability distributions of the number of infected nodes. Average case running time of both algorithms has also been derived and experimental analysis was made on five different empirical complex networks.

cs.DS↗

Phase diagram of epidemic spreading - unimodal vs. bimodal probability distributions

The disease spreading on complex networks is studied in SIR model. Simulations on empirical complex networks reveal two specific regimes of disease spreading: local containment and epidemic outbreak. The variables measuring the extent of disease spreading are in general characterized by a bimodal probability distribution. Phase diagrams of disease spreading for empirical complex networks are introduced. A theoretical model of disease spreading on m-ary tree is investigated both analytically and in simulations. It is shown that the model reproduces qualitative features of phase diagrams of disease spreading observed in empirical complex networks. The role of tree-like structure of complex networks in disease spreading is discussed.

physics.soc-ph↗