Weighted networks as randomly reinforced urn processes

A statistical procedure identifies dominant edges within weighted networks to determine whether a network has reached its steady state.

Physical Review E 87, 20106 (2013)

G. Caldarelli, A. Chessa, I. Crimaldi, F. Pammolli

Weighted networks as randomly reinforced urn processes

We analyze weighted networks as randomly reinforced urn processes, in which the edge-total weights are determined by a reinforcement mechanism. We develop a statistical test and a procedure based on it to study the evolution of networks over time, detecting the “dominance” of some edges with respect to the others and then assessing if a given instance of the network is taken at its steady state or not. Distance from the steady state can be considered as a measure of the relevance of the observed properties of the network. Our results are quite general, in the sense that they are not based on a particular probability distribution or functional form of the random weights. Moreover, the proposed tool can be applied also to dense networks, which have received little attention by the network community so far, since they are often problematic. We apply our procedure in the context of the International Trade Network, determining a core of “dominant edges.”

More in Structure of how things relate

  • Nature Reviews Physics

    Physics of networks

    Statistical physics harnesses links between maximum entropy and information theory to capture null model and real-world network features.

  • Journal of Statistical Physics

    From ecology to finance

    Bipartite networks model the structures of ecological and economic real-world systems, enabling hypothesis testing and crisis forecasting.

  • EPL

    Clustering inverted

    Edge multiplicity—the number of triangles attached to edges—is a powerful analytic tool to understand and generalize network properties.

  • Social Informatics

    Scales in weighted networks

    Information theory fixes weighted networks’ degeneracy issues with a generalisation of binary graphs and an optimal scale of link intensities.