Estimation of spanning tree mean-edge using node sampling

DOI10.3233/MAS-2009-0105MaRDI QIDQ6196571zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 14 March 2024

Published in Model Assisted Statistics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/mas-2009-0105

zbMATH Keywords

biasconfidence intervalgraphmean squared error (MSE)optimum choicesimple random sampling without replacement (SRSWOR)spanning treetreevertices (nodes)

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Probabilistic graphical models (62H22)

Recommendations

• Edge estimation in the population of a binary tree using node-sampling
• Edge estimation in population of planer graphs using sampling
• Estimating the number of connected components in a graph via subgraph sampling
• Graph sampling
• scientific article; zbMATH DE number 4142092

Cited in

(1)

• A class of logarithmic exponential estimators for estimating average degree of a network using triangular graph sampling

This page was built for publication: Estimation of spanning tree mean-edge using node sampling

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