• Citer

Deterministic small-world networks

par Comellas, Francesc;Sampels, Michaël
Référence Physica. A, 309, 1-2, page (231-235)
Publication Publié, 2002-06

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

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. © 2001 Elsevier Science B.V. All rights reserved.