The role of adjacency matrix degeneration in maximum entropy weighted network models
arXiv:1509.01383 · doi:10.1103/PhysRevE.92.052816
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.
arXiv commentMain doc and Supplementary Material To be published in PRE
References in corpus (30)
- Functional cartography of complex metabolic networks
- Mathematical Formulation of Multi-Layer Networks
- Extracting the multiscale backbone of complex weighted networks
- Quantifying the benefits of vehicle pooling with shareability networks
- The statistical mechanics of networks
- Emergence of network features from multiplexity
- Class of correlated random networks with hidden variables
- The entropy of randomized network ensembles
- Weighted Multiplex Networks
- Assessing the relevance of node features for network structure
- Analytical maximum-likelihood method to detect patterns in real networks
- Maximum likelihood: extracting unbiased information from complex networks
- Dynamical properties of model communication networks
- Generalized Bose-Fermi statistics and structural correlations in weighted networks
- Entropy of stochastic blockmodel ensembles
- Randomizing world trade. I. A binary network analysis
- Correlations in weighted networks
- Emergence of overlap in ensembles of spatial multiplexes and statistical mechanics of spatial interacting networks ensembles
- Entropies of complex networks with hierarchically constrained topologies
- Reconstructing the world trade multiplex: the role of intensive and extensive biases
- Deciphering the global organization of clustering in real complex networks
- Activity clocks: spreading dynamics on temporal networks of human contact
- Constrained Markovian dynamics of random graphs
- Tailored graph ensembles as proxies or null models for real networks I: tools for quantifying structure
- Entropy distribution and condensation in random networks with a given degree distribution
- Supersampling and network reconstruction of urban mobility
- Correlations between weights and overlap in ensembles of weighted multiplex networks
- Statistical Mechanics of Multi-Edge Networks
- Tailored graph ensembles as proxies or null models for real networks II: results on directed graphs
- 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