A trust model for spreading gossip in social networks: a multi-type bootstrap percolation model

DOI10.1098/RSPA.2019.0826zbMATH Open1472.91024arXiv1905.11204OpenAlexW3011067136WikidataQ91763149 ScholiaQ91763149MaRDI QIDQ5160880FDOQ5160880

Authors: Rinni Bhansali, Laura P. Schaposnik 

Publication date: 29 October 2021

Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Abstract: We introduce here a multi-type bootstrap percolation model, which we call T-Bootstrap Percolation (T-BP), and apply it to study information propagation in social networks. In this model, a social network is represented by a graph G whose vertices have different labels corresponding to the type of role the person plays in the network (e.g. a student, an educator, etc.). Once an initial set of vertices of G is randomly selected to be carrying a gossip (e.g. to be infected), the gossip propagates to a new vertex provided it is transmitted by a minimum threshold of vertices with different labels. By considering random graphs, which have been shown to closely represent social networks, we study different properties of the T-BP model through numerical simulations, and describe its implications when applied to rumour spread, fake news, and marketing strategies.

Full work available at URL: https://arxiv.org/abs/1905.11204

Recommendations

• Rumor spreading model with trust mechanism in complex social networks
• Bootstrap percolation in directed inhomogeneous random graphs
• Bootstrap percolation on random geometric graphs (extended abstract)
• Bootstrap percolation in power-law random graphs
• Rumor propagation with heterogeneous transmission in social networks

zbMATH Keywords

combinatoricsgraph theorymathematical modellingbootstrap percolationtrust modelinformation propagationdisease propagation

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Scale-free graph with preferential attachment and evolving internal vertex structure
• Sharp metastability threshold for two-dimensional bootstrap percolation
• Bootstrap percolation in high dimensions
• Monotone cellular automata in a random environment
• Deterministic scale-free networks
• Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
• Bootstrap percolation on the random regular graph
• On percolation in random graphs with given vertex degrees
• Rumor Processes on N
• Data mining of social networks represented as graphs
• On rumour propagation among sceptics
• Subcritical \(\mathcal{U}\)-bootstrap percolation models have non-trivial phase transitions
• Finding cliques in social networks: a new distribution-free model

Cited In (2)

• Modeling cascading failures with the crisis of trust in social networks
• Accelerated information dissemination on networks with local and global edges

This page was built for publication: A trust model for spreading gossip in social networks: a multi-type bootstrap percolation model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5160880)