The percolation transition in correlated hypergraphs

From MaRDI portal
Publication:3301081



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.












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)