Triad count statistics

DOI10.1016/0012-365X(88)90202-6zbMath0675.05056MaRDI QIDQ1121915

Ove Frank

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

random graphsmultigraphsrandom multigraphstriad counts

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Analyzing local and global properties of multigraphs ⋮ Counting Small Induced Subgraphs with Hereditary Properties ⋮ A BAYESIAN APPROACH TO MODELING STOCHASTIC BLOCKSTRUCTURES WITH COVARIATES ⋮ A Fast Counting Method for 6-Motifs with Low Connectivity

Cites Work

• Parallel concepts in graph theory
• Markov Graphs
• Transitivity in stochastic graphs and digraphs
• Estimating a graph from triad counts
• Cluster Inference by Using Transitivity Indices in Empirical Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Triad count statistics