[PDF][PDF] Why rumors spread so quickly in social networks

B Doerr, M Fouz, T Friedrich - Communications of the ACM, 2012 - dl.acm.org
Why rumors spread so quickly in social networks Page 1 70 communications of the acm | june
2012 | vol. 55 | no. 6 Understanding strUctUral and algorithmic properties of complex networks is …

Social networks spread rumors in sublogarithmic time

B Doerr, M Fouz, T Friedrich - Proceedings of the forty-third annual ACM …, 2011 - dl.acm.org
With the prevalence of social networks, it has become increasingly important to understand
their features and limitations. It has been observed that information spreads extremely fast in …

Rumor spreading in social networks

F Chierichetti, S Lattanzi, A Panconesi - Theoretical Computer Science, 2011 - Elsevier
Social networks are an interesting class of graphs likely to become of increasing importance
in the future, not only theoretically, but also for its probable applications to ad hoc and …

[图书][B] Risk analysis of complex and uncertain systems

LA Cox Jr - 2009 - books.google.com
In Risk Analysis of Complex and Uncertain Systems acknowledged risk authority Tony Cox
shows all risk practitioners how Quantitative Risk Assessment (QRA) can be used to improve …

[图书][B] A course on the web graph

A Bonato - 2008 - books.google.com
" A Course on the Web Graph provides a comprehensive introduction to state-of-the-art
research on the applications of graph theory to real-world networks such as the web graph. It …

Shortest-path queries for complex networks: exploiting low tree-width outside the core

T Akiba, C Sommer, K Kawarabayashi - Proceedings of the 15th …, 2012 - dl.acm.org
We present new and improved methods for efficient shortest-path query processing. Our
methods are tailored to work for two specific classes of graphs: graphs with small tree-width …

Rumor spreading in social networks

F Chierichetti, S Lattanzi, A Panconesi - … 2009, Rhodes, greece, July 5-12 …, 2009 - Springer
Social networks are an interesting class of graphs likely to become of increasing importance
in the future, not only theoretically, but also for its probable applications to ad hoc and …

A survey of models of the web graph

A Bonato - Workshop on Combinatorial and Algorithmic Aspects of …, 2004 - Springer
LNCS 3405 - A Survey of Models of the Web Graph Page 1 A Survey of Models of the Web
Graph Anthony Bonato⋆ Department of Mathematics, Wilfrid Laurier University, Waterloo …

Development of a concept for building a critical infrastructure facilities security system

S Yevseiev, Y Melenti, O Voitko… - … -European Journal of …, 2021 - papers.ssrn.com
DEVELOPMENT OF A CONCEPT FOR BUILDING A CRITICAL INFRASTRUCTURE
FACILITIES SECURITY SYSTEM Page 1 Information and controlling system 63 1 …

Techniques for analyzing dynamic random graph models of web‐like networks: An overview

A Cami, N Deo - Networks: An International Journal, 2008 - Wiley Online Library
Various random graph models have recently been proposed to replicate and explain the
topology of large, complex, real‐life networks such as the World Wide Web and the Internet …