2000 character limit reached
Diagrammatic Rules for Triad Census (2401.07381v1)
Published 14 Jan 2024 in physics.soc-ph and cs.SI
Abstract: In network theory, a triad census is a method designed to categorize and enumerate the various types of subgraphs with three nodes and their connecting edges within a network. Triads serve as fundamental building blocks for comprehending the structure and dynamics of networks, and the triad census offers a systematic approach to their classification. Typically, triad counts are obtained numerically, but lesser-known methods have been developed to precisely evaluate them without the need for sampling. In our study, we build upon Moody's matrix approach, presenting general diagrammatic rules that systematically and intuitively generate closed formulas for the occurrence numbers of triads in a network.
- Two decades of network science: as seen through the co-authorship network of network scientists. In Proceedings of the 2019 IEEE/ACM international conference on advances in social networks analysis and mining, pages 578–583, 2019.
- Emergence of scaling in random networks. science, 286(5439):509–512, 1999.
- Steven H Strogatz. Exploring complex networks. nature, 410(6825):268–276, 2001.
- Statistical mechanics of complex networks. Reviews of modern physics, 74(1):47, 2002.
- The statistical analysis of local structure in social networks, 1974.
- A method for detecting structure in sociometric data. In Social networks, pages 411–432. Elsevier, 1977.
- Meir Fershtman. Transitivity and the path census in sociometry. Journal of Mathematical Sociology, 11(2):159–189, 1985.
- Thomas Augustinus Benedictus Snijders and Franciscus Nicolaas Stokman. Extensions of triad counts to networks with different subsets of points and testing the underlying random graph distributions. Rijksuniversiteit Groningen, 1986.
- Stanley S Wasserman. Random directed graph distributions in the triad census in social networks. Technical report, National Bureau of Economic Research, 1975.
- Network motifs: simple building blocks of complex networks. Science, 298(5594):824–827, 2002.
- Superfamilies of evolved and designed networks. Science, 303(5663):1538–1542, 2004.
- Local structure in social networks. Sociological methodology, 7:1–45, 1976.
- Network motifs in the transcriptional regulation network of escherichia coli. Nature genetics, 31(1):64–68, 2002.
- Uri Alon. Network motifs: theory and experimental approaches. Nature Reviews Genetics, 8(6):450–461, 2007.
- A review on models and algorithms for motif discovery in protein–protein interaction networks. Briefings in Functional Genomics and Proteomics, 7(2):147–156, 2008.
- Enrico Borriello. The local topology of dynamical network models for biology. bioRxiv, pages 2023–01, 2023.
- Olga M Zvereva. Triad census usage for communication network analysis. In AIST (Supplement), pages 378–389, 2016.
- James Allen. Natural language understanding. Benjamin-Cummings Publishing Co., Inc., 1995.
- Proc. r. soc. london, ser. b. 2001.
- Social network analysis: Methods and applications. 1994.
- Logit models and logistic regressions for social networks: I. an introduction to markov graphs and p. Psychometrika, 61(3):401–425, 1996.
- James Moody. Matrix methods for calculating the triad census. Social Networks, 20(4):291–299, 1998.
