Optimal scales in weighted networks

D. Garlaschelli, S. Ahnert, T. Fink, G. Caldarelli

Social Informatics 8238, 1 (2013)

#networks#informationtheory#graphtheory

Download the PDF

LQ placeholder.

The analysis of networks characterized by links with heterogeneous intensity or weight suffers from two long-standing problems of arbitrariness. On one hand, the definitions of topological properties introduced for binary graphs can be generalized in non-unique ways to weighted networks. On the other hand, even when a definition is given, there is no natural choice of the (optimal) scale of link intensities (e.g. the money unit in economic networks). Here we show that these two seemingly independent problems can be regarded as intimately related, and propose a common solution to both. Using a formalism that we recently proposed in order to map a weighted network to an ensemble of binary graphs, we introduce an information-theoretic approach leading to the least biased generalization of binary properties to weighted networks, and at the same time fixing the optimal scale of link intensities. We illustrate our method on various social and economic networks.

LQ placeholder

Degree-correlations in a bursting dynamic network model

F. Vanni, P. Barucca

Journal of Economic Interaction and Coordination

LQ placeholder

Scale of non-locality for a system of n particles

S. Talaganis, I. Teimouri

Sub. to Physical Review D

LQ placeholder

Changes to Gate Closure and its impact on wholesale electricity prices: The case of the UK

A. Facchini, A. Rubino, G. Caldarelli, G. Liddo

Energy Policy

LQ placeholder

How much can we influence the rate of innovation?

T. Fink, M. Reeves

Science Advances

LQ placeholder

The statistical physics of real-world networks

G. Cimini, T. Squartini, F. Saracco, D. Garlaschelli, A. Gabrielli, G. Caldarelli

Nature Reviews Physics

LQ placeholder

PopRank: Ranking pages’ impact and users’ engagement on Facebook

A. Zaccaria, M. Vicario, W. Quattrociocchi, A. Scala, L. Pietronero

PLoS ONE

128 / 128 papers