Estimating a graph from triad counts

DOI10.1080/00949657908810285MaRDI QIDQ4194326zbMATH OpenOpenAlexFDO

Authors Ove Frank

Publication date 1979

Published in Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00949657908810285

zbMATH Keywords

EstimationForestGraph InferenceInduced SubgraphRandom Evolutionary ProcessRandom GraphStructure ObservationsTransitive GraphTriad Counts

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Non-Markovian processes: estimation (62M09) Trees (05C05) Paired and multiple comparisons; multiple testing (62J15)

Cites work

• Random directed graph distributions and the triad census in social networks†
• The structural implications of measurement error in sociometry†

Cited in

(3)

• Triad count statistics
• On probability distributions of single-linkage dendrograms
• Transitivity in stochastic graphs and digraphs

This page was built for publication: Estimating a graph from triad counts

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