Corpus ID: 230799589

Disentangling homophily, community structure and triadic closure in networks

@article{Peixoto2021DisentanglingHC,
  title={Disentangling homophily, community structure and triadic closure in networks},
  author={T. Peixoto},
  journal={ArXiv},
  year={2021},
  volume={abs/2101.02510}
}
  • T. Peixoto
  • Published 2021
  • Computer Science, Physics, Mathematics
  • ArXiv
  • 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 is 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… CONTINUE READING
    1 Citations

    References

    SHOWING 1-10 OF 70 REFERENCES
    Origins of Homophily in an Evolving Social Network1
    • 575
    • PDF
    Cumulative effects of triadic closure and homophily in social networks
    • 6
    • PDF
    Latent Poisson models for networks with heterogeneous density
    • T. Peixoto
    • Computer Science, Physics
    • Physical review. E
    • 2020
    • 4
    • PDF
    Missing and spurious interactions and the reconstruction of complex networks
    • 510
    • PDF
    Revealing consensus and dissensus between network partitions
    • 7
    • PDF
    Community structure in social and biological networks
    • M. Girvan, M. Newman
    • Computer Science, Medicine
    • Proceedings of the National Academy of Sciences of the United States of America
    • 2002
    • 11,653
    • Highly Influential
    • PDF
    Stochastic blockmodels and community structure in networks
    • B. Karrer, M. Newman
    • Mathematics, Computer Science
    • Physical review. E, Statistical, nonlinear, and soft matter physics
    • 2011
    • 1,297
    • Highly Influential
    • PDF
    Peer influence groups: identifying dense clusters in large networks
    • J. Moody
    • Psychology, Computer Science
    • Soc. Networks
    • 2001
    • 218
    • Highly Influential
    • PDF
    Finding community structure in networks using the eigenvectors of matrices.
    • M. Newman
    • Mathematics, Medicine
    • Physical review. E, Statistical, nonlinear, and soft matter physics
    • 2006
    • 3,606
    • Highly Influential
    • PDF
    Communities, clustering phase transitions, and hysteresis: pitfalls in constructing network ensembles.
    • 25
    • PDF