The percolation transition in correlated hypergraphs

2009/05/31 by Serena Bradde, Ginestra Bianconi
Physics and Astronomy · #Complex Network Analysis Techniques #Computation #Continuum percolation theory #Opinion Dynamics and Social Influence #Order (exchange) #Percolation (cognitive psychology) #Percolation critical exponents #Percolation threshold #Potts model #Theoretical and Computational Physics #cond-mat.dis-nn #cond-mat.stat-mech

paper · pdf · doi:10.1088/1742-5468/2009/07/p07028

published as J. Stat. Mech. (2009) P07028

openalex publication_date 2009/07/17 · arxiv created 2009/07/20 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05

Abstract

Correlations are known to play a crucial role in determining the structure of complex networks. Here we study how their presence affects the computation of the percolation threshold in random hypergraphs. In order to mimic the correlation in real networks, we build hypergraphs from generalized hidden variable ensembles and we study the percolation transition by mapping this problem to the fully connected Potts model with heterogeneous couplings.

Citations

• Breakdown of the Internet under Intentional Attack
• Percolation transition and distribution of connected components in generalized random network ensembles
• Bicomponents and the Robustness of Networks to Failure
• Evolution of scale-free random graphs: Potts model formulation
• Error and attack tolerance of complex networks
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks
• Entropy of network ensembles
• On Large Deviation Properties of Erd�s?R�nyi Random Graphs