Estimation of the number of vertices of different degrees in a graph

DOI10.1016/0378-3758(80)90032-4zbMath0459.62009OpenAlexW1977661148MaRDI QIDQ1152175

Ove Frank

Publication date: 1980

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(80)90032-4

zbMATH Keywords

unbiased estimatorsestimation of number of verticespartial networksampled subgraphstructure inference

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Graph theory (05C99)

Related Items (7)

Horvitz-Thompson estimator under partial information with an application to network degree distribution ⋮ Graph sampling ⋮ Weighting estimation under bipartite incidence graph sampling ⋮ Streaming Algorithms with One-Sided Estimation ⋮ Estimation of Offending and Co-offending Using Available Data with Model Support ⋮ Triad count estimation in digraphs ⋮ Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks

Cites Work

• Survey sampling in graphs
• On the Estimation of the Number of Classes in a Population
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Estimation of the number of vertices of different degrees in a graph