Transitivity in stochastic graphs and digraphs

DOI10.1080/0022250X.1980.9989907zbMATH Open0445.05049MaRDI QIDQ3889081FDOQ3889081

Authors: Ove Frank 

Publication date: 1980

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

zbMATH Keywords

transitivityrandom networkinduced subgraphstransitivity indexstructure inferenceasymmetric digraphstochastic graph models

Mathematics Subject Classification ID

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

Cites Work

• ON THE METHOD OF PAIRED COMPARISONS
• Title not available (Why is that?)
• Random directed graph distributions and the triad census in social networks†
• Survey sampling in graphs
• On the method of paired comparisons
• Estimating a graph from triad counts
• DISCUSSION PAPER: RECENT PROGRESS IN STAGRAPHICS
• Stochastic Competition Graphs

Cited In (4)

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

This page was built for publication: Transitivity in stochastic graphs and digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3889081)