Triad count estimation in digraphs

DOI10.1080/0022250X.1998.9990215MaRDI QIDQ4229256zbMATH OpenFDO

Authors Martin Karlberg

Publication date 16 December 1999

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

zbMATH Keywords

network samplingHorvitz-Thompson estimationlocal netlocal settriad count

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Social networks; opinion dynamics (91D30)

Recommendations

• Triad count statistics
• Asymptotic normality of triad counts in random digraphs
• A hybrid sampling scheme for triangle counting
• Efficient triangle counting in large graphs via degree-based vertex partitioning
• Motif estimation via subgraph sampling: the fourth-moment phenomenon

Cites work

• A Generalization of Sampling Without Replacement From a Finite Universe
• Cluster Inference by Using Transitivity Indices in Empirical Graphs
• Estimation of the number of vertices of different degrees in a graph
• Markov Graphs
• Survey sampling in graphs
• Transitivity and the path census in sociometry
• Transitivity in stochastic graphs and digraphs
• Triad count estimation in digraphs

Cited in

(7)

• Triad count estimation in digraphs
• Optimal strategies in sampling from a soćial network
• Triad count statistics
• Motif estimation via subgraph sampling: the fourth-moment phenomenon
• Transitivity and the path census in sociometry
• Estimation of a local-aggregate network model with sampled networks
• Asymptotic normality of triad counts in random digraphs

This page was built for publication: Triad count estimation in digraphs

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