Transitivity in stochastic graphs and digraphs

DOI10.1080/0022250X.1980.9989907MaRDI QIDQ3889081zbMATH OpenFDO

Authors Ove Frank

Publication date 1980

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

Full work available at URL https://doi.org/10.1080/0022250X.1980.9989907

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

• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• DISCUSSION PAPER: RECENT PROGRESS IN STAGRAPHICS
• Estimating a graph from triad counts
• ON THE METHOD OF PAIRED COMPARISONS
• On the method of paired comparisons
• Random directed graph distributions and the triad census in social networks†
• Stochastic Competition Graphs
• Survey sampling in graphs

Cited in

(6)

• Triad count estimation in digraphs
• Consistency of empirical distributions of sequences of graph statistics in networks with dependent edges
• Triad count statistics
• Asymptotic normality of graph statistics
• Asymptotic distributions in random graphs with applications to social networks
• Functional central limit theorem for the simultaneous subgraph count of dynamic Erdős-Rényi random graphs

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)