Multiscale mixing patterns in networks
arXiv:1708.01236 · doi:10.1073/pnas.1713019115
Abstract
Assortative mixing in networks is the tendency for nodes with the same attributes, or metadata, to link to each other. It is a property often found in social networks manifesting as a higher tendency of links occurring between people with the same age, race, or political belief. Quantifying the level of assortativity or disassortativity (the preference of linking to nodes with different attributes) can shed light on the factors involved in the formation of links and contagion processes in complex networks. It is common practice to measure the level of assortativity according to the assortativity coefficient, or modularity in the case of discrete-valued metadata. This global value is the average level of assortativity across the network and may not be a representative statistic when mixing patterns are heterogeneous. For example, a social network spanning the globe may exhibit local differences in mixing patterns as a consequence of differences in cultural norms. Here, we introduce an approach to localise this global measure so that we can describe the assortativity, across multiple scales, at the node level. Consequently we are able to capture and qualitatively evaluate the distribution of mixing patterns in the network. We find that for many real-world networks the distribution of assortativity is skewed, overdispersed and multimodal. Our method provides a clearer lens through which we can more closely examine mixing patterns in networks.
11 pages, 7 figures
References in corpus (3)
Cited by in corpus (17)
- Cumulative effects of triadic closure and homophily in social networks
- Ideological differences in engagement in public debate on Twitter
- Inequality and Inequity in Network-based Ranking and Recommendation Algorithms
- Network constraints on the mixing patterns of binary node metadata
- Mixing patterns and individual differences in networks
- Reactive random walkers on complex networks
- Beyond Localized Graph Neural Networks: An Attributed Motif Regularization Framework
- Assortative and preferential attachment lead to core-periphery networks
- Motif Dynamics in Signed Directional Complex Networks
- Homophily Within and Across Groups
- Grounding force-directed network layouts with latent space models
- Classification and threshold dynamics of stochastic reaction networks
- Local, global and scale-dependent node roles
- Growing Attributed Networks through Local Processes
- Gromov Centrality: A Multi-Scale Measure of Network Centrality Using Triangle Inequality Excess
- Fiber decomposition of deterministic reaction networks with applications
- Occupational Network Structure and Vector Assortativity for illustrating patterns of social mobility