Mutual Information Measure for Glass Ceiling Effect in Preferential Attachment Models

被引:0
作者
Luo, Rui [1 ]
Nettasinghe, Buddhika [2 ]
Krishnamurthy, Vikram [3 ]
机构
[1] City Univ Hong Kong, Dept Syst Engn, Kowloon, Hong Kong 999077, Peoples R China
[2] Univ Iowa, Tippie Coll Business, Iowa City, IA 52242 USA
[3] Cornell Univ, Sch Elect & Comp Engn, Ithaca, NY 14850 USA
基金
美国国家科学基金会;
关键词
Glass; Mutual information; Entropy; Computational modeling; Optimization; Analytical models; Urban areas; Citation gap; directed mixed preferential attachment (DMPA) model; glass ceiling effect; mutual information; R & eacute; nyi entropy; ORGANIZATION; PATTERNS;
D O I
10.1109/TCSS.2024.3432600
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This article introduces a novel mutual information-based measure to assess the glass ceiling effect in preferential attachment networks, which advances the analysis of inequalities in attributed networks. Using Shannon entropy and generalizing to R & eacute;nyi entropy, our measure evaluates the conditional probability distributions of node attributes given the node degrees of adjacent nodes, which offers a more nuanced understanding of inequality compared to traditional methods that emphasize node degree distributions and degree assortativity alone. To evaluate the efficacy of the proposed measure, we evaluate it using an analytical structural inequality model as well as historical publication data. Results show that our mutual information measure aligns well with both the theoretical model and empirical data, underscoring its reliability as a robust approach for capturing inequalities in attributed networks. Moreover, we introduce a novel stochastic optimization algorithm that utilizes a parameterized conditional logit model for edge addition. Our algorithm is shown to outperform the baseline uniform distribution based approach in mitigating the glass ceiling effect. By strategically recommending links based on this algorithm, we can effectively hinder the glass ceiling effect within networks.
引用
收藏
页码:7778 / 7788
页数:11
相关论文
共 29 条
[11]  
Nettasinghe B., 2021, ARXIV
[12]   Scale-free degree distributions, homophily and the glass ceiling effect in directed networks [J].
Nettasinghe, Buddhika ;
Alipourfard, Nazanin ;
Iota, Stephen ;
Krishnamurthy, Vikram ;
Lerman, Kristina .
JOURNAL OF COMPLEX NETWORKS, 2021, 10 (02)
[13]   Coauthorship networks and patterns of scientific collaboration [J].
Newman, MEJ .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2004, 101 :5200-5205
[14]   Assortative mixing in networks [J].
Newman, MEJ .
PHYSICAL REVIEW LETTERS, 2002, 89 (20)
[15]   Scaling Choice Models of Relational Social Data [J].
Overgoor, Jan ;
Supaniratisai, George Pakapol ;
Ugander, Johan .
KDD '20: PROCEEDINGS OF THE 26TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2020, :1990-1998
[16]   Choosing to Grow a Graph: Modeling Network Formation as Discrete Choice [J].
Overgoor, Jan ;
Benson, Austin R. ;
Ugander, Johan .
WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, :1409-1420
[17]   Popularity versus similarity in growing networks [J].
Papadopoulos, Fragkiskos ;
Kitsak, Maksim ;
Angeles Serrano, M. ;
Boguna, Marian ;
Krioukov, Dmitri .
NATURE, 2012, 489 (7417) :537-540
[18]   Assortativeness and information in scale-free networks [J].
Piraveenan, M. ;
Prokopenko, M. ;
Zomaya, A. Y. .
EUROPEAN PHYSICAL JOURNAL B, 2009, 67 (03) :291-300
[19]   An Information-Theoretic Primer on Complexity, Self-Organization, and Emergence [J].
Prokopenko, Mikhail ;
Boschietti, Fabio ;
Ryan, Alex J. .
COMPLEXITY, 2009, 15 (01) :11-28
[20]   Classical information theory of networks [J].
Radicchi, Filippo ;
Krioukov, Dmitri ;
Hartle, Harrison ;
Bianconi, Ginestra .
JOURNAL OF PHYSICS-COMPLEXITY, 2020, 1 (02)