Graph limits and parameter testing

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 261-270

  Borgs, Christian ^a   Chayes, Jennifer ^a   Lovász, László ^a   Sós, Vera T ^b   Szegedy, Balázs ^c   Vesztergombi, Katalin ^d  

^a MICROSOFT RESEARCH   (United States)

^b ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

^d EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

Convergence of graphs; Distance of graphs; Graph homomorphism; Graph limit; Property testing

Indexed keywords

COMPUTER SCIENCE; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; NUMERICAL ANALYSIS; PARAMETER ESTIMATION;

CONVERGENCE OF GRAPHS; DISTANCE OF GRAPHS; GRAPH HOMOMORPHISM; GRAPH LIMITS; PROPERTY TESTING;

GRAPH THEORY;

EID: 33748103148     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132556     Document Type: Conference Paper

References (18)

1. N. Alon, E. Fisher, M. Krivelevich and M. Szegedy: Efficient testing of large graphs, Combinatorica 20 (2000) 451-476.
2. N. Alon, W. Fernandez de la Vega, R. Kannan and M. Karpinski; Random sampling and approximation of MAX-CSPs, J. Comput. System Sci. 67 (2003), 212-243.
3. N. Alon and M. Krivelevich: Testing k-colorability, SIAM J. Discrete Math. 15 (2002), 211-227.
4. N. Alon, A. Naor: Approximating the Cut-Norm via Grothendieck's Inequality (preprint).
5. N. Alon and A. Shapira, Every monotone graph property is testable, Proc. of the 37 ACM STOC, Baltimore, ACM Press (2005), to appear.
6. N. Alon and A. Shapira: A Characterization of the (natural) Graph Properties Testable with One-Sided Error, Proc. FOGS 2005, to appear.
7. S. Arora, D. Karger and M. Karpinski: Polynomial time approximation schemes for dense instnces of NP-hard problems, Proc. 27-th ACM STOC (1995), 284-293.
8. C. Borgs, J. Chayes, L. Lovász, V.T. Sós, K. Vesztergombi: Counting graph homomorphisms (preprint).
9. C. Borgs, J. Chayes, L. Lovász, V.T. Sós, K. Vesztergombi: Convergent sequences of dense graphs, Parts I and II (manuscripts).
10. F. Chung, R.L. Graham and U.M. Wilson: Quasi-random graphs, Combinatorica 9 (1989), 345-362.
11. E. Fischer: The art of uninformed decisions: A primer to property testing, The Computational Complexity Column of the Bulletin of the European Association for Theoretical Computer Science 76 (2001), 97-126.
12. A. Frieze and R. Kannan: Quick approximation to matrices and applications, Combinatorica 19, 175-220.
13. O. Goldreich, S. Goldwasser and D. Ron: Property testing and its connection to learning and approximation, J. ACM 45.(1998), 653-750.
14. O. Goldreich and L. Trevisan: Three theorems regarding testing graph properties, Random Structures and Algorithms, 23 (2003), 23-57.
15. L. Lovász and B. Szegedy: Limits of dense graph sequences (MSR Tech Report # MSR-TR-2004-79) ftp://ftp.research.microsoft.com/pub/tr/TR-200479. pdf
16. L. Lovász and B. Szegedy: Graph limits and testing hereditary graph properties, Microsoft Research Technical Report MSR-TR-2005-110, ftp://ftp.research.microsoft.com/pub/tr/TR-2005110.pdf
17. L. Lovász and B. Szegedy: Szemeŕdi's lemma for the analist, http://research.microsoft.com/users/lovasz/analyst.pdf
18. R. Rubinfeld and M. Sudan: Robust characterization of polynomials with applications to program testing, SIAM J. on Computing 25 (1996), 252-271.