Epidemic thresholds on scale-free graphs: the interplay between exponent and preferential choice

Abstract

We show for a model of scale-free graphs with biased partner choice that knowing the exponent for the degree distribution is in general not sufficient to decide epidemic threshold properties for exponents less than three.We show that the connectivity between the high degree vertices and therefore the diameter is the relevant geometric quantity for epidemic threshold estimations.Absence of epidemic threshold happens precisely when a positive fraction of the nodes form a cluster of bounded diameter.

10 pages

Cited by in corpus (11)

• The structure and function of complex networks
• Absence of epidemic threshold in scale-free networks with connectivity correlations
• Epidemic spreading in complex networks with degree correlations
• Resilience to Contagion in Financial Networks
• Transmitting a signal by amplitude modulation in a chaotic network
• The "Cameo Principle" and the Origin of Scale-Free Graphs in Social Networks
• The Bass diffusion model on finite Barabasi-Albert networks
• The Epidemics of Corruption
• Modelling Complex Networks: Cameo Graphs And Transport Processes
• Complex Networks in and beyond Physics
• Generating Functions of Random Walks on Graphs