Pith. sign in

REVIEW

Message-Passing Methods for Complex Contagions

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 1703.08046 v1 pith:J3KZ2DBG submitted 2017-03-23 physics.soc-ph cs.SImath.DSmath.PRnlin.AO

classification physics.soc-phcs.SImath.DSmath.PRnlin.AO
keywords networksapproachmessage-passingmethodscascadeconditionconfiguration-modelderive
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Message-passing methods provide a powerful approach for calculating the expected size of cascades either on random networks (e.g., drawn from a configuration-model ensemble or its generalizations) asymptotically as the number $N$ of nodes becomes infinite or on specific finite-size networks. We review the message-passing approach and show how to derive it for configuration-model networks using the methods of (Dhar et al., 1997) and (Gleeson, 2008). Using this approach, we explain for such networks how to determine an analytical expression for a "cascade condition", which determines whether a global cascade will occur. We extend this approach to the message-passing methods for specific finite-size networks (Shrestha and Moore, 2014; Lokhov et al., 2015), and we derive a generalized cascade condition. Throughout this chapter, we illustrate these ideas using the Watts threshold model.

Discussion (0). Sign in to comment.

Pith tools