Entropy-based models to randomize real-world hypergraphs

Abstract

Network theory has often disregarded many-body relationships, solely focusing on pairwise interactions: neglecting them, however, can lead to misleading representations of complex systems. Hypergraphs represent a suitable framework for describing polyadic interactions. Here, we leverage the representation of hypergraphs based on the incidence matrix for extending the entropy-based approach to higher-order structures: in analogy with the Exponential Random Graphs, we introduce the Exponential Random Hypergraphs (ERHs). After exploring the asymptotic behaviour of thresholds generalising the percolation one, we apply ERHs to study real-world data. First, we generalise key network metrics to hypergraphs; then, we compute their expected value and compare it with the empirical one, in order to detect deviations from random behaviours. Our method is analytically tractable, scalable and capable of revealing structural patterns of real-world hypergraphs that differ significantly from those emerging as a consequence of simpler constraints.

47 pages, 14 figures, 3 tables

References in corpus (28)

• Networks beyond pairwise interactions: structure and dynamics
• The physics of higher-order interactions in complex systems
• The statistical mechanics of networks
• The Statistical Physics of Real-World Networks
• What are higher-order networks?
• Random hypergraphs and their applications
• The Babe Ruth Algorithm: a fast, unbiased procedure to randomize presence-absence data matrices with fixed row and column totals
• Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes
• Analytical maximum-likelihood method to detect patterns in real networks
• Maximum likelihood: extracting unbiased information from complex networks
• Early-warning signals of topological collapse in interbank networks
• Randomizing bipartite networks: the case of the World Trade Web
• 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
• Multistability, intermittency and hybrid transitions in social contagion models on hypergraphs
• Group interactions modulate critical mass dynamics in social convention
• Constrained Markovian dynamics of random graphs
• Extracting significant signal of news consumption from social networks: the case of Twitter in Italian political elections
• Comparing Alternatives to the Fixed Degree Sequence Model for Extracting the Backbone of Bipartite Projections
• The simpliciality of higher-order networks
• A class of models for random hypergraphs
• A faster horse on a safer trail: generalized inference for the efficient reconstruction of weighted networks
• Randomizing hypergraphs preserving degree correlation and local clustering
• Entropy-based detection of Twitter echo chambers
• Embedding the Erdős-Rényi Hypergraph into the Random Regular Hypergraph and Hamiltonicity
• Atomic subgraphs and the statistical mechanics of networks
• Statistical physics of exchangeable sparse simple networks, multiplex networks and simplicial complexes