Estimating a graph from triad counts
From MaRDI portal
Publication:4194326
DOI10.1080/00949657908810285zbMath0407.62062OpenAlexW2120240525MaRDI QIDQ4194326
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
EstimationForestRandom GraphGraph InferenceInduced SubgraphRandom Evolutionary ProcessStructure ObservationsTransitive GraphTriad Counts
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Non-Markovian processes: estimation (62M09) Trees (05C05) Paired and multiple comparisons; multiple testing (62J15)
Related Items (3)
Triad count statistics ⋮ Transitivity in stochastic graphs and digraphs ⋮ On probability distributions of single-linkage dendrograms
Cites Work
This page was built for publication: Estimating a graph from triad counts