Enhanced reconstruction of weighted networks from strengths and degrees

Abstract

Network topology plays a key role in many phenomena, from the spreading of diseases to that of financial crises. Whenever the whole structure of a network is unknown, one must resort to reconstruction methods that identify the least biased ensemble of networks consistent with the partial information available. A challenging case, frequently encountered due to privacy issues in the analysis of interbank flows and Big Data, is when there is only local (node-specific) aggregate information available. For binary networks, the relevant ensemble is one where the degree (number of links) of each node is constrained to its observed value. However, for weighted networks the problem is much more complicated. While the naive approach prescribes to constrain the strengths (total link weights) of all nodes, recent counter-intuitive results suggest that in weighted networks the degrees are often more informative than the strengths. This implies that the reconstruction of weighted networks would be significantly enhanced by the specification of both strengths and degrees, a computationally hard and bias-prone procedure. Here we solve this problem by introducing an analytical and unbiased maximum-entropy method that works in the shortest possible time and does not require the explicit generation of reconstructed samples. We consider several real-world examples and show that, while the strengths alone give poor results, the additional knowledge of the degrees yields accurately reconstructed networks. Information-theoretic criteria rigorously confirm that the degree sequence, as soon as it is non-trivial, is irreducible to the strength sequence. Our results have strong implications for the analysis of motifs and communities and whenever the reconstructed ensemble is required as a null model to detect higher-order patterns.

References in corpus (8)

• Clustering in Complex Directed Networks
• The entropy of network ensembles
• A fitness model for the Italian Interbank Money Market
• Maximum likelihood: extracting unbiased information from complex networks
• Generalized Bose-Fermi statistics and structural correlations in weighted networks
• Correlations in weighted networks
• On the rich-club effect in dense and weighted networks
• Bootstrapping topology and systemic risk of complex network using the fitness model

Cited by in corpus (54)

• The Statistical Physics of Real-World Networks
• The Physics of Financial Networks
• Pathways towards instability in financial networks
• Nestedness in complex networks: Observation, emergence, and implications
• Randomizing bipartite networks: the case of the World Trade Web
• Network models of financial systemic risk: A review
• Systemic risk analysis in reconstructed economic and financial networks
• Inferring monopartite projections of bipartite networks: an entropy-based approach
• The role of bot squads in the political propaganda on Twitter
• Reconstruction methods for networks: the case of economic and financial systems
• The hidden geometry of weighted complex networks
• Reconstructing the world trade multiplex: the role of intensive and extensive biases
• Finding multiple core-periphery pairs in networks
• Unbiased sampling of network ensembles
• Reconstructing commuters network using machine learning and urban indicators
• Core-periphery structure requires something else in the network
• Estimating topological properties of weighted networks from limited information
• Fast and scalable likelihood maximization for Exponential Random Graph Models with local constraints
• How does bond percolation happen in coloured networks?
• Enhanced capital-asset pricing model for the reconstruction of bipartite financial networks
• Extracting significant signal of news consumption from social networks: the case of Twitter in Italian political elections
• A GDP-driven model for the binary and weighted structure of the International Trade Network
• Reconstructing networks
• Configuration model for correlation matrices preserving the node strength
• The Grand Canonical ensemble of weighted networks
• A faster horse on a safer trail: generalized inference for the efficient reconstruction of weighted networks
• Grand canonical validation of the bipartite International Trade Network
• Ensemble nonequivalence in random graphs with modular structure
• Meta-validation of bipartite network projections
• Centrality anomalies in complex networks as a result of model over-simplification
• Network reconstruction via density sampling
• Social dynamics of financial networks
• Bow-Tie Structures of Twitter Discursive Communities
• Gene communities in co-expression networks across different tissues
• Reconstructing mesoscale network structures
• Interplay between $k$-core and community structure in complex networks
• Detecting mesoscale structures by surprise
• Weighted hypersoft configuration model
• Entropy-based randomisation of rating networks
• From Ecology to Finance (and Back?): Recent Advancements in the Analysis of Bipartite Networks
• Synchronization Invariance Under Network Structural Transformations
• Colombian export capabilities: building the firms-products network
• Entropy of labeled versus unlabeled networks
• Inferring comparative advantage via entropy maximization
• A maximum entropy network reconstruction of macroeconomic models
• The Fitness-Corrected Block Model, or how to create maximum-entropy data-driven spatial social networks
• Weighted network estimation by the use of topological graph metrics
• Reconciling econometrics with continuous maximum-entropy network models
• Critical density for network reconstruction
• Spanning trees of the World Trade Web: real-world data and the gravity model of trade
• Gravity models of networks: integrating maximum-entropy and econometric approaches
• Interbank network reconstruction enforcing density and reciprocity
• Italian Twitter semantic network during the Covid-19 epidemic
• Commodity-specific triads in the Dutch inter-industry production network