Network cardinality estimation using max consensus: the case of Bernoulli trials
(2015) CDC 2015 — Location: Osaka, Japan, December 2015
Files
CDC15_1700_FI.pdf
Restricted Access - Adobe PDF
- 474.5 KB
Details
- Authors
- Abstract
- Interested in scalable topology reconstruction strategies with fast convergence times, we consider network cardinality estimation schemes that use, as their fundamental aggregation mechanism, the computation of bit-wise maxima over strings. We thus discuss how to choose optimally the parameters of the information generation process under frequentist assumptions on the estimand, derive the resulting Maximum Likelihood (ML) estimator, and characterize its statistical performance as a function of the communications and memory requirements. We then numerically compare the bitwise-max based estimator against lexicographic-max based estimators, and derive insights on their relative performances in function of the true cardinality
- Affiliations
Citations
Lucchese, R., Varagnolo, D., Delvenne, J.-C., & Hendrickx, J. (2015). Network cardinality estimation using max consensus: the case of Bernoulli trials. Proceedings of the 54rd IEEE Conference on Decision and Control, 896-901. https://doi.org/10.1109/CDC.2015.7402342