Distances in scale free networks at criticality
Steffen Dereich, Christian M\"onch, Peter M\"orters

TL;DR
This paper investigates the phase transition in distances within scale-free networks at criticality, revealing how different models exhibit distinct asymptotic behaviors and identifying the critical window where these differences emerge.
Contribution
It characterizes the critical window for distances in scale-free networks and compares asymptotic behaviors between preferential attachment and rank-one models.
Findings
Preferential attachment networks have typical distances of (1/(1+α)) * (log N / log log N).
Rank-one models with same degree sequence have distances of (1/(1+2α)) * (log N / log log N).
A factor of two difference in shortest path lengths emerges as α approaches infinity.
Abstract
Scale-free networks with moderate edge dependence experience a phase transition between ultrasmall and small world behaviour when the power law exponent passes the critical value of three. Moreover, there are laws of large numbers for the graph distance of two randomly chosen vertices in the giant component. When the degree distribution follows a pure power law these show the same asymptotic distances of at the critical value three, but in the ultrasmall regime reveal a difference of a factor two between the most-studied rank-one and preferential attachment model classes. In this paper we identify the critical window where this factor emerges. We look at models from both classes when the asymptotic proportion of vertices with degree at least~ scales like and show that for preferential attachment networks the typical…
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.
