Structural Diversity and Homophily
Authors:
Open Access
- 4 August 2017
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 807-816
Abstract
A widely recognized organizing principle of networks is structural homophily, which suggests that people with more common neighbors are more likely to connect with each other. However, what influence the diverse structures embedded in common neighbors have on link formation is much less well-understood. To explore this problem, we begin by characterizing the structural diversity of common neighborhoods. Using a collection of 120 large-scale networks, we demonstrate that the impact of the common neighborhood diversity on link existence can vary substantially across networks. We find that its positive effect on Facebook and negative effect on LinkedIn suggest different underlying networking needs in these networks. We also discover striking cases where diversity violates the principle of homophily---that is, where fewer mutual connections may lead to a higher tendency to link with each other. We then leverage structural diversity to develop a common neighborhood signature (CNS), which we apply to a large set of networks to uncover unique network superfamilies not discoverable by conventional methods. Our findings shed light on the pursuit to understand the ways in which network structures are organized and formed, pointing to potential advancement in designing graph generation models and recommender systems.Keywords
Funding Information
- Army Research Laboratory (W911NF-09-2-0053)
- National Science Foundation (BCS-1229450)
This publication has 31 references indexed in Scilit:
- From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networksScientific Reports, 2013
- Structural diversity in social contagionProceedings of the National Academy of Sciences, 2012
- Superfamilies of Evolved and Designed NetworksScience, 2004
- Structure of growing social networksPhysical Review E, 2001
- Clustering and preferential attachment in growing networksPhysical Review E, 2001
- Random graphs with arbitrary degree distributions and their applicationsPhysical Review E, 2001
- Social Structure and Competition in Interfirm Networks: The Paradox of EmbeddednessAdministrative Science Quarterly, 1997
- Measuring Tie StrengthSocial Forces, 1984
- An Algorithm for Subgraph IsomorphismJournal of the ACM, 1976
- Hierarchical Grouping to Optimize an Objective FunctionJournal of the American Statistical Association, 1963