A generalised model for asymptotically-scale-free geographical networks
Nicola Cinardi, Andrea Rapisarda, Constantino Tsallis

TL;DR
This paper introduces a versatile d-dimensional model for geographical networks that incorporates node fitness and distance-dependent attachment, resulting in asymptotically scale-free structures described by q-exponential degree distributions, bridging network theory and nonextensive statistical mechanics.
Contribution
The model generalizes existing network models by including fitness and distance effects, and demonstrates that the degree distribution follows q-exponentials, linking network growth to nonextensive entropy.
Findings
Model recovers Bianconi-Barabási and Barabási-Albert models as special cases.
Degree distribution fits q-exponential distributions well.
Scaling laws relate q-parameter to model parameters.
Abstract
We consider a generalised d-dimensional model for asymptotically-scale-free geographical networks. Central to many networks of this kind, when considering their growth in time, is the attachment rule, i.e. the probability that a new node is attached to one (or more) preexistent nodes. In order to be more realistic, a fitness parameter for each node of the network is also taken into account to reflect the ability of the nodes to attract new ones. Our d-dimensional model takes into account the geographical distances between nodes, with different probability distribution for which sensibly modifies the growth dynamics. The preferential attachment rule is assumed to be where is the connectivity of the th pre-existing site and characterizes the importance of the euclidean distance r for the…
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.
