Why Rumors Spread So Quickly in Social Networks

被引：244

作者：

Doer, Benjamin ^{[1
]}

Fouz, Mahmoud ^{[2
,3
]}

Friedrich, Tobias ^{[1
]}

机构：

[1] Max Planck Inst Informat, Dept Algorithms & Complex, Saarbrucken, Germany

[2] Univ Saarland, Dept Comp Sci, Computat Complex Grp, D-6600 Saarbrucken, Germany

[3] Rocket Internet, Dubai, U Arab Emirates

来源：

COMMUNICATIONS OF THE ACM | 2012年 / 55卷 / 06期

关键词：

INTERNET; DIAMETER;

D O I：

10.1145/2184319.2184338

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：70 / 75

页数：6

共 24 条

[1] Internet -: Diameter of the World-Wide Web [J].

Albert, R ;

Jeong, H ;

Barabási, AL .

NATURE, 1999, 401 (6749) :130-131

[2]

[Anonymous], 2011, GUARDIAN 0225

[3]

[Anonymous], 2003, Linked: How everything is connected to everything else and what it means

[4]

[Anonymous], 2003, Internet Math., DOI [10.1080/15427951.2004.10129080, DOI 10.1080/15427951.2004.10129080]

[5] Emergence of scaling in random networks [J].

Barabási, AL ;

Albert, R .

SCIENCE, 1999, 286 (5439) :509-512

[6]

Berger N, 2005, PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P301

[7]

Bhattacharjee B., ONLINE SOCIAL NETWOR

[8] Hamilton Cycles in 3-Out [J].

Bohman, Tom ;

Frieze, Alan .

RANDOM STRUCTURES & ALGORITHMS, 2009, 35 (04) :393-417

[9] The diameter of a scale-free random graph [J].

Bollobás, B ;

Riordan, O .

COMBINATORICA, 2004, 24 (01) :5-34

[10] The degree sequence of a scale-free random graph process [J].

Bollobás, B ;

Riordan, O ;

Spencer, J ;

Tusnády, G .

RANDOM STRUCTURES & ALGORITHMS, 2001, 18 (03) :279-290

← 1 2 3 →