Statistical Mechanics of Multi-Edge Networks
arXiv:1309.2453 · doi:10.1103/PhysRevE.88.062806
Abstract
Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There is, however, a subtle difference between networks where weights are continuos variables and those where they account for discrete, distinguishable events, which we call multi-edge networks. In this work we face this problem introducing multi-edge networks as graphs where multiple (distinguishable) connections between nodes are considered. We develop a statistical mechanics framework where it is possible to get information about the most relevant observables given a large spectrum of linear and nonlinear constraints including those depending both on the number of multi-edges per link and their binary projection. The latter case is particularly interesting as we show that binary projections can be understood from multi-edge processes. The implications of these results are important as many real agent based problems mapped onto graphs require of this treatment for a proper characterization of its collective behavior.
arXiv comment17 pages (13 + Appendix), 3 figures, Submitted to PRX
References in corpus (29)
- Statistical mechanics of complex networks
- The architecture of complex weighted networks
- Temporal Networks
- Spatial Networks
- A universal model for mobility and migration patterns
- The complex network of global cargo ship movements
- The statistical mechanics of networks
- Structure of urban movements: polycentric activity and entangled hierarchical flows
- Class of correlated random networks with hidden variables
- Statistical Mechanics of Multiplex Ensembles: Entropy and Overlap
- Characterization and Modeling of weighted networks
- Uncovering space-independent communities in spatial networks
- Urban Gravity: a Model for Intercity Telecommunication Flows
- Spectral properties of the Laplacian of multiplex networks
- The scaling of human mobility by taxis is exponential
- The entropy of randomized network ensembles
- 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
- Generalized Bose-Fermi statistics and structural correlations in weighted networks
- The Shannon and the Von Neumann entropy of random networks with heterogeneous expected degree
- Correlations in weighted networks
- Statistical Laws in Urban Mobility from microscopic GPS data in the area of Florence
- Uncorrelated Random Networks
- Entropies of complex networks with hierarchically constrained topologies
- An ensemble approach to the analysis of weighted networks
- Tailored graph ensembles as proxies or null models for real networks I: tools for quantifying structure
- Clustering of random scale-free networks
- Weighted Configuration Model
Cited by in corpus (19)
- Human Mobility: Models and Applications
- The Statistical Physics of Real-World Networks
- Weighted Multiplex Networks
- Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes
- Field theory for recurrent mobility
- The hidden geometry of weighted complex networks
- Unwinding the hairball graph: pruning algorithms for weighted complex networks
- 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
- The Grand Canonical ensemble of weighted networks
- Classical Information Theory of Networks
- Weighted hypersoft configuration model
- The role of adjacency matrix degeneration in maximum entropy weighted network models
- The configuration multi-edge model: Assessing the effect of fixing node strengths on weighted network magnitudes
- Sparse power-law network model for reliable statistical predictions based on sampled data
- Statistical physics of exchangeable sparse simple networks, multiplex networks and simplicial complexes
- Ensemble equivalence for distinguishable particles
- A null model for Dunbar's circles