Exact results and scaling properties of small-world networks
Abstract
We study the distribution function for minimal paths in small-world networks. Using properties of this distribution function, we derive analytic results which greatly simplify the numerical calculation of the average minimal distance, , and its variance, σ2. We also discuss the scaling properties of the distribution function. Finally, we study the limit of large system sizes and obtain some analytic results.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.