TWITTER EVENT NETWORKS AND THE SUPERSTAR MODEL

被引:21
作者
Bhamidi, Shankar [1 ]
Steele, J. Michael [2 ]
Zaman, Tauhid [3 ]
机构
[1] Univ N Carolina, Dept Stat & Operat Res, Chapel Hill, NC 27599 USA
[2] Univ Penn, Dept Stat, Wharton Sch, Philadelphia, PA 19104 USA
[3] MIT, Alfred P Sloan Sch Management, Cambridge, MA 02142 USA
基金
美国国家科学基金会;
关键词
Dynamic networks; preferential attachment; continuous time branching processes; characteristics of branching processes; multitype branching processes; Twitter; social networks; retweet graph; BRANCHING-PROCESSES; GROWTH; GRAPHS; TREES;
D O I
10.1214/14-AAP1053
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
070103 [概率论与数理统计]; 140311 [社会设计与社会创新];
摘要
Condensation phenomenon is often observed in social networks such as Twitter where one "superstar" vertex gains a positive fraction of the edges, while the remaining empirical degree distribution still exhibits a power law tail. We formulate a mathematically tractable model for this phenomenon that provides abetter fit to empirical data than the standard preferential attachment model across an array of networks observed in Twitter. Using embeddings in an equivalent continuous time version of the process, and adapting techniques from the stable age-distribution theory of branching processes, we prove limit results for the proportion of edges that condense around the superstar, the degree distribution of the remaining vertices, maximal nonsuperstar degree asymptotics and height of these random trees in the large network limit.
引用
收藏
页码:2462 / 2502
页数:41
相关论文
共 27 条
[1]
[Anonymous], 2011, AAAI C WEBL SOC MED
[2]
[Anonymous], P 19 INT C WORLD WID, DOI DOI 10.1145/1772690.1772751
[3]
[Anonymous], 1998, CAMBRIDGE SERIES STA
[4]
Athreya K.B., 1972, BRANCHING PROCESSES, P196
[5]
Growth of preferential attachment random graphs via continuous-time branching processes [J].
Athreya, Krishna B. ;
Ghosh, Arka P. ;
Sethuraman, Sunder .
PROCEEDINGS OF THE INDIAN ACADEMY OF SCIENCES-MATHEMATICAL SCIENCES, 2008, 118 (03) :473-494
[6]
Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[7]
Bollobás B, 2003, HANDBOOK OF GRAPHS AND NETWORKS: FROM THE GENOME TO THE INTERNET, P1
[8]
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
[9]
Cha M., 2010, AAAI C WEBL SOC MED
[10]
A general model of web graphs [J].
Cooper, C ;
Frieze, A .
RANDOM STRUCTURES & ALGORITHMS, 2003, 22 (03) :311-335