Saved in:
Bibliographic Details
Main Author: Borriello, Enrico
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2401.07381
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910298196148224
author Borriello, Enrico
author_facet Borriello, Enrico
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2401_07381
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Diagrammatic Rules for Triad Census
Borriello, Enrico
Physics and Society
Social and Information Networks
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.
title Diagrammatic Rules for Triad Census
topic Physics and Society
Social and Information Networks
url https://arxiv.org/abs/2401.07381