# Synchronization in scale-free dynamical networks: robustness and fragility

@article{Wang2001SynchronizationIS, title={Synchronization in scale-free dynamical networks: robustness and fragility}, author={Xiao Fan Wang and Guanrong Chen}, journal={IEEE Transactions on Circuits and Systems I-regular Papers}, year={2001}, volume={49}, pages={54-62} }

Recently, it has been demonstrated that many large complex networks display a scale-free feature, that is, their connectivity distributions are in the power-law form. In this paper, we investigate the synchronization phenomenon in scale-free dynamical networks. We show that if the coupling strength of a scale-free dynamical network is greater than a positive threshold, then the network will synchronize no matter how large it is. We show that the synchronizability of a scale-free dynamical…

## 1,085 Citations

On synchronization of scale-free dynamical networks

- Computer ScienceICARCV 2004 8th Control, Automation, Robotics and Vision Conference, 2004.
- 2004

This work investigates the synchronizability of a class of continuous-time dynamical networks with two kinds of scale-free topologies with respect to random or specific removal of nodes.

Characterizing the synchronizability of small-world dynamical networks

- Computer ScienceIEEE Transactions on Circuits and Systems I: Regular Papers
- 2004

It is shown that the maximum synchronizability of a network is completely determined by its associated feedback system, which has a precise meaning in terms of synchronous communication.

Robustness and Fragility of a New Local-World Dynamical Network Model

- Mathematics2014 IEEE Eighth International Conference on Software Security and Reliability-Companion
- 2014

It has been found that the synchronizability of the dynamical network with the local-world synchronization-preferential mechanism is robust against not only the random removal of vertices but also the specific removal of those most connected vertices.

Synchronization in a Novel Local-World Dynamical Network Model

- Computer Science
- 2014

A local-world synchronization-optimal growth topology model is proposed that exhibits a stronger synchronizability than the local- world evolving network model and is investigated for robustness with respect to random failures and the fragility with specific removal of nodes.

Onset of synchronization in complex gradient networks.

- PhysicsChaos
- 2008

An analytic formula for the onset of synchronization by incorporating the Kuramoto model on gradient scale-free networks is obtained, which provides quantitative support for the enhancement of synchronization in such networks, further justifying their ubiquity in natural and in technological systems.

Hub-Induced Synchronization in Scale-Free Networks with Cluster Structure

- Computer Science
- 2014

The concept of hub-induced synchronization provides a better understanding of cluster synchronization in scale-free networks and indicates that cluster synchronization can be induced by the hubs of the scale- free networks.

## References

SHOWING 1-10 OF 41 REFERENCES

Synchronization in Small-World Dynamical Networks

- Computer ScienceInt. J. Bifurc. Chaos
- 2002

It is shown that, for any given coupling strength and a suciently large number of cells, the small-world dynamical network will synchronize, even if the original nearest-neighbor coupled network cannot achieve synchronization under the same condition.

Topology of evolving networks: local events and universality

- Computer SciencePhysical review letters
- 2000

A continuum theory is proposed that predicts the connectivity distribution of the network describing the professional links between movie actors as well as the scaling function and the exponents, in good agreement with numerical results.

Emergence of scaling in random networks

- Computer ScienceScience
- 1999

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.

Epidemic spreading in scale-free networks.

- Computer SciencePhysical review letters
- 2001

A dynamical model for the spreading of infections on scale-free networks is defined, finding the absence of an epidemic threshold and its associated critical behavior and this new epidemiological framework rationalizes data of computer viruses and could help in the understanding of other spreading phenomena on communication and social networks.

Epidemic dynamics and endemic states in complex networks.

- MathematicsPhysical review. E, Statistical, nonlinear, and soft matter physics
- 2001

A dynamical model for the spreading of epidemics in complex networks that implies that scale-free networks are prone to the spreading and the persistence of infections whatever spreading rate the epidemic agents might possess.

Collective dynamics of ‘small-world’ networks

- Computer ScienceNature
- 1998

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

- Computer SciencePhysical review letters
- 2000

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.

Fast response and temporal coherent oscillations in small-world networks.

- PhysicsPhysical review letters
- 2000

Small-world topologies, which fall between random and regular ones, take advantage of the best features of both, giving rise to fast system response with coherent oscillations.

Network robustness and fragility: percolation on random graphs.

- MathematicsPhysical review letters
- 2000

This paper studies percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolators, bond percolations, and models in which occupation probabilities depend on vertex degree.