Triad count estimation in digraphs

DOI10.1080/0022250X.1998.9990215zbMath0927.91042MaRDI QIDQ4229256

Martin Karlberg

Publication date: 16 December 1999

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

zbMATH Keywords

local netnetwork samplingHorvitz-Thompson estimationlocal settriad count

Mathematics Subject Classification ID

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

Related Items (1)

Triad count estimation in digraphs

Cites Work

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

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