The Maki-Thompson Model with Spontaneous Stifling on Symmetric Networks
Nancy Lopes Garcia, Denis Araujo Luiz, Daniel Miranda Machado

TL;DR
This paper analyzes a generalized rumor spreading model on symmetric networks, incorporating spontaneous stifling, and derives laws describing the average behavior and fluctuations of rumor dynamics across different network types.
Contribution
It introduces a unified framework for analyzing rumor spreading with spontaneous stifling on quasi-transitive networks, including new laws for large network behavior.
Findings
Established a Functional Law of Large Numbers for rumor densities.
Derived a Central Limit Theorem showing Gaussian fluctuations.
Provided explicit covariance structure for fluctuations.
Abstract
We investigate rumor spreading in a generalized Maki-Thompson model with spontaneous stifling, evolving on quasi-transitive networks. Individuals are either ignorants, spreaders, or stiflers; spreaders stop by contact with other spreaders or stiflers or after an independent random waiting time sampled from a given distribution, modeling a spontaneous loss of interest. The topology of the underlying population network is incorporated by modeling it as a broad class of symmetric networks, whose vertices are partitioned into finitely many orbit types. This yields a unified framework for homogeneous and heterogeneous networks. For sequences of finite quasi-transitive graphs, and for infinite quasi-transitive graphs with subexponential growth, we establish a Functional Law of Large Numbers and a Functional Central Limit Theorem for the densities of each vertex type for the three states. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Opinion Dynamics and Social Influence · Opportunistic and Delay-Tolerant Networks
