Skip to content
Open access

Asymmetric dual-threshold bootstrap percolation on random hypergraphs

Jul 2026 · Communications Physics · 0 citations

TL;DR

This work shows that a dual-threshold bootstrap percolation model on random hypergraphs separates a connected active backbone from large-scale endogenous activation, providing a basis for predicting cascade risk and designing targeted node- and group-level interventions in complex systems.

Abstract

Collective behaviors such as infrastructure failures and social adoption propagate through groups governed by fixed quorum requirements rather than by pairwise contacts. However, it remains unclear how absolute group- and individual-level thresholds jointly shape cascades in higher-order networks. Here we show that a dual-threshold bootstrap percolation model on random hypergraphs separates a connected active backbone from large-scale endogenous activation. A seed-driven giant component emerges continuously at a structural percolation threshold, whereas macroscopic amplification ignites only at a higher dynamical tipping point, creating a metastable safety margin in which communication is possible without systemic outbreak. This decoupling reflects an asymmetric division of labor: the group quorum M acts as a source-side filter, while the individual barrier K serves as a receiver-side gatekeeper. On homogeneous substrates, the structural onset is protected to leading order against K , but heterogeneous connectivity erodes this protection. Our framework provides a basis for predicting cascade risk and designing targeted node- and group-level interventions in complex systems.

Read PDF

Similar papers

Open access Jun 2026

Extracting the transitivity backbone of bipartite networks

A statistical filter that benchmarks node-level bipartite clustering against degree-preserving randomizations to classify nodes as geometric (signal) or degree constrained noise is introduced, offering a simple, scalable way to disentangle structure from noise in bipartite networks.

L. Ramirez, Roya Aliakbarisani, M. Serrano et al. · 0 citations
Preprint Aug 2026

Ensemble-level loopy message passing with generalized-edge closure for percolation

Predicting the percolation threshold of highly clustered networks from local statistics remains difficult, because short loops break the independence assumption underlying tree-like message passing. Existing remedies address loopy connectivity either through prescribed local motifs in random-graph ensembles or through...

L.-H. Wang, Y.-M. Du · 0 citations
Open access Jul 2026

Epidemic Spreading and Control on Preferential Attachment Hypergraph with Community

This work proposes a community-based preferential attachment hypergraph model with tunable modularity and a heavy-tailed degree distribution, reproducing key structural properties in real systems, and develops a hypergraph-based SAIR framework to describe epidemic dynamics with asymptomatic transmission.

Jialin Bi, Ning-Han Sun · 0 citations
Jul 2026

Reliability-Contagion Feasibility in LLM Multi-Agent Networks

This work forms a correction-aware network model that tracks susceptible, exposed, infectious, and corrected agents and derive its early-invasion condition for heterogeneous communication networks, and couple this propagation model to an analytic majority-vote benchmark in which a clean-task reliability target imposes...

Rui-Wu Niu, Xincheng Shu, Ying Zhao · 0 citations
Jun 2026

Phase Boundary of a Stochastic Watts-Threshold SIS Model on Random Networks

Complex contagion models, in which adoption requires reinforcement from multiple neighbors, have been extensively studied in the monotone (no-recovery) setting, but the phase diagram of threshold models with SIS-like recovery on networks remains unmapped. We study a stochastic Watts-threshold SIS model on Erdos-Renyi a...

Yasmine Beji, Heger Arfaoui, Slimane BenMiled · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.