Rumors spread slowly in a small-world spatial network
DOI10.1137/16M1083256zbMATH Open1373.05185MaRDI QIDQ4588846FDOQ4588846
Authors: Abbas Mehrabian, Jeannette Janssen
Publication date: 2 November 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Recommendations
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)
Cites Work
- Random Geometric Graphs
- Title not available (Why is that?)
- Modularity of complex networks models
- Title not available (Why is that?)
- The shortest-path problem for graphs with random arc-lengths
- Title not available (Why is that?)
- Randomized broadcast in networks
- Size of the giant component in a random geometric graph
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions
- Social networks spread rumors in sublogarithmic time
- The structure of geographical threshold graphs
- The cover time of the preferential attachment graph
- A spatial web graph model with local influence regions
- Burning a graph as a model of social contagion
- Geometric protean graphs
- Geometric graph properties of the spatial preferred attachment model
- Robustness of scale-free spatial networks
- Spatial preferential attachment networks: power laws and clustering coefficients
- Some Typical Properties of the Spatial Preferred Attachment Model
- Ultra-fast rumor spreading in social networks
- Nonuniform distribution of nodes in the spatial preferential attachment model
- A Geometric Preferential Attachment Model of Networks II
Cited In (5)
- Scale-free percolation mixing time
- Rumours spread slowly in a small world spatial network
- Two different approaches for parameter identification in a spatial-temporal rumor propagation model based on Turing patterns
- 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)