A message-passing framework for random clustered networks predicts percolation thresholds from local neighborhood overlap, with a new closure coefficient that flags when the prediction will fail.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cond-mat.stat-mech 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Ensemble-level loopy message passing with generalized-edge closure for percolation
A message-passing framework for random clustered networks predicts percolation thresholds from local neighborhood overlap, with a new closure coefficient that flags when the prediction will fail.