Transitivity in stochastic graphs and digraphs

DOI10.1080/0022250X.1980.9989907zbMath0445.05049MaRDI QIDQ3889081

Ove Frank

Publication date: 1980

Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)

zbMATH Keywords

transitivityinduced subgraphsrandom networktransitivity indexstructure inferenceasymmetric digraphstochastic graph models

Mathematics Subject Classification ID

Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20) Paired and multiple comparisons; multiple testing (62J15)

Related Items

Asymptotic distributions in random graphs with applications to social networks, Asymptotic normality of graph statistics, Triad count statistics, Triad count estimation in digraphs

Cites Work

• Unnamed Item
• Survey sampling in graphs
• Random directed graph distributions and the triad census in social networks†
• Estimating a graph from triad counts
• DISCUSSION PAPER: RECENT PROGRESS IN STAGRAPHICS
• Stochastic Competition Graphs
• ON THE METHOD OF PAIRED COMPARISONS
• On the method of paired comparisons