The percolation transition in correlated hypergraphs

From MaRDI portal
Publication:3301081

DOI10.1088/1742-5468/2009/07/P07028zbMATH Open1459.82114arXiv0905.4455OpenAlexW3100681322WikidataQ60575095 ScholiaQ60575095MaRDI QIDQ3301081FDOQ3301081


Authors: Serena Bradde, Ginestra Bianconi Edit this on Wikidata


Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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 network, we build hypergraphs from a generalized hidden variable ensembles and we study the percolation transition by mapping this problem to the fully connected Potts model with heterogeneous couplings.


Full work available at URL: https://arxiv.org/abs/0905.4455




Recommendations




Cites Work


Cited In (11)





This page was built for publication: The percolation transition in correlated hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301081)