Counting Graph Homomorphisms

Abstract

Counting homomorphisms between graphs (often with weights) comes up in a wide variety of areas, including extremal graph theory, properties of graph products, partition functions in statistical physics and property testing of large graphs.In this paper we survey recent developments in the study of homomorphism numbers, including the characterization of the homomorphism numbers in terms of the semidefiniteness of "connection matrices", and some applications of this fact in extremal graph theory.We define a distance of two graphs in terms of similarity of their global structure, which also reflects the closeness of (appropriately scaled) homomorphism numbers into the two graphs. We use homomorphism numbers to define convergence of a sequence of graphs, and show that a graph sequence is convergent if and only if it is Cauchy in this distance. Every convergent graph sequence has a limit in the form of a symmetric measurable function in two variables. We use these notions of distance and graph limits to give a general theory for parameter testing.The convergence can also be characterized in terms of mappings of the graphs into fixed small graphs, which is strongly connected to important parameters like ground state energy in statistical physics, and to weighted maximum cut problems in computer science.

Web Science: Understanding the Emergence of Macro-Level Features on the World Wide Web

“…Google's PageRank functions with a giant sample (c. 10%) of the Web, but a more complex algorithm would typically require a smaller sample where bias will be more of an issue. Borgs et al [60,61] have developed a graphical theory of limits, defined via graph homomorphisms, which allows the estimation of properties of large graphs, such as finding the approximate value of a parameter with associated probability, or determining whether the graph has a certain property. The limit property defined in this way has been shown to be equivalent to other well-known definitions of limits [57,62,63].…”

Moments of Two-Variable Functions and the Uniqueness of Graph Limits

“…The notion of convergent graph sequences was introduced by Borgs, Chayes, Lovász, Sós and Vesztergombi [2], see also [3], and further studied in [4] and [5]. Lovász and Szegedy [11] proved that every convergent graph sequence has a "limit object" in the form of a function W ∈ W 0 in the sense that t(F, G n ) −→ t(F, W ) as n → ∞…”

Coarse-graining the Dynamics of Network Evolution: The Rise and Fall of a Networked Society

“…This would require the definition of a useful metric quantifying the distance between nearby graphs (see e.g. [23,24]). …”