IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v43y2014i13p2815-2829.html
   My bibliography  Save this article

Edge Estimation in the Population of a Binary Tree Using Node-Sampling

Author

Listed:
  • D. Shukla
  • Yashwant Singh Rajput
  • Narendra Singh Thakur

Abstract

Suppose a finite population of several vertices, each connected to single or multiple edges. This constitutes a structure of graphical population of vertices and edges. As a special case, the graphical population like a binary tree having only two child vertices associated to parent vertex is taken into consideration. The entire binary tree is divided into two sub-graphs such as a group of left-nodes and a group of right-nodes. This paper takes into account a mixture of graph structured and population sampling theory together and presents a methodology for mean-edge-length estimation of left sub-graph using right edge sub-graph as an auxiliary source of information. A node-sampling procedure is developed for this purpose and a class of estimators is proposed containing several good estimators. Mathematical conditions for minimum bias and optimum mean squared error of the class are derived and theoretical results are numerically supported with a test of 99% confidence intervals. It is shown that suggested class has a sub-class of optimum estimators, and sample-based estimates are closer to the true value of the population parameter.

Suggested Citation

  • D. Shukla & Yashwant Singh Rajput & Narendra Singh Thakur, 2014. "Edge Estimation in the Population of a Binary Tree Using Node-Sampling," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 43(13), pages 2815-2829, July.
    • Handle: RePEc:taf:lstaxx:v:43:y:2014:i:13:p:2815-2829
    DOI: 10.1080/03610926.2012.685552
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2012.685552
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2012.685552?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:43:y:2014:i:13:p:2815-2829. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.