Fetching the paper…
Reading the bibliography…
In the last decade it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks: separable elements, with connections (or interactions) between certain pairs of them.
B. Bollobas, O. Riordan: Sparse graphs: metrics and random models, http://arxiv.org/abs/0708.1919
1919
Earlier work this paper cites.
H. Whitney: The coloring of graphs, Ann. of Math
1932
Earlier work this paper cites.
P. Erdös, A. Rényi: On random graphs I, Publ. Math. Debrecen
1959
Earlier work this paper cites.
E.N. Gilbert: Random graphs, Ann. Math. Stat
1959
Earlier work this paper cites.
A.W. Goodman: On sets of aquaintences and strangers at any party, Amer. Math. Monthly
1959
Earlier work this paper cites.
J.W. Moon, L. Moser: Mat. Kut. Int. Közl
1962
Earlier work this paper cites.
G.R. Blakley and P.A. Roy: A Hölder type inequality for symmetric matrices with nonnegative entries, Proc. Amer. Math. Soc
1965
Earlier work this paper cites.
A. Pultr: Isomorphism types of objects in categories determined by numbers of morphisms, Acta Sci. Math. Szeged
1973
Earlier work this paper cites.
B. Bollobás: Relations between sets of complete subgraphs, in: Combinatorics
1975
Earlier work this paper cites.
E. Szemerédi: On sets of integers containing no k k elements in arithmetic progression”, Acta Arithmetica
1975
Earlier work this paper cites.
E. Szemerédi: Regular partitions of graphs, Colloque Inter. CNRS
1978
Earlier work this paper cites.
M.-D. Choi: Tricks or Treats with the Hilbert Matrix, Amer. Math. Monthly
1983
Earlier work this paper cites.
A. Thomason: Pseudorandom graphs, in: Random graphs ’85
1987
Earlier work this paper cites.
P. Frankl and J. Pach: An extremal problem on K r K_{r} -free graphs, J. Graph Theory
1988
Earlier work this paper cites.
F. Chung, R.L. Graham and R.M. Wilson: Quasi-random graphs, Combinatorica
1989
Earlier work this paper cites.
F. Chung, R.L. Graham: Quasi-Random Hypergraphs, Proc. Nat. AcadṠci. 86
1989
Earlier work this paper cites.
D.C. Fisher: Lower bounds on the number of triangles in a graph, J. Graph Theory
1989
Earlier work this paper cites.
J. Haviland, A. Thomason: Pseudo-random hypergraphs. Graph theory and combinatorics (Cambridge, 1988). Discrete Math
1989
Earlier work this paper cites.
D.C. Fisher and J. Ryan: Conjectures on the number of complete subgraphs, in: Proc. of the 20-th Southeastern Conf. on Comb., Graph Theory, and Computing
1990
Earlier work this paper cites.
D.C. Fisher and A. Solow: Dependence polynomials, Discrete Math
1990
Earlier work this paper cites.
E. Györi, J. Pach, M. Simonovits: On the maximal number of certain subgraphs in K r K_{r} -free graphs, Graphs and Combin
1991
Earlier work this paper cites.
W.T. Tutte: On the Birkhoff-Lewis equations, Discrete Math
1991
Earlier work this paper cites.
J. Haviland, A. Thomason: On testing the ”pseudo-randomness” of a hypergraph. Discrete Math
1992
Earlier work this paper cites.
A. Sidorenko: A correlation inequality for bipartite graphs, Graphs and Combin
1993
Earlier work this paper cites.
W.T. Tutte: On the matrix of chromatic joins, J. Comb. Theory B
1993
Earlier work this paper cites.
S. Arora, D. Karger and M. Karpinski: Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27-th ACM STOC
1995
Earlier work this paper cites.
J. Komlós and M. Simonovits: Szemerédi’s Regularity Lemma and its applications in graph theory, in: Combinatorics, Paul Erdos is Eighty
1996
Earlier work this paper cites.
R. Rubinfeld and M. Sudan: Robust characterization of polynomials with applications to program testing, SIAM J. on Computing
1996
Earlier work this paper cites.
W.T. Gowers: Lower bounds of tower type for Szemerédi’s Uniformity Lemma, Geom. Func. Anal
1997
Cited alongside, same era.
Y. Kohayakawa: Szemerédi’s regularity lemma for sparse graphs, in: Sel. Papers Conf. Found. of Comp. Math
1997
Cited alongside, same era.
M. Simonovits, V.T. Sós: Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs. Combinatorica
1997
Cited alongside, same era.
D.J. Aldous: Tree-valued Markov chains and Poisson-Galton-Watson distributions, in: Microsurveys in Discrete Probability
1998
Cited alongside, same era.
L. Devroye: Branching processes and their applications in the analysis of tree structures and tree algorithms”, in: Probabilistic Methods for Algorithmic Discrete Mathematics, ed. M. Habib, C. McDiarmid, J. Ramirez-Alfonsin and B. Reed, pp. 249-314, Springer-Verlag, Berlin, 1998
1998
S. Gerke, A. Steger: The sparse regularity lemma and its applications, Surveys in Combinatorics
2005
Later among the works it cites.
L. Lovász, B. Szegedy: Testing properties of graphs and functions, to appear in Isr. J. Math
2005
Later among the works it cites.
R. Lyons: Asymptotic enumeration of spanning trees Combin. Prob. Comput
2005
Later among the works it cites.
N. Alon, E. Fischer, I. Newman and A. Shapira: A Combinatorial Characterization of the Testable Graph Properties: It’s All About Regularity, Proc. of the 38 th \text{38}^{\text{th}} ACM Symp. Theor. of Comp. (STOC)
2006
Later among the works it cites.
N. Alon, A. Naor: Approximating the Cut-Norm via Grothendieck’s Inequality SIAM J. Computing
2006
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
O. Goldreich, S. Goldwasser and D. Ron: Property testing and its connection to learning and approximation, J. ACM
1998
Cited alongside, same era.
M. Gromov: Metric structures for Riemannian and non-Riemannian spaces
1999
Cited alongside, same era.
N. Alon, E. Fischer, M. Krivelevich and M. Szegedy: Efficient testing of large graphs, Combinatorica
2000
Cited alongside, same era.
S. Janson, T. Luczak and A. Ruczynski: Random Graphs
2000
Cited alongside, same era.
I. Benjamini and O. Schramm: Recurrence of Distributional Limits of Finite Planar Graphs, Electronic J. Probab
2001
Cited alongside, same era.
B. Bollobás: Random Graphs
2001
Cited alongside, same era.
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
2001
Cited alongside, same era.
I. Benjamini, G. Kozma, L. Lovász, D. Romik, G. Tardos: Waiting for a bat to fly by (in polynomial time), Combinatorics, Probability and Computing
2006
Later among the works it cites.
C. Borgs, J. Chayes, L. Lovász, V.T. Sós, K. Vesztergombi: Counting graph homomorphisms, in: Topics in Discrete Mathematics
2006
Later among the works it cites.
C. Borgs, J.T. Chayes, L. Lovász, V.T. Sós, B. Szegedy and K. Vesztergombi: Graph Limits and Parameter Testing, Proc. 38th Annual ACM Symp. on Theory of Computing 2006, 261–270
2006
Later among the works it cites.
W.T. Gowers: Quasirandomness, counting and regularity for 3-uniform hypergraphs, Combin. Probab. Comput
2006
Later among the works it cites.
L. Lovász: The rank of connection matrices and the dimension of graph algebras, Eur. J. Comb
2006
Later among the works it cites.
L. Lovász, B. Szegedy: Limits of dense graph sequences, J. Comb. Theory B
2006
Later among the works it cites.
T.C. Tao: Szemerédis regularity lemma revisited, Contrib. Discrete Math
2006
Later among the works it cites.
T.C. Tao: The dichotomy between structure and randomness, arithmetic progressions, and the primes, in: Proc. Intern. Congress of Math
2006
Later among the works it cites.
D. Aldous, R. Lyons: Processes on Unimodular Random Networks, Electron. J. Probab
2007
Later among the works it cites.
G. Elek: On limits of finite graphs, Combinatorica
2007
Later among the works it cites.
M. Freedman, L. Lovász, A. Schrijver: Reflection positivity, rank connectivity, and homomorphisms of graphs, J. Amer. Math. Soc
2007
Later among the works it cites.
W.T. Gowers: Hypergraph regularity and the multidimensional Szemeredi theorem, Annals of Math
2007
Later among the works it cites.
L. Lovász: Connection matrices, in: Combinatorics, Complexity and Chance, A Tribute to Dominic Welsh Oxford Univ. Press (2007), 179–190
2007
Later among the works it cites.
L. Lovász, A. Schrijver: Graph parameters and semigroup functions, European Journal of Combinatorics
2007
Later among the works it cites.
L. Lovász and B. Szegedy: Szemerédi’s Lemma for the analyst, Geom. Func. Anal
2007
Later among the works it cites.
A.A. Razborov: Flag Algebras, Journal of Symbolic Logic
2007
Later among the works it cites.
B. Szegedy: Edge coloring models and reflection positivity, J. Amer. Math. Soc
2007
Later among the works it cites.
N. Alon and A. Shapira: A Characterization of the (natural) Graph Properties Testable with One-Sided Error, SIAM J. Computing
2008
Later among the works it cites.
N. Alon and U. Stav: What is the furthest graph from a hereditary property? Random Struc. Alg
2008
Later among the works it cites.
C. Borgs, J.T. Chayes, L. Lovász, V.T. Sós, and K. Vesztergombi: Convergent Graph Sequences I: Subgraph frequencies, metric properties, and testing, Advances in Math
2008
Later among the works it cites.
L. Lovász, V.T. Sós: Generalized quasirandom graphs, J. Comb. Th. B
2008
Later among the works it cites.
A. Schrijver: Graph invariants in the edge model, in: Building Bridges—Between Mathematics and Computer Science
2008
Later among the works it cites.
A. Schrijver, Tensor subalgebras and first fundamental theorems in invariant theory, Journal of Algebra
2008
Later among the works it cites.