Growing Random Geometric Graph Models of Super-linear Scaling Law
Jiang Zhang

TL;DR
This paper introduces growing random geometric graph models to explain super-linear scaling laws in complex systems, capturing phenomena like city growth and network properties through a geometric space framework.
Contribution
It proposes a novel geometric network model that reproduces super-linear growth and related complex network phenomena, linking the growth exponent to the space dimension.
Findings
Model reproduces super-linear growth law
Captures scale-free and clustering properties
Links growth exponent to geometric dimension
Abstract
Recent researches on complex systems highlighted the so-called super-linear growth phenomenon. As the system size measured as population in cities or active users in online communities increases, the total activities measured as GDP or number of new patents, crimes in cities generated by these people also increases but in a faster rate. This accelerating growth phenomenon can be well described by a super-linear power law (). However, the explanation on this phenomenon is still lack. In this paper, we propose a modeling framework called growing random geometric models to explain the super-linear relationship. A growing network is constructed on an abstract geometric space. The new coming node can only survive if it just locates on an appropriate place in the space where other nodes exist, then new edges are connected with the adjacent nodes whose…
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 · Diffusion and Search Dynamics · Stochastic processes and statistical mechanics
