Multiple Scales in Small-World Graphs
Rajesh Kasturirangan

TL;DR
This paper proposes that the key to small-world phenomena is the presence of multiple connection length scales, not randomness, and introduces multiple scale graphs as a unifying framework for understanding evolving networks.
Contribution
It introduces the concept of multiple scale graphs and the multiple length scale hypothesis, challenging the focus on randomness in explaining small-world properties.
Findings
Small-world behavior is linked to diverse connection length scales.
Distribution of length scales is more crucial than connection range.
Novel graph architectures support the multiple length scale hypothesis.
Abstract
Small-world architectures may be implicated in a range of phenomena from disease propagation to networks of neurons in the cerebral cortex. While most of the recent attention on small-world networks has focussed on the effect of introducing disorder/randomness into a regular network, we show that that the fundamental mechanism behind the small-world phenomenon is not disorder/randomness, but the presence of connections of many different length scales. Consequently, in order to explain the small-world phenomenon, we introduce the concept of multiple scale graphs and then state the multiple length scale hypothesis. Multiple scale graphs form a unifying conceptual framework for the study of evolving graphs. Moreover, small-world behavior in randomly rewired graphs is a consequence of features common to all multiple scale graphs. To support the multiple length scale hypothesis, novel graph…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Bioinformatics and Genomic Networks · Gene Regulatory Network Analysis
