On necessary conditions for scale-freedom in complex networks, with applications to computer communication systems
DOI10.1080/00207720903267841zbMATH Open1214.05159OpenAlexW2152433225MaRDI QIDQ3006232FDOQ3006232
Authors: Wenjun Xiao, Weidong Chen, Behrooz Parhami 
Publication date: 10 June 2011
Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207720903267841
Recommendations
- Vertex-degree sequences in complex networks: new characteristics and applications
- Degree sequences beyond power laws in complex networks
- Property analysis of scale-free networks with power-exponents less than two
- Emergence of Scaling in Random Networks
- Scale-free networks: basic theory and applied research
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Internet topics (68M11)
Cites Work
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- Collective dynamics of `small-world' networks
- Synchronization in scale-free dynamical networks: robustness and fragility
- Pinning a Complex Dynamical Network to Its Equilibrium
- Synchronization and desynchronization of complex dynamical networks: an engineering viewpoint
- Cayley graphs as models of deterministic small-world networks
- Controlling the spreading in small-world evolving networks: stability, oscillation, and topology
Cited In (11)
- Property analysis of scale-free networks with power-exponents less than two
- Power-law distribution of degree-degree distance: a better representation of the scale-free property of complex networks
- Condition numbers and scale free graphs
- Vertex-degree sequences in complex networks: new characteristics and applications
- Scaling of weighted spectral distribution in deterministic scale-free networks
- Degree sequences beyond power laws in complex networks
- Optimal coding-decoding for systems controlled via a communication channel
- Complex network phenomena in telecommunication systems
- A sufficient condition for classified networks to possess complex network features
- Global bounded consensus of multi-agent systems with non-identical nodes and communication time-delay topology
- Detecting different topologies immanent in scale-free networks with the same degree distribution
This page was built for publication: On necessary conditions for scale-freedom in complex networks, with applications to computer communication systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3006232)
