A generalised model for asymptotically-scale-free geographical networks

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 ηi ∈ [0,1] for each node i 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 i ki ηi rij-αA where ki is the connectivity of the ith pre-existing site and αA characterizes the importance of the euclidean distance r for the network growth. For special values of the parameters, this model recovers respectively the Bianconi-Barab\'asi and the Barab\'asi-Albert ones. The present generalised model is asymptotically scale-free in all cases, and its degree distribution is very well fitted with q-exponential distributions, which optimise the nonadditive entropy Sq, given by p(k) eq-k/ 1/[1+(q-1)k/]1/(q-1), with (q,) depending uniquely only on the ratio αA/d and the fitness distribution. Hence this model constitutes a realization of asymptotically-scale-free geographical networks within nonextensive statistical mechanics, where k plays the role of energy and plays the role of temperature. General scaling laws are also found for q as a function of the parameters of the model.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…