Detection error exponent for spatially dependent samples in random networks

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 2882-2886

  Anandkumar, A ^a   Tong, Lang ^a   Willsky, Alan ^b  

^a School of Chemical and Molecular Engineering   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Error exponent; Law of large numbers for graph functionals; Markov random field; Random graphs

Indexed keywords

ACYCLIC GRAPHS; ASYMPTOTIC PERFORMANCE; BINARY HYPOTHESIS TESTING; CLIQUE POTENTIAL; DETECTION ERROR; ERROR EXPONENT; FUNCTIONALS; HYPOTHESIS TESTING; LAW OF LARGE NUMBERS; LAW OF LARGE NUMBERS FOR GRAPH FUNCTIONALS; MARKOV RANDOM FIELD; RANDOM GRAPHS; RANDOM NETWORK; SAMPLE SIZES; SPATIAL DEPENDENCE;

ERROR DETECTION; HIDDEN MARKOV MODELS; INFORMATION THEORY; SENSOR NODES; STRUCTURAL FRAMES; TELECOMMUNICATION EQUIPMENT;

GRAPH THEORY;

EID: 70449467701     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205358     Document Type: Conference Paper

References (16)

1. H. V. Poor, An Introduction to Signal Detection and Estimation. New York: Springer-Verlag, 1994.
2. T. Han, "Hypothesis Testing with the General Source," IEEE Tran. Inform. Theory, vol. 46, no. 7, pp. 2415-2427, Nov. 2000.
3. T. Cover and J. Thomas, Elements of Information Theory. John Wiley & Sons, Inc., 1991.
4. P.-N. Chen, "General formulas for the Neyman-Pearson type-II error exponent subject to fixed and exponential type-I error bounds," IEEE Tran. on Information Theory, vol. 42, no. 1, pp. 316-323, Jan. 1996.
5. H. K̈unsch, "Thermodynamics and Statistical Analysis of Gaussian Random Fields," Probability Theory and Related Fields, vol. 58, no. 3, pp. 407-421, 1981.
6. Y. Sung, H. Yu, and H. V. Poor, "Information, Energy and Density for Ad-hoc Sensor Networks over Correlated Random Fields: Largedeviation Analysis," in IEEE ISIT, July 2008, pp. 1592-1596.
7. Z. Rached, F. Alajaji, and L. Campbell, "The Kullback-Leibler divergence rate between Markov sources," Information Theory, IEEE Transactions on, vol. 50, no. 5, pp. 917-921, 2004.
8. L. Xie, V. Ugrinovskii, and I. Petersen, "Probabilistic distances between finite-state finite-alphabet hidden Markov models," Automatic Control, IEEE Transactions on, vol. 50, no. 4, pp. 505-511, 2005.
9. H. Liang, R. Anderson-Sprecher, R. Kubichek, and G. Talwar, "A Novel Approach to Approximate Kullback-Leibler Distance Rate for Hidden Markov Models," in Asilomar Conf. on Signals, Systems and Computers, 2005, pp. 869-873.
10. M. Vidyasagar, "Bounds on the kullback-leibler divergence rate between hidden markov models," in Conf. on Decision and Control, Dec. 2007, pp. 6160-6165.
11. A. Anandkumar, L. Tong, and A. Swami, "Detection of Gauss-Markov Random Fields with Nearest-neighbor Dependency," IEEE Tran. Infor-mation Theory, vol. 55, no. 2, pp. 816-827, Feb. 2009.
12. M. Penrose and J. Yukich, "Weak Laws Of Large Numbers In Geometric Probability," Annals of Applied Probability, vol. 13, no. 1, pp. 277-303, 2003.
13. P.Billingsley, Probability and Measure. New York, NY: Wiley Inter-Science, 1995.
14. P. Bréemaud, Markov Chains: Gibbs fields, Monte Carlo simulation, and queues. Springer, 1999.
15. A. Anandkumar, L. Tong, and A. Swami, "Optimal Node Density for Detection in Energy Constrained Random Networks," IEEE Tran. Signal Proc., vol. 56, no. 10, pp. 5232-5245, Oct. 2008.
16. A. Anandkumar, J. Yukich, L. Tong, and A. Swami, "Energy Scaling Laws for Distributed Inference in Random Networks," Accepted to IEEE J. Selec. Area Comm., available on Arxiv, Dec. 2008.