Rumor spreading in social networks
From MaRDI portal
Publication:541666
DOI10.1016/j.tcs.2010.11.001zbMath1218.68042OpenAlexW2012559698MaRDI QIDQ541666
Silvio Lattanzi, Flavio Chierichetti, Alessandro Panconesi
Publication date: 7 June 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.001
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)
Related Items
Rumor spreading model considering the activity of spreaders in the homogeneous network ⋮ The analysis of an SEIR rumor propagation model on heterogeneous network ⋮ Stochastic analysis of rumor spreading with multiple pull operations ⋮ Spreading dynamics of an online social rumor model with psychological factors on scale-free networks ⋮ Homophily in competing behavior spreading among the heterogeneous population with higher-order interactions ⋮ Global stability of a variation epidemic spreading model on complex networks ⋮ A model for the spread of rumors in Barrat-Barthelemy-Vespignani (BBV) networks ⋮ A rumor spreading model with variable forgetting rate ⋮ The coupled dynamics of information dissemination and SEIR-based epidemic spreading in multiplex networks ⋮ Immune sets in monotone infection rules. Characterization and complexity ⋮ A multi-information epidemic spreading model on a two-layer network ⋮ Continuous-time stochastic analysis of rumor spreading with multiple operations ⋮ Studying fake news spreading, polarisation dynamics, and manipulation by bots: a tale of networks and language ⋮ Mining the hidden link structure from distribution flows for a spatial social network ⋮ Spread mechanism and control strategy of social network rumors under the influence of COVID-19 ⋮ Information diffusion on the iterated local transitivity model of online social networks ⋮ Probabilistic Analysis of Rumor-Spreading Time ⋮ Information spreading in dynamic graphs ⋮ Dynamical analysis of rumor spreading model in homogeneous complex networks ⋮ Constant factor approximation for tracking paths and fault tolerant feedback vertex set ⋮ A deterministic mathematical model for the spread of two rumors ⋮ Message propagation in the network based on node credibility ⋮ A Simple Markovian Spreading Process with Mobile Agents
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The cover time of the preferential attachment graph
- The shortest-path problem for graphs with random arc-lengths
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- The diameter of a scale-free random graph
- On certain connectivity properties of the internet topology
- The degree sequence of a scale-free random graph process
- Almost tight bounds for rumour spreading with conductance
- Emergence of Scaling in Random Networks
- Randomized broadcast in networks
- Fast Distributed Algorithms for Computing Separable Functions
- On Spreading a Rumor
- Coupling Scale-Free and Classical Random Graphs
- Robustness and Vulnerability of Scale-Free Random Graphs
- The diameter of sparse random graphs
- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
- Concentration of Measure for the Analysis of Randomized Algorithms
