Scale-free degree distributions, homophily and the glass ceiling effect in directed networks

被引:2
作者
Nettasinghe, Buddhika [1 ]
Alipourfard, Nazanin [2 ]
Iota, Stephen [2 ]
Krishnamurthy, Vikram [1 ]
Lerman, Kristina [2 ]
机构
[1] Cornell Univ, Sch Elect & Comp Engn, Ithaca, NY 14853 USA
[2] Univ Southern Calif, Informat Sci Inst, Marina Del Rey, CA 90292 USA
关键词
directed graph; preferential attachment; degree distribution; power-law; homophily; heterophily; random graph model; minorities; densification; glass ceiling effect;
D O I
10.1093/comnet/cnac007
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Preferential attachment, homophily, and their consequences such as scale-free (i.e. power-law) degree distributions, the glass ceiling effect (the unseen, yet unbreakable barrier that keeps minorities and women from rising to the upper rungs of the corporate ladder, regardless of their qualifications or achievements) and perception bias are well-studied in undirected networks. However, such consequences and the factors that lead to their emergence in directed networks (e.g. author-citation graphs, Twitter) are yet to be coherently explained in an intuitive, theoretically tractable manner using a single dynamical model. To this end, we present a theoretical and numerical analysis of the novel Directed Mixed Preferential Attachment model in order to explain the emergence of scale-free degree distributions and the glass ceiling effect in directed networks with two groups (minority and majority). Specifically, we first derive closed-form expressions for the power-law exponents of the in-degree and out-degree distributions of each of the two groups and then compare the derived exponents with each other to obtain useful insights. These insights include answers to questions such as: when does the minority group have an out-degree (or in-degree) distribution with a heavier tail compared to the majority group? what factors cause the tail of the out-degree distribution of a group to be heavier than the tail of its own in-degree distribution? what effect does frequent addition of edges between existing nodes have on the in-degree and out-degree distributions of the majority and minority groups? Answers to these questions shed light on the interplay between structure (i.e. the in-degree and out-degree distributions of the two groups) and dynamics (characterized collectively by the homophily, preferential attachment, group sizes and growth dynamics) of various real-world directed networks. We also provide a novel definition of the glass ceiling faced by a group via the number of individuals with large out-degree (i.e. those with many followers) normalized by the number of individuals with large in-degree (i.e. those who follow many others) and then use it to characterize the conditions that cause the glass ceiling effect to emerge in a directed network. Our analytical results are supported by detailed numerical experiments. The DMPA model and its theoretical and numerical analysis provided in this article are useful for analysing various phenomena on directed networks in fields such as network science and computational social science.
引用
收藏
页数:29
相关论文
共 22 条
[1]   Friendship paradox biases perceptions in directed networks [J].
Alipourfard, Nazanin ;
Nettasinghe, Buddhika ;
Abeliuk, Andres ;
Krishnamurthy, Vikram ;
Lerman, Kristina .
NATURE COMMUNICATIONS, 2020, 11 (01)
[2]   Mixed preferential attachment model: Homophily and minorities in social networks [J].
Avin, Chen ;
Daltrophe, Hadassa ;
Keller, Barbara ;
Lotker, Zvi ;
Mathieu, Claire ;
Peleg, David ;
Pignolet, Yvonne-Anne .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2020, 555
[3]   Homophily and the Glass Ceiling Effect in Social Networks [J].
Avin, Chen ;
Keller, Barbara ;
Lotker, Zvi ;
Mathieu, Claire ;
Peleg, David ;
Pignolet, Yvonne-Anne .
PROCEEDINGS OF THE 6TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE (ITCS'15), 2015, :41-50
[4]   Scale-free characteristics of random networks:: the topology of the World-Wide Web [J].
Barabási, AL ;
Albert, R ;
Jeong, H .
PHYSICA A, 2000, 281 (1-4) :69-77
[5]   Scale-free networks [J].
Barabási, AL ;
Bonabeau, E .
SCIENTIFIC AMERICAN, 2003, 288 (05) :60-69
[6]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[7]  
Bollobás B, 2003, SIAM PROC S, P132
[8]   Graph structure in the Web [J].
Broder, A ;
Kumar, R ;
Maghoul, F ;
Raghavan, P ;
Rajagopalan, S ;
Stata, R ;
Tomkins, A ;
Wiener, J .
COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2000, 33 (1-6) :309-320
[9]  
Cohen R, 2003, LECT NOTES PHYS, V625, P23
[10]   A general model of web graphs [J].
Cooper, C ;
Frieze, A .
RANDOM STRUCTURES & ALGORITHMS, 2003, 22 (03) :311-335