Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing

[1]  C. Borgs,et al.  Moments of Two-Variable Functions and the Uniqueness of Graph Limits , 2008, 0803.1244.

[2]  B. Szegedy,et al.  Szemerédi’s Lemma for the Analyst , 2007 .

[3]  Noga Alon,et al.  A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.

[4]  László Lovász,et al.  Graph limits and parameter testing , 2006, STOC '06.

[5]  V. Sós,et al.  Counting Graph Homomorphisms , 2006 .

[6]  László Lovász,et al.  Limits of dense graph sequences , 2004, J. Comb. Theory B.

[7]  P. Valtr,et al.  Topics in Discrete Mathematics , 2006 .

[8]  László Lovász,et al.  Graph limits and testing hereditary graph properties , 2005 .

[9]  Eldar Fischer,et al.  Testing versus estimation of graph properties , 2005, STOC '05.

[10]  Noga Alon,et al.  Every monotone graph property is testable , 2005, STOC '05.

[11]  Béla Bollobás,et al.  Mathematical results on scale‐free random graphs , 2005 .

[12]  Amin Saberi,et al.  On the spread of viruses on the internet , 2005, SODA '05.

[13]  R. Lyons.  Asymptotic Enumeration of Spanning Trees , 2002, Combinatorics, Probability and Computing.

[14]  Noga Alon,et al.  Approximating the cut-norm via Grothendieck's inequality , 2004, STOC '04.

[15]  Béla Bollobás,et al.  The Diameter of a Scale-Free Random Graph , 2004, Comb..

[16]  Béla Bollobás,et al.  Directed scale-free graphs , 2003, SODA '03.

[17]  Noga Alon,et al.  Random sampling and approximation of MAX-CSP problems , 2002, STOC '02.

[18]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

[19]  Eli Upfal,et al.  Stochastic models for the Web graph , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[20]  O. Cohen.  Recurrence of Distributional Limits of Finite Planar Graphs , 2000 .

[21]  Noga Alon,et al.  Efficient Testing of Large Graphs , 2000, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[22]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[23]  Alan M. Frieze,et al.  Quick Approximation to Matrices and Applications , 1999, Comb..

[24]  W. T. Gowers,et al.  Lower bounds of tower type for Szemerédi's uniformity lemma , 1997 .

[25]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[26]  Fan Chung Graham,et al.  Quasi-random graphs , 1988, Comb..

[27]  A. Thomason.  Pseudo-Random Graphs , 1987 .

[28]  W. T. Tutte,et al.  Graph theory and related topics , 1979 .

[29]  P. Erdos,et al.  Strong Independence of Graphcopy Functions , 1979 .

[30]  J. Spencer,et al.  Strong independence of graph copy functions , 1978 .

[31]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[32]  W. Rudin.  Real and complex analysis , 1968 .