A short proof of the equivalence of left and right convergence for sparse graphs

• Published in: European journal of combinatorics 2016-04, Vol.53, p.1-7
• Main Author: Lovász, László Miklós
• Format: Article
• Language: English
• ISSN: 0195-6698; 1095-9971
• DOI: 10.1016/j.ejc.2015.10.009

There are several notions of convergence for sequences of bounded degree graphs. One such notion is left convergence, which is based on counting neighborhood distributions. Another notion is right convergence, based on counting homomorphisms to a (weighted) target graph. Borgs, Chayes, Kahn and Lovász showed that a sequence of bounded degree graphs is left convergent if and only if it is right convergent for certain target graphs H with all weights (including loops) close to 1. We give a short alternative proof of this statement. In particular, for each bounded degree graph G we associate functions fG,k for every positive integer k, and we show that left convergence of a sequence of graphs is equivalent to the convergence of the partial derivatives of each of these functions at the origin, while right convergence is equivalent to pointwise convergence. Using the bound on the maximum degree of the graphs, we can uniformly bound the partial derivatives at the origin, and show that the Taylor series converges uniformly on a domain independent of the graph, which implies the equivalence.