Related papers: Halting viruses in scale-free networks
Multigraphs are graphs in which multiple links between pairs of nodes are allowed, whereas they are forbidden in simple graphs, the latter being widely used in network science. Simple graphs generated by the configuration model have served…
In the present work the spread of epidemic is studied over complex networks which are characterized by power law degree distribution of links and heterogeneous rate of disease transmission. The random allocation of epidemic transmission…
In this paper we consider a simple virus infection spread model on a finite population of $n$ agents connected by some neighborhood structure. Given a graph $G$ on $n$ vertices, we begin with some fixed number of initial infected vertices.…
We consider epidemic extinction in finite networks with broad variation in local connectivity. Generalizing the theory of large fluctuations to random networks with a given degree distribution, we are able to predict the most probable, or…
Epidemics on complex networks is a widely investigated topic in the last few years, mainly due to the last pandemic events. Usually, real contact networks are dynamic, hence much effort has been invested in studying epidemics on evolving…
The spreading of virus infection is here simulated over artificial human networks. Here, the real-space urban life of people is modeled as a scale-free network with constraints. A scale-free network has been adopted for modeling on-line…
The epidemic threshold is probably the most studied quantity in the modelling of epidemics on networks. For a large class of networks and dynamics the epidemic threshold is well studied and understood. However, it is less so for clustered…
By analysing the diffusive dynamics of epidemics and of distress in complex networks, we study the effect of the assortativity on the robustness of the networks. We first determine by spectral analysis the thresholds above which…
Recent advances in quantum communication have enabled long-distance secure information transfer through quantum channels, giving rise to quantum networks with unique physical and statistical properties. However, as in classical networks,…
We consider an SIS-type epidemic process that evolves on a known graph. We assume that a fixed curing budget can be allocated at each instant to the nodes of the graph, towards the objective of minimizing the expected extinction time of the…
Random walk is one of the basic mechanisms found in many network applications. We study the epidemic spreading dynamics driven by biased random walks on complex networks. In our epidemic model, each time infected nodes constantly spread…
It is widely known that the spread of the HIV virus was slower than exponential in several populations, even at the very beginning of the epidemic. We show that this implies a significant reduction in the effective reproductive rate of the…
This letter investigates the multiple routes transmitted epidemic process on multiplex networks. We propose detailed theoretical analysis that allows us to accurately calculate the epidemic threshold and outbreak size. It is found that the…
Viruses constantly undergo mutations with genomic changes. The propagation of variants of viruses is an interesting problem. We perform numerical simulations of the microscopic epidemic model based on network theory for the spread of…
Although suppressing the spread of a disease is usually achieved by investing in public resources, in the real world only a small percentage of the population have access to government assistance when there is an outbreak, and most must…
We propose a class of random scale-free spatial networks with nested community structures and analyze Reed-Frost epidemics with community related independent transmissions. We show that the epidemic threshold may be trivial or not depending…
A scale-free network is grown in the Euclidean space with a global directional bias. On a vertical plane, nodes are introduced at unit rate at randomly selected points and a node is allowed to be connected only to the subset of nodes which…
Several recent studies have tackled the issue of optimal network immunization by providing efficient criteria to identify key nodes to be removed in order to break apart a network, thus preventing the occurrence of extensive epidemic…
The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease…
We consider the propagation of a contagion process (epidemic) on a network and study the problem of dynamically allocating a fixed curing budget to the nodes of the graph, at each time instant. For bounded degree graphs, we provide a lower…