Graph-constrained group testing

IEEE Transactions on Information Theory

Volumn 58, Issue 1, 2012, Pages 248-262

  Cheraghchi, Mahdi ^a   Karbasi, Amin ^b   Mohajer, Soheil ^c   Saligrama, Venkatesh ^d  

^a Carnegie Mellon University ^*  (United States)

^b EPFL   (Switzerland)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d Boston University   (United States)

Author keywords

Group testing; network tomography; random walks; sensor networks; sparse recovery

Indexed keywords

ARBITRARY SUBSETS; COMPLETE GRAPHS; DEFECTIVE ITEMS; EXPANDER GRAPHS; GROUP TESTING; MIXING TIME; NETWORK TOMOGRAPHY; RANDOM GRAPHS; RANDOM WALK; SPARSE RECOVERY; SPECTRAL GAP;

GRAPHIC METHODS; LAKES; RANDOM PROCESSES; SENSOR NETWORKS; SENSORS; TESTING;

GRAPH THEORY;

EID: 84855696725     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2169535     Document Type: Article

References (20)

1. R. Dorfman, "The detection of defective members of large populations," Ann. Math. Statist., vol. 14, pp. 436-440, 1943.
2. D.-Z. Du and F. Hwang, Combinatorial Group Testing and Its Applications, 2nd ed. Singapore: World Scientific , 2000.
3. G. Atia and V. Saligrama, "Boolean compressed sensing and noisy group testing," CoRR vol. abs/0907.1061, 2009, Preprint.
4. M. Sobel and P. Groll, "Group testing to eliminate efficiently all defectives in a binomial sample," Bell Syst. Tech. J., vol. 38, pp. 1179-1252, 1959.
5. P. Pevzner and R. Lipshutz, "TowardsDNA sequencing chips," in Proc. MFCS, 1994, vol. 841, pp. 143-158, ser. Lecture Notes in Computer Science.
6. A. Blass and Y. Gurevich, "Pairwise testing," Bull. EATCS, vol. 78, pp. 100-132, 2002.
7. J. Wolf, "Born-again group testing: Multiaccess communications, " IEEE Trans. Inf. Theory, vol. 31, pp. 185-191, 1985. (Pubitemid 15597501)
8. N. Duffield, "Network tomography of binary network performance characteristics," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5373-5388, 2006. (Pubitemid 46445379)
9. H. Nguyen and P. Thiran, "The boolean solution to the congested IP link location problem: Theory and practice," in Proc. 26th IEEE Int. Conf. Comput. Commun. (INFOCOM'07), May 2007, pp. 2117-2125. (Pubitemid 47334445)
10. H. Nguyen and P. Thiran, "Using end-to-end data to infer lossy links in sensor networks," in Proc. 25th IEEE Int. Conf. Comput. Commun. (INFOCOM'06), 2006.
11. M. Cheraghchi, A. Hormati, A. Karbasi, and M. Vetterli, "Compressed sensing with probabilistic measurements: A group testing solution," in Proc. Allerton Conf. Commun., Contr. Computat. (UIUC), 2009.
12. W. Xu, E. Mallada, and A. Tang, "Compressive sensing over graphs," in Proc. 29th IEEE Int. Conf. Computer Communications (INFOCOM), 2010, pp. 2087-2095.
13. R. Berinde, A. C. Gilbert, P. Indyk, H. J. Karloff, and M. J. Strauss, "Combining geometry and combinatorics: A unified approach to sparse signal recovery," in Proc. Allerton Conf. Communication, Control, and Computation, UIUC, 2008, pp. 798-805.
14. D. B. Wilson, "Generating random spanning trees more quickly than the cover time," in Proc. 28th Ann. ACM Symp. Theory of Comput., Philadelphia, PA, 1996, pp. 296-303, 1996.
15. M. Aigner, Combinatorial Search, ser. Wiley-Teubner Series in Computer Science. New York: Wiley, 1988.
16. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge , U.K.: Cambridge Univ. Press, 1995.
17. M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge, U.K.: Cambridge Univ. Press, 2005.
18. B. Bollobás, Random Graphs. Cambridge, U.K.: Cambridge Univ. Press, 2001, vol. 73.
19. S. Hoory, N. Linial, and A. Wigderson, "Expander graphs and their applications," Bull. AMS, vol. 43, no. 4, pp. 439-561, 2006. (Pubitemid 44448254)
20. A. Sinclair and M. Jerrum, "Approximate counting, uniform generation and rapidly mixing Markov chains," Inf. Computat., vol. 82, no. 1, pp. 93-133, 1989.