Deterministic small-world networks

DOI10.1016/S0378-4371(02)00741-0zbMath0995.60103arXivcond-mat/0111194OpenAlexW3102520239MaRDI QIDQ1598993

Michael Sampels, Francesc Comellas

Publication date: 4 June 2002

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0111194

zbMATH Keywords

randomnesslocal clusteringmaximum node distance

Mathematics Subject Classification ID

Special processes (60K99)

Related Items (13)

The adjacency matrix of a graph as a data table: a geometric perspective ⋮ A new small-world network created by cellular automata ⋮ Inverted Berezinskii-Kosterlitz-Thouless singularity and high-temperature algebraic order in an Ising model on a scale-free hierarchical-lattice small-world network ⋮ Correlation between weighted spectral distribution and average path length in evolving networks ⋮ An analytical model for multi-epidemic information dissemination ⋮ Recursive weighted treelike networks ⋮ Distance-balanced graphs: symmetry conditions ⋮ Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition ⋮ Cayley graphs as models of deterministic small-world networks ⋮ Matrix analysis of a Markov chain small-world model ⋮ Combinatorial properties of Farey graphs ⋮ Mathematical programming models for some smallest-world problems ⋮ A model for prejudiced learning in noisy environments

Cites Work

• Deterministic small-world communication networks
• The diameter of random regular graphs
• Emergence of Scaling in Random Networks
• Collective dynamics of ‘small-world’ networks
• Deterministic scale-free networks

This page was built for publication: Deterministic small-world networks