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

@article{Borgs2007ConvergentSO,
title={Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing},
author={Christian Borgs and Jennifer T. Chayes and L{\'a}szl{\'o} Mikl{\'o}s Lov{\'a}sz and Vera T. S{\'o}s and Katalin Vesztergombi},
year={2007},
volume={219},
pages={1801-1851}
}
• Published 31 January 2007
• Mathematics
563 Citations
• Mathematics
• 2012
We consider sequences of graphs (Gn) and dene various notions of convergence related to these sequences including \left-convergence," dened in terms of the densities of homomorphisms from small
We consider sequences of large graphs which have certain convergent graph parameters. Many important graph parameters like the edge density may be represented asymptotically as homomorphism
• Mathematics, Computer Science
Random Struct. Algorithms
• 2017
This paper introduces a new notion of convergence of sparse graphs, which it is called Large Deviations or LD‐convergence, and which is based on the theory of large deviations, and establishes several previously unknown relationships between the other notions of convergence.
• Mathematics
Random Struct. Algorithms
• 2010
The convergence of the spectrum of large random graphs to the Spectrum of a limit infinite graph is analyzed and a new formula for the Stieljes transform of the spectral measure of such graphs is derived.
• Mathematics, Computer Science
• 2014
It is proved that even in this refined sense, the limit of a convergent graph sequence (with uniformly bounded degree) can be represented by a graphing.
• Mathematics
Internet Math.
• 2012
It is shown that the kernel is monotone (i.e., increasing in both variables) if and only if the sequence satisfies a “quasimonotonicity” property defined by a certain functional tending to zero.
• Computer Science, Mathematics
ESAIM: Control, Optimisation and Calculus of Variations
• 2020
The problem of subdividing a large graph in communities with a minimal amount of cuts can be approached in terms of graphons and the Γ-limit of the cut functional, and the resulting variational principles can be used to obtain insights into the bisection problem for large graphs, known to be NP-complete.
• Mathematics, Computer Science
• 2022
A measure–theoretic representation of matrices is introduced, and it is shown that such pseudo-metric is a metric on the subspace of adjacency or Laplacian matrices for graphs, thereby obtaining a metric for isomorphism classes of graphs.

## References

SHOWING 1-10 OF 56 REFERENCES

• Mathematics
STOC '06
• 2006
We define a distance of two graphs that reflects the closeness of both local and global properties. We also define convergence of a sequence of graphs, and show that a graph sequence is convergent if
• Mathematics
J. Comb. Theory, Ser. B
• 2006
• Mathematics
• 1978
Let H be a finite graph on v vertices . We define a function CH , with domain the set of all finite graphs, by letting cH(G) denote the fraction of subgraphs of G on v vertices isomorphic to H. Our
• Mathematics
• 1979
Let H be a finite graph on v vertices . We define a function CH , with domain the set of all finite graphs, by letting cH(G) denote the fraction of subgraphs of G on v vertices isomorphic to H. Our
• R. Lyons
• Mathematics, Computer Science
Combinatorics, Probability and Computing
• 2005
It is shown that tree entropy is a logarithm of a normalized determinant of the graph Laplacian for infinite graphs, which is also expressed using random walks.
• Mathematics
• 2008
AbstractFor a symmetric bounded measurable function W on [0, 1]2 and a simple graph F, the homomorphism density $$t(F,W) = \int _{[0,1]^{V (F)}} \prod_ {i j\in E(F)} W(x_i, x_j)dx .$$ can be thought
• Mathematics
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
• 1999
This theorem is used to prove that first order graph properties not containing a quantifier alternation of type "/spl forall//spl exist/" are always testable, while it is shown that some properties containing this alternation are not.
Abstract : A crucial lemma in recent work of the author (showing that k-term arithmetic progression-free sets of integers must have density zero) stated (approximately) that any large bipartite graph
• Mathematics, Computer Science
STOC '06
• 2006
One of the main open problems in the area of property-testing, which was raised in the 1996 paper of Goldreich, Goldwasser and Ron, is resolved by a purely combinatorial characterization of the graph properties that are testable with a constant number of queries.
• Mathematics, Computer Science
STOC '05
• 2005
It is shown that any monotone graph property can be tested with one-sided error, and with query complexity depending only on ε, and this result implies the testability of well-studied graph properties that were previously not known to be testable.