Pith. sign in

REVIEW 1 cited by

Social contagion models on hypergraphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1909.11154 v1 pith:R27J3NJN submitted 2019-09-24 physics.soc-ph cond-mat.stat-mech

classification physics.soc-phcond-mat.stat-mech
keywords socialhypergraphsanalyticalcontagiondynamicsmodelsunderstandinganalyses
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Our understanding of the dynamics of complex networked systems has increased significantly in the last two decades. However, most of our knowledge is built upon assuming pairwise relations among the system's components. This is often an oversimplification, for instance, in social interactions that occur frequently within groups. To overcome this limitation, here we study the dynamics of social contagion on hypergraphs. We develop an analytical framework and provide numerical results for arbitrary hypergraphs, which we also support with Monte Carlo simulations. Our analyses show that the model has a vast parameter space, with first and second-order transitions, bi-stability, and hysteresis. Phenomenologically, we also extend the concept of latent heat to social contexts, which might help understanding oscillatory social behaviors. Our work unfolds the research line of higher-order models and the analytical treatment of hypergraphs, posing new questions and paving the way for modeling dynamical processes on these networks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Revealing Higher-Order Interactions in Complex Networks: A U.S. Diplomacy Case Study

    cs.SI 2025-09 conditional novelty 5.0 of 10

    On U.S. diplomatic cables and Senate bills, a non-Markovian random walk on hypergraphs predicts missing and novel group interactions better than pairwise-graph walks.

Pith tools