The role of adjacency matrix degeneration in maximum entropy weighted network models

Abstract

Complex network null models based on entropy maximization are becoming a powerful tool to characterize and analyze data from real systems. However, it is not easy to extract good and unbiased information from these models: A proper understanding of the nature of the underlying events represented in them is crucial. In this paper we emphasize this fact stressing how an accurate counting of configurations compatible with given constraints is fundamental to build good null models for the case of networks with integer valued adjacency matrices constructed from aggregation of one or multiple layers. We show how different assumptions about the elements from which the networks are built give rise to distinctively different statistics, even when considering the same observables to match those of real data. We illustrate our findings by applying the formalism to three datasets using an open-source software package accompanying the present work and demonstrate how such differences are clearly seen when measuring network observables.

Main doc and Supplementary Material To be published in PRE

References in corpus (10)

• Extracting the multiscale backbone of complex weighted networks
• Emergence of network features from multiplexity
• The entropy of randomized network ensembles
• Maximum likelihood: extracting unbiased information from complex networks
• Generalized Bose-Fermi statistics and structural correlations in weighted networks
• Correlations in weighted networks
• Entropies of complex networks with hierarchically constrained topologies
• Supersampling and network reconstruction of urban mobility
• Correlations between weights and overlap in ensembles of weighted multiplex networks
• The configuration multi-edge model: Assessing the effect of fixing node strengths on weighted network magnitudes

Cited by in corpus (10)

• Human Mobility: Models and Applications
• The Statistical Physics of Real-World Networks
• Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes
• The new challenges of multiplex networks: measures and models
• Field theory for recurrent mobility
• The hidden geometry of weighted complex networks
• The Grand Canonical ensemble of weighted networks
• Reconciling econometrics with continuous maximum-entropy network models
• Ensemble equivalence for distinguishable particles
• A null model for Dunbar's circles