Deterministic Small-World Networks

Abstract

Many real life networks, such as the World Wide Web, transportation systems, biological or social networks, achieve both a strong local clustering (nodes have many mutual neighbors) and a small diameter (maximum distance between any two nodes). These networks have been characterized as small-world networks and modeled by the addition of randomness to regular structures. We show that small-world networks can be constructed in a deterministic way. This exact approach permits a direct calculation of relevant network parameters allowing their immediate contrast with real-world networks and avoiding complex computer simulations.

6 pages, 1 figure

References in corpus (1)

• Deterministic Scale-Free Networks

Cited by in corpus (21)

• Inverted Berezinskii-Kosterlitz-Thouless Singularity and High-Temperature Algebraic Order in an Ising Model on a Scale-Free Hierarchical-Lattice Small-World Network
• A deterministic small-world network created by edge iterations
• Recursive graphs with small-world scale-free properties
• High dimensional random Apollonian networks
• Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
• High Dimensional Apollonian Networks
• A general geometric growth model for pseudofractal scale-free web
• Weighted Network of Chinese Nature Science Basic Research
• Evolving small-world networks with geographical attachment preference
• Griffiths singularities and algebraic order in the exact solution of an Ising model on a fractal modular network
• Growing Scale-free Small-world Networks with Tunable Assortative Coefficient
• A directed network model for World-Wide Web
• Complex Network Properties of Chinese Natural Science Basic Research
• Multistage Random Growing Small-World Networks with Power-law degree Distribution
• Recursive weighted treelike networks
• Synchronous and Asynchronous Recursive Random Scale-Free Nets
• Stochastic and mixed flower graphs
• A star based model for the eigenvalue power law of Internet graphs
• Vertex labeling and routing in expanded Apollonian networks
• Deterministic scale-free networks created in a recursive manner
• A Model for Prejudiced Learning in Noisy Environments