Estimation of the number of vertices of different degrees in a graph
From MaRDI portal
Publication:1152175
DOI10.1016/0378-3758(80)90032-4zbMath0459.62009OpenAlexW1977661148MaRDI QIDQ1152175
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
unbiased estimatorsestimation of number of verticespartial networksampled subgraphstructure inference
Related Items
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