On necessary conditions for scale-freedom in complex networks, with applications to computer communication systems

DOI10.1080/00207720903267841zbMath1214.05159MaRDI QIDQ3006232

Wenjun Xiao, Behrooz Parhami, Weidong Chen

Publication date: 10 June 2011

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207720903267841

zbMATH Keywords

complex networks; scale-free, power-law distribution of vertex degrees

Mathematics Subject Classification ID

05C82: Small world graphs, complex networks (graph-theoretic aspects)

68M10: Network design and communication in computer systems

68M11: Internet topics

Related Items

Global bounded consensus of multi-agent systems with non-identical nodes and communication time-delay topology, Optimal coding-decoding for systems controlled via a communication channel, Vertex-degree sequences in complex networks: new characteristics and applications

Cites Work

• Cayley graphs as models of deterministic small-world networks
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Pinning a Complex Dynamical Network to Its Equilibrium
• Controlling the spreading in small-world evolving networks: stability, oscillation, and topology
• Synchronization in scale-free dynamical networks: robustness and fragility
• Synchronization and desynchronization of complex dynamical networks: an engineering viewpoint
• Collective dynamics of ‘small-world’ networks