Pages that link to "Item:Q5419071"
From MaRDI portal
The following pages link to Social networks spread rumors in sublogarithmic time (Q5419071):
Displayed 19 items.
- Randomised broadcasting: memory vs. randomness (Q391757) (← links)
- Membership(s) and compliance(s) with class-based graphs (Q456151) (← links)
- On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
- Breaking the \(\log n\) barrier on rumor spreading (Q2075628) (← links)
- Accelerated information dissemination on networks with local and global edges (Q2097337) (← links)
- Faster rumor spreading with multiple calls (Q2256120) (← links)
- Rumor-propagation model with consideration of refutation mechanism in homogeneous social networks (Q2321475) (← links)
- Discovery Through Gossip (Q2811164) (← links)
- Randomized rumor spreading in poorly connected small-world networks (Q2818280) (← links)
- (Q2857363) (← links)
- The Small Community Phenomenon in Networks: Models, Algorithms and Applications (Q2898016) (← links)
- Push is Fast on Sparse Random Graphs (Q2953404) (← links)
- Rumor Spreading with No Dependence on Conductance (Q2963582) (← links)
- Asymptotically Optimal Randomized Rumor Spreading (Q3012944) (← links)
- Rumors Spread Slowly in a Small-World Spatial Network (Q4588846) (← links)
- Robustness of randomized rumour spreading (Q4993120) (← links)
- (Q5075774) (← links)
- On the Push&Pull Protocol for Rumor Spreading (Q5346546) (← links)
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems (Q5892351) (← links)