Statistical analysis of weighted networks

Abstract

The purpose of this paper is to assess the statistical characterization of weighted networks in terms of the generalization of the relevant parameters, namely average path length, degree distribution and clustering coefficient. Although the degree distribution and the average path length admit straightforward generalizations, for the clustering coefficient several different definitions have been proposed in the literature. We examined the different definitions and identified the similarities and differences between them. In order to elucidate the significance of different definitions of the weighted clustering coefficient, we studied their dependence on the weights of the connections. For this purpose, we introduce the relative perturbation norm of the weights as an index to assess the weight distribution. This study revealed new interesting statistical regularities in terms of the relative perturbation norm useful for the statistical characterization of weighted graphs.

20 pages, 6 figures

References in corpus (12)

• Emergence of scaling in random networks
• The structure and function of complex networks
• Efficient Behavior of Small-World Networks
• The architecture of complex weighted networks
• Evolution of networks
• Intensity and coherence of motifs in weighted complex networks
• Economic Small-World Behavior in Weighted Networks
• Characterization and Modeling of weighted networks
• Korean university life in a network perspective: Dynamics of a large affiliation network
• Correlations in weighted networks
• Search in weighted complex networks
• Properties of weighted complex networks