A trust model for spreading gossip in social networks: a multi-type bootstrap percolation model
DOI10.1098/rspa.2019.0826zbMath1472.91024arXiv1905.11204OpenAlexW3011067136WikidataQ91763149 ScholiaQ91763149MaRDI QIDQ5160880
Laura P. Schaposnik, Rinni Bhansali
Publication date: 29 October 2021
Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.11204
combinatoricsgraph theorymathematical modellingbootstrap percolationtrust modelinformation propagationdisease propagation
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Related Items (1)
Cites Work
- Unnamed Item
- Scale-free graph with preferential attachment and evolving internal vertex structure
- Data mining of social networks represented as graphs
- On percolation in random graphs with given vertex degrees
- Sharp metastability threshold for two-dimensional bootstrap percolation
- On rumour propagation among sceptics
- Subcritical $\mathcal {U}$-bootstrap percolation models have non-trivial phase transitions
- Rumor Processes on N
- Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
- Bootstrap percolation on the random regular graph
- Bootstrap Percolation in High Dimensions
- Monotone Cellular Automata in a Random Environment
- Deterministic scale-free networks
This page was built for publication: A trust model for spreading gossip in social networks: a multi-type bootstrap percolation model