Phases of Small Worlds: A Mean Field Formulation
Andrew D. Jackson, Subodh P. Patil

TL;DR
This paper introduces a mean field approach to analytically derive the small-world property in various random network models, revealing phase structures and conditions for small-world behavior.
Contribution
It provides a novel mean field formulation for small-world networks, extending to dimorphic networks and linking network properties to phase transitions.
Findings
Logarithmic scaling of shortest paths in Erdős-Rényi networks
Mean field approximation maps to a spin chain problem
Small world regimes can be induced in sub-networks
Abstract
A network is said to have the properties of a small world if a suitably defined average distance between any two nodes is proportional to the logarithm of the number of nodes, . In this paper, we present a novel derivation of the small-world property for Gilbert-Erd\"os-Renyi random networks. We employ a mean field approximation that permits the analytic derivation of the distribution of shortest paths that exhibits logarithmic scaling away from the phase transition, inferable via a suitably interpreted order parameter. We begin by framing the problem in generality with a formal generating functional for undirected weighted random graphs with arbitrary disorder, recovering the result that the free energy associated with an ensemble of Gilbert graphs corresponds to a system of non-interacting fermions identified with the edge states. We then present a mean field solution for this…
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
TopicsCosmology and Gravitation Theories · Geophysics and Gravity Measurements · Geomagnetism and Paleomagnetism Studies
