Distributed Estimation Via Random Access

From MaRDI portal
Publication:3604443

DOI10.1109/TIT.2008.924652zbMATH Open1318.62083arXiv0706.1588OpenAlexW2066894657MaRDI QIDQ3604443FDOQ3604443


Authors: Animashree Anandkumar, Lang Tong, Ananthram Swami Edit this on Wikidata


Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: The problem of hypothesis testing against independence for a Gauss-Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the log-likelihood ratio of detection is derived. Assuming random placement of nodes over a large region according to the Poisson or uniform distribution and nearest-neighbor dependency graph, the error exponent of the Neyman-Pearson detector is derived using large-deviations theory. The error exponent is expressed as a dependency-graph functional and the limit is evaluated through a special law of large numbers for stabilizing graph functionals. The exponent is analyzed for different values of the variance ratio and correlation. It is found that a more correlated GMRF has a higher exponent at low values of the variance ratio whereas the situation is reversed at high values of the variance ratio.


Full work available at URL: https://arxiv.org/abs/0706.1588




Recommendations




Cited In (10)





This page was built for publication: Distributed Estimation Via Random Access

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