Rumors spread slowly in a small-world spatial network

DOI10.1137/16M1083256MaRDI QIDQ4588846zbMATH OpenFDO

Authors Abbas Mehrabian, Jeannette Janssen

Publication date 2 November 2017

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

rumor spreadingspatial preferred attachment modeleffective diameterpush\&pull protocol

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Stochastic network models in operations research (90B15)

Recommendations

• Rumours spread slowly in a small world spatial network
• Rumor Spreading in Social Networks
• Rumor spreading in social networks
• Social networks spread rumors in sublogarithmic time
• Social networks spread rumors in sublogarithmic time

Cites work

• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• scientific article; zbMATH DE number 1246230 (Why is no real title available?)
• scientific article; zbMATH DE number 5070369 (Why is no real title available?)
• A Geometric Preferential Attachment Model of Networks II
• A spatial web graph model with local influence regions
• Burning a graph as a model of social contagion
• Diameter and broadcast time of random geometric graphs in arbitrary dimensions
• Geometric graph properties of the spatial preferred attachment model
• Geometric protean graphs
• Modularity of complex networks models
• Nonuniform distribution of nodes in the spatial preferential attachment model
• Random Geometric Graphs
• Randomized broadcast in networks
• Robustness of scale-free spatial networks
• Size of the giant component in a random geometric graph
• Social networks spread rumors in sublogarithmic time
• Some Typical Properties of the Spatial Preferred Attachment Model
• Spatial preferential attachment networks: power laws and clustering coefficients
• The cover time of the preferential attachment graph
• The shortest-path problem for graphs with random arc-lengths
• The structure of geographical threshold graphs
• Ultra-fast rumor spreading in social networks

Cited in

(5)

• Scale-free percolation mixing time
• Two different approaches for parameter identification in a spatial-temporal rumor propagation model based on Turing patterns
• Rumours spread slowly in a small world spatial network
• Not all interventions are equal for the height of the second peak
• Penalising transmission to hubs in scale-free spatial random graphs

This page was built for publication: Rumors spread slowly in a small-world spatial network

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