arXiv · cond-mat/0111194
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Francesc Comellas, Michael Sampels. 2001-11-10. Deterministic Small-World Networks. https://doi.org/10.1016/s0378-4371(02)00741-0
Cite the original work for its findings. Save a collection to share your selection of sources.