Edge estimation in the population of a binary tree using node-sampling

DOI10.1080/03610926.2012.685552MaRDI QIDQ2921834zbMATH OpenOpenAlexFDO

Authors D. Shukla, Yashwant Singh Rajput, Narendra Singh Thakur

Publication date 14 October 2014

Published in Communications in Statistics. Theory and Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610926.2012.685552

zbMATH Keywords

graphconfidence intervalbiasbinary treeestimatormean squared error (MSE)simple random sampling without replacement (SRSWOR)left edge group (LEG)optimum choiceright edge group (REG)vertices (nodes)

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05)

Recommendations

• Edge estimation in population of planer graphs using sampling
• Sampling a branching tree
• Graph sampling
• Estimating the number of connected components in a graph via subgraph sampling
• Graph sampling

Cites work

• scientific article; zbMATH DE number 3080959 (Why is no real title available?)
• scientific article; zbMATH DE number 3092178 (Why is no real title available?)
• Multidimensional balanced binary trees

Cited in

(3)

• Edge estimation in population of planer graphs using sampling
• A class of logarithmic exponential estimators for estimating average degree of a network using triangular graph sampling
• Estimation of spanning tree mean-edge using node sampling

This page was built for publication: Edge estimation in the population of a binary tree using node-sampling

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