Testability and repair of hereditary hypergraph properties

Random Structures and Algorithms

Volumn 36, Issue 4, 2010, Pages 373-463

  Austin, Tim ^a   Tao, Terence ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

de Finetti's theorem; Exchangeable processes; Hypergraph regularity lemma; Local testability

Indexed keywords

EID: 77953248503     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20300     Document Type: Article

References (38)

1. D. Aldous, Representations for partially exchangeable arrays of random variables, J Multivariate Anal 11 (1981), 581-598.
2. D. Aldous, "On exchangeability and conditional independence," In G. Koch and F. Spizzochino (Editors), Exchangeability in probability and statistics (Rome, 1981), NorthHolland, Amsterdam, 1982, pp. 165-170.
3. D. Aldous, "Exchangeability and related topics," In P. L. Hennequin (Editor), École d'été de probabilités de Saint-Flour, XIII-1983, Lecture Notes in Mathematics 1117, Springer, Berlin, 1985, pp. 1-198.
4. N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy, Efficient testing of large graphs, Combinatorica 20 (2000), 451-476.
5. N. Alon and A. Shapira, "Every monotone graph property is testable," In Proceedings of the 37th ACM STOC, ACM Press, Baltimore, 2005, pp. 128-137.
6. N. Alon and A. Shapira, A characterization of the (natural) graph properties testable with one sided error, Proceedings of FOCS 2005, 429-438, SIAM Journal on Computing (Special Issue of FOCS'05) 37 (2008), 1703-1727.
7. T. Austin, On exchangeable random variables and the statistics of large graphs and hypergraphs, Probab Surv 5 (2008), 80-145.
8. C. Avart, V. Rödl, and M. Schacht, Every monotone 3-graph property is testable, SIAM J Discrete Math 21 (2007), 73-92.
9. C. Borgs, J. Chayes, L. Lovasz, V. Sos, and K. Veztergombi, Convergent sequences of dense graphs I: Subgraph frequencies, metric properties, and testing, Adv Math 219 (2008), 1801-1851.
10. F. Chung, R. Graham, and R. Wilson, Quasi-random graphs, Combinatorica 9 (1989), 345-362.
11. G. Elek, B. Szegedy, Limits of hypergraphs, removal and regularity lemmas.A non-standard approach, (in press). Available at:arXiv.org:0705.2179.
12. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, J Assoc Comput Machinery 45 (1998), 653-750.
13. O. Goldreich and M. Sudan, Locally testable codes and PCPs of almost-linear length, J Assoc Comput Machinery 53 (2006), 558-655.
14. W. T. Gowers, Hypergraph regularity and the multidimensional Szemere ́di theorem, Ann Math 166 (2007),897-946.
15. T. Gowers, Quasirandomness, counting and regularity for 3-uniform hypergraphs, Combin Probab Comput 15 (2006), 143-184.
16. R. L. Graham, B. L. Rothschild, and J. H. Spencer, Ramsey theory, Wiley, New York, 1990.
17. D. Hoover, Relations on probability spaces and arrays of random variables, unpublished, 1979.
18. D. Hoover, "Row-columns exchangeability and a generalized model for exchangeability," In G. Koch and F. Spizzochino (Editors), Exchangeability in probability and statistics (Rome, 1981), North-Holland, Amsterdam, 1982, pp. 281-291.
19. Y. Ishigami, A simple regularization of hypergraphs, (in press). Available at: arXiv.org: math.CO/0612838.
20. Y. Ishigami, Removal lemma for infinitely-many forbidden hypergraphs and property testing, (in press). Available at: arXiv.org: math.CO/0612669.
21. O. Kallenberg, Symmetries on random arrays and set-indexed processes, J Theor Probab 5 (1992),727-765.
22. J. Katz and L. Trevisan, On the efficiency of local decoding procedures for error-correcting codes, In Proceedings of 32nd STOC, ACM, Baltimore, 2000, pp. 80-86.
23. Y. Kohayakawa, B. Nagle, and V. Rödl, Efficient testing of hypergraphs, Extended Abstract in Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Springer-Verlag, London, 2002, pp. 1017-1028.
24. N. Linial, Some problems and results in the geometry of graphs, Available at: http://www.cs.huji.ac.il/nati/PAPERS/edinburgh.pdf.
25. L. Lovász and B. Szegedy,"Limitsofdensegraphsequences,"MicrosoftCorporationTechnical Report TR-2004-79, Available at: http://research.microsoft.com/users/lovasz/limits.pdf.
26. L. Lovász and B. Szegedy, Szemere ́di's lemma for the analyst, Geom Funct Anal 17 (2007), 252-270.
27. L. Lovász and B. Szegedy, "Graphs limits and testing hereditary graph properties," Microsoft Corporation Technical Report TR-2005-110, Available at: http://research.microsoft.com/ users/lovasz/heredit-test.pdf.
28. B. Nagle, V. Rödl, and M. Schacht, The counting lemma for regular k-uniform hypergraphs, Random Struct Algorithms 28 (2006), 113-179.
29. V. Rödl and M. Schacht, Regular partitions of hypergraphs: regularity lemmas, Combin Probab Comput 16 (2007), 833-885.
30. V. Rödl and M. Schacht, Generalizations of the removal lemma, (in press). Available at: http://www.informatik.hu-berlin.de/schacht/pub/preprints/gen_removal.pdf.
31. V. Rödl and J. Skokan, Regularity lemma for k-uniform hypergraphs, Random Struct Algorithms 25 (2004), 1-42.
32. V. Rödl and J. Skokan, Applications of the regularity lemma for uniform hypergraphs, Random Struct Algorithms 28 (2004), 180-194.
33. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J Comput 25 (1996), 252-271.
34. I. Ruzsa and E. Szemerédi, Triple systems with no six points carrying three triangles, Colloq Math Soc J Bolyai 18 (1978), 939-945.
35. E. Szemerédi, Regular partitions of graphs, In "Problémes Combinatoires et Théorie des Graphes, Proc Colloque Inter CNRS," CNRS Paris, Bermond, Fournier, Las Vergnas, and Sotteau (Editors), 1978, pp. 399-401.
36. E. Szemerédi, Integer sets containing no arithmetic progressions, Acta Math Hungar 56 (1990), 155-158.
37. T. Tao, A variant of the hypergraph removal lemma, (in press). Available at: arXiv.org:math/0503572.
38. T. Tao, A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma, J Anal Math, (in press). Available at: arXiv.org: math.CO/ 0602037.