Left and right convergence of graphs with bounded degree. Issue 1 (4th April 2012)

• Record Type: Journal Article
• Authors: Borgs, Christian; Chayes, Jennifer; Kahn, Jeff; Lovász, László
• Is Part Of: Random structures & algorithms. Volume 42:Issue 1(2013)
• Page Start: 1
• Page End: 28
• Publication Date: 2012-04-04
• Subjects: Random graphs -- Periodicals; Mathematical analysis -- Periodicals; 519
• DOI: 10.1002/rsa.20414
• Languages: English
• ISSNs: 1042-9832

Abstract

<abstract abstract-type="main" xml:lang="en"> <title>Abstract</title> <p>The theory of convergent graph sequences has been worked out in two extreme cases, dense graphs and bounded degree graphs. One can define convergence in terms of counting homomorphisms from fixed graphs into members of the sequence (left‐convergence), or counting homomorphisms into fixed graphs (right‐convergence). Under appropriate conditions, these two ways of defining convergence was proved to be equivalent in the dense case by Borgs, Chayes, Lovász, Sós and Vesztergombi. In this paper a similar equivalence is established in the bounded degree case, if the set of graphs in the definition of right‐convergence is appropriately restricted.</p> <p>In terms of statistical physics, the implication that left convergence implies right convergence means that for a left‐convergent sequence, partition functions of a large class of statistical physics models converge. The proof relies on techniques from statistical physics, like cluster expansion and Dobrushin Uniqueness. © 2012 Wiley Periodicals, Inc. Random Struct. 2012</p> </abstract>