skip to main content


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

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.

 
more » « less
Award ID(s):
2112457
NSF-PAR ID:
10364631
Author(s) / Creator(s):
; ; ; ; ;
Publisher / Repository:
Oxford University Press
Date Published:
Journal Name:
Journal of Complex Networks
Volume:
10
Issue:
2
ISSN:
2051-1329
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Cherifi, H. ; Mantegna, R.N. ; Rocha, L.M. ; Cherifi, C. ; Micciche, S. (Ed.)
    We investigate the statistical learning of nodal attribute distributions in homophily networks using random walks. Attributes can be discrete or continuous. A generalization of various existing canonical models, based on preferential attachment is studied, where new nodes form connections dependent on both their attribute values and popularity as measured by degree. We consider several canonical attribute agnostic sampling schemes such as Metropolis-Hasting random walk, versions of node2vec (Grover and Leskovec 2016) that incorporate both classical random walk and non-backtracking propensities and propose new variants which use attribute information in addition to topological information to explore the network. The performance of such algorithms is studied on both synthetic networks and real world systems, and its dependence on the degree of homophily, or absence thereof, is assessed. 
    more » « less
  2. Culbertson, J. ; Perfors, A. ; Rabagliati, H. ; Ramenzoni, V. (Ed.)
    Successful climate change adaptation depends on the spread and maintenance of adaptive behav- iors. Current theory suggests that the heterogeneity of metapopulation structure can help adaptations diffuse throughout a population. In this paper, we develop an agent-based model of the spread of adaptations in populations with minority-majority metapopulation structure, where subpopulations learn more or less frequently from their own group compared to the other group. In our simulations, minority-majority-structured populations with moderate degrees of in-group preference better spread and maintained an adaptation compared to populations with more equal-sized groups and weak homophily. Minority groups act as incubators for an adaptation, while majority groups act as reservoirs for an adaptation once it has spread widely. This means that adaptations diffuse throughout popula- tions better when minority groups start out knowing an adaptation, as Indigenous populations often do, while cohesion among majority groups further promotes adaptation diffusion. Our work advances the goal of this theme issue by developing new theoretical insights and demonstrating the utility of cultural evolutionary theory and methods as important tools in the nascent science of culture that climate change adaptation needs. 
    more » « less
  3. Abstract

    Reciprocity in social networks is a measure of information exchange between two individuals, and indicates interaction patterns between pairs of users. A recent study finds that the reciprocity coefficient of a classical directed preferential attachment (PA) model does not match empirical evidence. Towards remedying this deficiency, we extend the classical three-scenario directed PA model by adding a parameter that controls the probability of creating a reciprocal edge. This proposed model also allows edge creation between two existing nodes, making it a realistic candidate for fitting to datasets. We provide and compare two estimation procedures for fitting the new reciprocity model and demonstrate the methods on simulated and real datasets. One estimation method requires careful analysis of the heavy tail properties of the model. The fitted models provide a good match with the empirical tail distributions of both in- and out-degrees but other mismatched diagnostics suggest that further generalization of the model is warranted.

     
    more » « less
  4. Abstract We investigate the statistical learning of nodal attribute functionals in homophily networks using random walks. Attributes can be discrete or continuous. A generalization of various existing canonical models, based on preferential attachment is studied (model class $$\mathscr {P}$$ P ), where new nodes form connections dependent on both their attribute values and popularity as measured by degree. An associated model class $$\mathscr {U}$$ U is described, which is amenable to theoretical analysis and gives access to asymptotics of a host of functionals of interest. Settings where asymptotics for model class $$\mathscr {U}$$ U transfer over to model class $$\mathscr {P}$$ P through the phenomenon of resolvability are analyzed. For the statistical learning, we consider several canonical attribute agnostic sampling schemes such as Metropolis-Hasting random walk, versions of node2vec (Grover and Leskovec, 2016) that incorporate both classical random walk and non-backtracking propensities and propose new variants which use attribute information in addition to topological information to explore the network. Estimators for learning the attribute distribution, degree distribution for an attribute type and homophily measures are proposed. The performance of such statistical learning framework is studied on both synthetic networks (model class $$\mathscr {P}$$ P ) and real world systems, and its dependence on the network topology, degree of homophily or absence thereof, (un)balanced attributes, is assessed. 
    more » « less
  5. Abstract

    We investigate the three-state majority-vote model for opinion dynamics on scale-free and regular networks. In this model, an individual selects an opinion equal to the opinion of the majority of its neighbors with probability 1 − q, and different to it with probabilityq. The parameterqis called the noise parameter of the model. We build a network of interactions wherezneighbors are selected by each added site in the system, a preferential attachment network with degree distributionkλ, whereλ = 3 for a large number of nodesN. In this work,zis called the growth parameter. Using finite-size scaling analysis, we obtain that the critical exponents$$\beta /\bar{\nu }$$β/ν¯and$$\gamma /\bar{\nu }$$γ/ν¯associated with the magnetization and the susceptibility, respectively. Using Monte Carlo simulations, we calculate the critical noise parameterqcas a function ofzfor the scale-free networks and obtain the phase diagram of the model. We find that the critical exponents add up to unity when using a special volumetric scaling, regardless of the dimension of the network of interactions. We verify this result by obtaining the critical noise and the critical exponents for the two and three-state majority-vote model on cubic lattice networks.

     
    more » « less