Hiring in life sciences? Share your open positions with our professional community. Read more Close

Advertisement

Sequential cascades on random hypergraphs.

Created on 02 Nov 2026

Authors

Yiqi Zhang, Fanyuan Meng

Published in

Chaos (Woodbury, N.Y.). Volume 36. Issue 11. Nov 01, 2026.

Abstract

Sequential decisions within a group can correlate individual adoption outcomes, but this microscopic dependence is usually replaced by an imposed group-level response. We study a one-shot cascade on sparse random hypergraphs in which the first target in a newly triggered hyperedge adopts with probability p, whereas each later target adopts with probability p + Δ after a success and p - δ after a failure. For this stated process, we derive the exact target marginal qm, the complete correlated group-offspring probability-generating function Fm(z), and the early branching factor B. The classical Galton-Watson criterion then places the infinitesimal-seed onset at B=1, while its extinction fixed point depends on the complete offspring law. The new ingredients are the exact transfer-matrix offspring law for outcome memory and a matched-independent hypergraph control with the same qm and onset. For the original-cardinality null, directed-incidence percolation gives Rnull = ρnullSnull; the forward-survival and backward-reachability maps coincide for pairwise groups but generally differ for larger groups. Monte Carlo tests across group-size and degree laws support the threshold and survival predictions. A collision-aware control, which rematches the null to the number of targets actually remaining at first processing, reduces but does not remove the observed final-size gap at the tested parameters. System-size and cutoff sweeps likewise show that the 5% finite-network indicator is a proxy rather than the branching-survival probability. All claims are conditional on one-shot triggering, a vanishing seed density, and locally tree-like topology.

PMID:
42969881
Bibliographic data and abstract were imported from PubMed on 02 Nov 2026.

Read full publication at:
Please sign in to see all details.

Advertisement

Stats

  • Community rating n/a 0 votes
  • Reviewers' rating n/a 0 votes
  • Your rating

1-terrible, 9-excellent. How would you rate this publication? Sign in in to submit your rating.

  • Recommendations n/a n/a positive of 0 vote(s)
  • Views 9
  • Comments 0

Recommended by

  • No recommendations yet.

Post a comment

You need to be signed in to post comments. You can sign in here.

Comments

There are no comments yet.

Advertisement