Skip to content

Exact results and scaling properties of small-world networks

R. V. Kulkarni, E. Almaas, D. Stroud

cond-mat.stat-mecharXiv:cond-mat/9908216

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.

Create a lesson