Triad count statistics
type: Item
instance of: scholarly article
title: Triad count statistics
zbMATH Open document ID: 0675.05056
DOI: 10.1016/0012-365X(88)90202-6
author: Ove Frank
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: The triad counts of a graph G are the numbers of various distinct induced subgraphs of order 3. A multigraph is a sequence \(G=(G_ 1,G_ 2,...,G_ r)\) of graphs and digraphs defined on a common vertex set. The concept of triad counts is generalized in this paper to multigraphs with coloured edges, vertices, and arcs. It is shown how triad counts in multigraphs can be used in various kinds of statistical analyses. Probability distributions of the triad counts of random multigraphs are investigated.
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 4105011
zbMATH Keywords: random graphs
zbMATH Keywords: triad counts
zbMATH Keywords: multigraphs
zbMATH Keywords: random multigraphs
reviewed by: G. R. Grimmett
MaRDI profile type: Publication
cites work: Q3852212
cites work: Q3682518
cites work: Q4162294
cites work: Estimating a graph from triad counts
cites work: Q3934426
cites work: Transitivity in stochastic graphs and digraphs
cites work: Q3924254
cites work: Q3880877
cites work: Cluster Inference by Using Transitivity Indices in Empirical Graphs
cites work: Markov Graphs
cites work: Parallel concepts in graph theory
cites work: Q3680834
description: scientific article; zbMATH DE number 4105011