2001/11/10 by Francesc Comellas, Michael Sampels
Business, Management and Accounting · Computer Science · Physics and Astronomy · #Advanced Queuing Theory Analysis #Complex Network Analysis Techniques #Opportunistic and Delay-Tolerant Networks #cond-mat
paper · pdf · doi:10.1016/s0378-4371(02)00741-0
6 pages, 1 figure
arxiv created 2001/11/10 · openalex publication_date 2002/06/01 · arxiv updated 2009/11/30 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
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.