scientific article; zbMATH DE number 7053382
From MaRDI portal
Publication:5743506
zbMath1421.68003MaRDI QIDQ5743506
Thomas Sauerwald, Nikolaos Fountoulakis, Konstantinos D. Panagiotou
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095246
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12) Internet topics (68M11)
Related Items (17)
On the Diameter of Hyperbolic Random Graphs ⋮ Ultra-Fast Load Balancing on Scale-Free Networks ⋮ On the Diameter of Hyperbolic Random Graphs ⋮ Asynchronous rumor spreading on random graphs ⋮ On the Push&Pull Protocol for Rumor Spreading ⋮ SIR rumor spreading model with trust rate distribution ⋮ Rumors Spread Slowly in a Small-World Spatial Network ⋮ Push is Fast on Sparse Random Graphs ⋮ Rumor Spreading with No Dependence on Conductance ⋮ A multi-stage SIR model for rumor spreading ⋮ De-anonymization of heterogeneous random graphs in quasilinear time ⋮ Faster rumor spreading with multiple calls ⋮ Unnamed Item ⋮ Dynamic 8-state ICSAR rumor propagation model considering official rumor refutation ⋮ Rumor spreading with bounded in-degree ⋮ Breaking the \(\log n\) barrier on rumor spreading ⋮ Robustness of randomized rumour spreading
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On mixing and edge expansion properties in randomized broadcasting
- Connected components in random graphs with given expected degree sequences
- Almost tight bounds for rumour spreading with conductance
- Typical Distances in Ultrasmall Random Networks
- On Randomized Broadcasting in Power Law Networks
- Fast Distributed Algorithms for Computing Separable Functions
- Rumor Spreading in Social Networks
- A Brief History of Generative Models for Power Law and Lognormal Distributions
- The Average Distance in a Random Graph with Given Expected Degrees
- Partial information spreading with application to distributed maximum coverage
- The phase transition in inhomogeneous random graphs
- Analyzing network coding gossip made easy
- Spectra of random graphs with given expected degrees
- Probability and Computing
- On a conditionally Poissonian graph process
This page was built for publication:
