Disentangling homophily, community structure and triadic closure in networks

  title={Disentangling homophily, community structure and triadic closure in networks},
  author={Tiago P. Peixoto},
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… 
Community detection and reciprocity in networks by jointly modeling pairs of edges
A probabilistic generative model and an efficient algorithm to both perform community detection and capture reciprocity in networks that overcomes the limitations of both standard algorithms and recent models that incorporate reciprocity through a pseudo-likelihood approximation are presented.
Measuring structural complementarity and similarity in networks
This work shows that complementarity is linked to the abundance of quadrangles and the presence of dense bipartite-like subgraphs and defines two families of coefficients, which can be used to discriminate between friendship and health advice networks as well as between networks from different domains.
Structural complementarity and similarity: linking relational principles to network structure
It is shown that friendship relations are linked to increased levels of structural similarity and health advice to significantly higher complementarity, and this paper studies their main properties and behavior in random graph models and demonstrates their theoretical validity and practical utility on a set of real-world social networks.
Descriptive vs. inferential community detection: pitfalls, myths and half-truths
It is argued that inferential methods are more typically aligned with clearer scientific questions, yield more robust results, and should be in many cases preferred.
The interplay between communities and homophily in semi-supervised classification using graph neural networks
By analyzing community structure and its correlation with node labels, this work is able to make informed predictions on the suitability of GNNs for classification on a given graph and devise a guideline for model selection based on graph structure.
The Multivariate Community Hawkes Model for Dependent Relational Events in Continuous-time Networks
The multivariate community Hawkes (MULCH) model is proposed, an extremely easy-to-understand community-based model for continuous-time networks that introduces dependence between node pairs using structured multivariate Hawkes processes.
Correlated copying in a hidden network model
It is suggested that hidden network models offer an alternative family of null models for network comparison, and may offer a useful conceptual framework for understanding network heterogeneity.
Opinion formation on social networks with algorithmic bias: dynamics and bias imbalance
It is shown that if the imbalance is strong enough, it may determine the final global opinion and the dynamical behavior of the population and it is concluded that this quantity varies within a wide range, showing occasionally signatures of critical slowing down and meta-stability.
Systematic assessment of the quality of fit of the stochastic block model for empirical networks
It is demonstrated that simple network descriptors can be used to evaluate whether or not the SBM can provide a sufficiently accurate representation, potentially pointing to possible model extensions that can systematically improve the expressiveness of this class of models.
The physics of higher-order interactions in complex systems
Evidence from neural systems shows that higher-order effects are present and important both statistically10–12 and topologically13,14, and there is also evidence to suggest that such higher- order signatures might in some cases be redundant.


Origins of Homophily in an Evolving Social Network1
The authors investigate the origins of homophily in a large university community, using network data in which interactions, attributes, and affiliations are all recorded over time. The analysis
Cumulative effects of triadic closure and homophily in social networks
The model shows that even small individual bias may prompt network-level changes such as segregation or core group dominance, and highlights that individual-level mechanisms should not be analyzed separately without considering the dynamics of society as a whole.
Estimating Causal Peer Influence in Homophilous Social Networks by Inferring Latent Locations
It is shown that if the network grows according to either a community (stochastic block) model, or a continuous latent space model, then latent homophilous attributes can be consistently estimated from the global pattern of social ties.
Missing and spurious interactions and the reconstruction of complex networks
This work is able to reliably identify both missing and spurious interactions in noisy network observations and enables network reconstructions that yield estimates of the true network properties that are more accurate than those provided by the observations themselves.
Community structure in social and biological networks
  • M. Girvan, M. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Stochastic blockmodels and community structure in networks
  • B. Karrer, M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2011
This work demonstrates how the generalization of blockmodels to incorporate this missing element leads to an improved objective function for community detection in complex networks and proposes a heuristic algorithm forcommunity detection using this objective function or its non-degree-corrected counterpart.
Communities, clustering phase transitions, and hysteresis: pitfalls in constructing network ensembles.
A "biased rewiring model" where clustering is enhanced by means of a fugacity as in the Strauss (or "triangle") model, but where the number of links attached to each node is strictly preserved.
Finding community structure in networks using the eigenvectors of matrices.
  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
A modularity matrix plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations, and a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong are proposed.
Sampling motif-constrained ensembles of networks
Applying the Wang-Landau method to social networks, the relation between transitivity and homophily is investigated, and the correlation between different types of motifs is quantified, finding that single motifs can explain up to 60% of the variation of motif profiles.
Peer influence groups: identifying dense clusters in large networks
  • J. Moody
  • Computer Science
    Soc. Networks
  • 2001