Failure in Complex Social Networks

@article{Centola2007FailureIC,
  title={Failure in Complex Social Networks},
  author={Damon Centola},
  journal={The Journal of Mathematical Sociology},
  year={2007},
  volume={33},
  pages={64 - 68}
}
  • Damon Centola
  • Published 14 February 2007
  • Economics
  • The Journal of Mathematical Sociology
A class of inhomogenously wired networks called “scale-free” networks have been shown to be more robust against failure than more homogenously connected exponential networks. The robustness of scale-free networks consists in their ability to remain connected even when failure occurs. The diffusion of information and disease across a network only requires a single contact between nodes, making network connectivity the crucial determinant of whether or not these “simple contagions” will spread… 
Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results
TLDR
Efficient and practical heuristics for inhibiting undesirable contagions in social networks where nodes may have thresholds larger than 1 are developed and their performance on well known social networks is studied.
Blocking Complex Contagions Using Community Structure
TLDR
In selecting critical nodes for simple and complex contagions, the hybrid method uses topology-only information and thereafter couples those results with information about contagion dynamics, which evaluates the method using three different kinds of social networks from the literature.
Effects of Opposition on the Diffusion of Complex Contagions in Social Networks: An Empirical Study
TLDR
The empirical results point out how network structure and opposing perspectives can alter the widespread adoption of social behaviors that can be modeled as complex contagions.
Modeling Epidemics Spreading on Social Contact Networks
TLDR
The crowding or protection effect is considered and a novel model called improved SIR model is developed, which uses both deterministic and stochastic models to characterize the dynamics of epidemics on social contact networks.
Complex Contagions: A Decade in Review
TLDR
Recent advancements in applied studies of complex contagions, particularly in the domains of health, innovation diffusion, social media, and politics are discussed, including both diversity of demographic profiles among local peers and the broader notion of structural diversity within a network.
Unraveling the effects of multiscale network entanglement on empirical systems
TLDR
Network entanglement is introduced to study network robustness through a multiscale lens, encoded by the time required for information diffusion through the system, showing that the nodes central for information dynamics are also responsible for keeping the network integrated.
How behaviors spread in dynamic social networks
TLDR
It is proved that, in the two-action pure coordination game, this system would stabilize to a clustering state in which all relationships in the network are rewarded with an optimal payoff, and a new connection evaluation theory, the Highest Weighted Reward (HWR) rule is proposed.
Modeling Complex Social Systems: A New Network Point of View in Labour Markets
TLDR
Concepts including structural functions, coverage and invariant sets to a social system’s modelling are applied to better understand the way the labour market works.
Modeling of epidemic spread by social interactions
  • Punam R. Thakare, S. Mathurkar
  • Economics
    2016 IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)
  • 2016
Epidemic diseases spread is one of the major problems related to our health and it increases with increase in our social involvement. To examine the behavior of such epidemic contact network in a
T Network models of minority opinion spreading
Despite there are different models in literature that analyze the dynamic of opinion formation, less attention has been paid to explain how the structure of social networks and their contextual
...
...

References

SHOWING 1-10 OF 28 REFERENCES
Highly clustered scale-free networks.
  • K. Klemm, V. Eguíluz
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
TLDR
The model shows stylized features of real-world networks: power-law distribution of degree, linear preferential attachment of new links, and a negative correlation between the age of a node and its link attachment rate.
Complex Contagions and the Weakness of Long Ties1
The strength of weak ties is that they tend to be long—they connect socially distant locations, allowing information to diffuse rapidly. The authors test whether this “strength of weak ties”
Why social networks are different from other types of networks.
  • M. Newman, Juyong Park
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2003
TLDR
It is demonstrated that group structure in networks can also account for degree correlations and that the predicted level of assortative mixing compares well with that observed in real-world networks.
Mean-field theory for scale-free random networks
Emergence of scaling in random networks
TLDR
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Attack vulnerability of complex networks.
TLDR
It is found that the removals by the recalculated degrees and betweenness centralities are often more harmful than the attack strategies based on the initial network, suggesting that the network structure changes as important vertices or edges are removed.
Collective dynamics of ‘small-world’ networks
TLDR
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Resilience of the internet to random breakdowns
TLDR
This work shows analytically and numerically that for alpha</=3 the transition never takes place, unless the network is finite, and finds that the physical structure of the Internet is impressively robust, with p(c)>0.99.
The Structure and Function of Complex Networks
TLDR
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
...
...