Annals of Mathematics· 2012Q1
Convergent sequences of dense graphs II. Multiway cuts and statistical physics
- 317citations
- Q1SCImago
- 2012year
Short summary
This paper introduces and formalizes two new notions of graph convergence: 'left-convergence' and 'right-convergence', based on homomorphism densities into sequences of dense graphs.
AI-generated from the title and abstract; the full text is not read.
Key points
- Introduces 'left-convergence' based on homomorphism densities from small graphs into graph sequences.
- Introduces 'right-convergence' based on homomorphism densities from graph sequences into small graphs.
- Focuses on sequences of dense graphs.
- Provides formal definitions for these new convergence notions.
AI-generated from the title and abstract; the full text is not read.
Abstract
We consider sequences of graphs (Gn) and define various notions of convergence related to these sequences including "left-convergence," defined in terms of the densities of homomorphisms from small graphs into Gn, and "right-convergence," defined in terms of the densities of homomorphisms from Gn into small graphs.
The authors' abstract, as published at the source. Annals of Mathematics, 2012 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Discrete Mathematics and Combinatorics
Discrete Mathematics and CombinatoricsMathematics