Statistical mechanical approach of complex networks with weighted links

Abstract

Systems which consist of many localized constituents interacting with each other can be represented by complex networks. Consistently, network science has become highly popular in vast fields focusing on natural, artificial and social systems. We numerically analyze the growth of $d$-dimensional geographic networks (characterized by the index ${\alpha }_G\ge 0$; $d=1,2,3,4$) whose links are weighted through a predefined random probability distribution, namely $P(w)\propto e^{-|w-w_c|/\tau }$, $w$ being the weight $(w_c\ge 0;\tau >0)$. In this model, each site has an evolving degree $k_i$ and a local energy ${\epsilon }_i\equiv {\sum }_{j=1}^{k_i}{w}_{ij}/2$ ($i=1,2,...,N$) that depend on the weights of the links connected to it. Each newly arriving site links to one of the pre-existing ones through preferential attachment given by the probability ${\Pi }_{ij}\propto {\epsilon }_i/d_{ij}^{{\alpha }_A}({\alpha }_A\ge 0)$, where $d_{ij}$ is the Euclidean distance between the sites. Short- and long-range interactions respectively correspond to ${\alpha }_A/d>1$ and $0\le {\alpha }_A/d\le 1$; ${\alpha }_A/d\to \infty$ corresponds to interactions between close neighbors, and ${\alpha }_A/d\to 0$ corresponds to infinitely-ranged interactions. The site energy distribution $p(\epsilon )$ corresponds to the usual degree distribution $p(k)$ as the particular instance $(w_c,\tau )=(2,0)$. We numerically verify that the corresponding connectivity distribution $p(\epsilon )$ converges, when ${\alpha }_A/d\to \infty$, to the weight distribution $P(w)$ for infinitely narrow distributions (i.e., $\tau \to \infty ,\forall w_c$) as well as for $w_c\to 0,\forall \tau$.

arXiv comment8 pages and 7 figures

References in corpus (20)

• Array Programming with NumPy
• The structure and function of complex networks
• The structure of scientific collaboration networks
• Analysis of weighted networks
• Is the Boston subway a small-world network ?
• The spatial structure of networks
• Weighted Evolving Networks
• Characterization and Modeling of weighted networks
• Analysis of a large-scale weighted network of one-to-one human communication
• Networks and the Epidemiology of Infectious Disease
• Spreading gossip in social networks
• Preferential attachment growth model and nonextensive statistical mechanics
• The hidden geometry of weighted complex networks
• q-Exponential Distribution in Urban Agglomeration
• Statistical properties of the quantum internet
• Role of dimensionality in complex networks: Connection with nonextensive statistics
• A generalised model for asymptotically-scale-free geographical networks
• Role of dimensionality in preferential attachment growth in the Bianconi-Barabási model
• Connecting complex networks to nonadditive entropies
• Scaling properties of d-dimensional complex networks

Cited by in corpus (1)

• Generalized Algebra Grounded on Nonadditive Entropies