Comparison of statistical graph-size estimators
Journal of Statistical Planning and InferencePublished 1 January 1982
Michael Capobianco, Ove Frank
Citations13
SJR quartileQ2
SJR score0.66
SNIP0.99
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
We investigate several unbiased estimators of the size of a graph G which are based on sampled induced subgraphs, stars and dyads. By comparing their variances we find some general dominance relations between them, and we also give some conditions on G which guarantee some other instances of dominance.
Keywords
Computer ScienceMathematicsPhysics and Astronomy
Social NetworksSampling and estimation in large social networks
130 Citations1978Ove Frank
Unbiased estimators and variance estimators of such graph parameters which can be given as dyad or triad counts are found and approximate formulae pertaining to large networks are given.
Lecture notes in mathematicsEstimating the connectivity of a graph
18 Citations1972Michael Capobianco
STRUCTURE INFERENCE AND STOCHASTIC GRAPHS
14 Citations1968Ove Frank