Disentangling homophily, community structure and triadic closure in networks

Abstract

Network homophily, the tendency of similar nodes to be connected, and transitivity, the tendency of two nodes being connected if they share a common neighbor, are conflated properties in network analysis, since one mechanism can drive the other. Here we present a generative model and corresponding inference procedure that are capable of distinguishing between both mechanisms. Our approach is based on a variation of the stochastic block model (SBM) with the addition of triadic closure edges, and its inference can identify the most plausible mechanism responsible for the existence of every edge in the network, in addition to the underlying community structure itself. We show how the method can evade the detection of spurious communities caused solely by the formation of triangles in the network, and how it can improve the performance of edge prediction when compared to the pure version of the SBM without triadic closure.

arXiv comment23 pages, 10 figures

References in corpus (44)

• Community structure in social and biological networks
• Community detection in graphs
• Uncovering the overlapping community structure of complex networks in nature and society
• Finding community structure in networks using the eigenvectors of matrices
• Cooperative Game Theory Approaches for Network Partitioning
• The structure of scientific collaboration networks
• Hierarchical structure and the prediction of missing links in networks
• Stochastic blockmodels and community structure in networks
• Networks beyond pairwise interactions: structure and dynamics
• Community detection in complex networks using Extremal Optimization
• Self-similar community structure in organisations
• Higher-order organization of complex networks
• Community Structure in Jazz
• Homophily and Contagion Are Generically Confounded in Observational Social Network Studies
• Modularity from Fluctuations in Random Graphs and Complex Networks
• Missing and spurious interactions and the reconstruction of complex networks
• Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
• The statistical mechanics of networks
• Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys
• Simplicial Closure and higher-order link prediction
• Triadic closure as a basic generating mechanism of communities in complex networks
• Hierarchical Block Structures and High-resolution Model Selection in Large Networks
• Identifying modular flows on multilayer networks reveals highly overlapping organization in social systems
• Nonparametric Bayesian inference of the microcanonical stochastic block model
• Solution of the 2-star model of a network
• Evaluating Overfit and Underfit in Models of Network Community Structure
• Stacking Models for Nearly Optimal Link Prediction in Complex Networks
• Cumulative effects of triadic closure and homophily in social networks
• A network approach to analyzing highly recombinant malaria parasite genes
• Hypergraph reconstruction from network data
• Reconstructing networks with unknown and heterogeneous errors
• Cover time for random walks on arbitrary complex networks
• Clustering Drives Assortativity and Community Structure in Ensembles of Networks
• Consistencies and inconsistencies between model selection and link prediction in networks
• Merge-split Markov chain Monte Carlo for community detection
• Revealing consensus and dissensus between network partitions
• Clustering Phase Transitions and Hysteresis: Pitfalls in Constructing Network Ensembles
• Estimating Causal Peer Influence in Homophilous Social Networks by Inferring Latent Locations
• Sampling motif-constrained ensembles of networks
• Generative model for reciprocity and community detection in networks
• Micro, Meso, Macro: the effect of triangles on communities in networks
• Atomic subgraphs and the statistical mechanics of networks
• Latent Poisson models for networks with heterogeneous density
• Transitions in loopy random graphs with fixed degrees and arbitrary degree distributions

Cited by in corpus (10)

• The physics of higher-order interactions in complex systems
• Descriptive vs. inferential community detection in networks: pitfalls, myths, and half-truths
• Assortative and preferential attachment lead to core-periphery networks
• Implicit models, latent compression, intrinsic biases, and cheap lunches in community detection
• Random graphs and real networks with weak geometric coupling
• Entropy of microcanonical finite-graph ensembles
• Strongly clustered random graphs via triadic closure: An exactly solvable model
• The latent cognitive structures of social networks
• Systematic assessment of the quality of fit of the stochastic block model for empirical networks
• Emergence of network communities driven by local rules