2010/04/27 by Weiping Zhu, Zhu, Weiping
Computer Science · Mathematics · Medicine · #Distributed Sensor Networks and Detection Algorithms #FOS: Computer and information sciences #Medical Imaging Techniques and Applications #Networking and Internet Architecture (cs.NI) #Statistical Methods and Inference #cs.NI
paper · pdf · doi:10.48550/arxiv.1004.4690
submitted for publication
arxiv created 2010/04/27 · openalex publication_date 2010/04/27 · arxiv updated 2010/04/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For the tree topology, previous studies show the maximum likelihood estimate (MLE) of a link/path takes a polynomial form with a degree that is one less than the number of descendants connected to the link/path. Since then, the main concern is focused on searching for methods to solve the high degree polynomial without using iterative approximation. An explicit estimator based on the Law of Large Numbers has been proposed to speed up the estimation. However, the estimate obtained from the estimator is not a MLE. When n<∞, the estimate may be noticeable different from the MLE. To overcome this, an explicit MLE estimator is presented in this paper and a comparison between the MLE estimator and the explicit estimator proposed previously is presented to unveil the insight of the MLE estimator and point out the pitfall of the previous one.