Homomorphism density explained

In the mathematical field of extremal graph theory, homomorphism density with respect to a graph

H is a parameter t(H, - ) that is associated to each graph G in the following manner:t(H,G): = (\left|\operatorname{hom)/((H,G)\right|}{|V(G)|) ^{|V(H)|} }.

Above,

\operatorname{hom}(H,G) is the set of graph homomorphisms, or adjacency preserving maps, from H to G . Density can also be interpreted as the probability that a map from the vertices of H to the vertices of G chosen uniformly at random is a graph homomorphism.^[1] There is a connection between homomorphism densities and subgraph densities, which is elaborated on below.^[2]

Examples

• The edge density of a graph

G is given by t(K _{2} ,G) .

• The number of walks with

k -1 steps is given by \operatorname{hom}(P _{k,} G) .\operatorname{hom}(C _{k,} G) = \operatorname{Tr}(A ^{k)} where A is the adjacency matrix of G .

• The proportion of colorings using

k colors that are proper is given by t(G, K _{k)} .Other important properties such as the number of stable sets or the maximum cut can be expressed or estimated in terms of homomorphism numbers or densities.

Subgraph densities

We define the (labeled) subgraph density of

H in G to bed(H,G): = (\# labeledcopiesof H in G)/(|V(G)| ^{|V(H)|}) .

Note that it might be slightly dubious to call this a density, as we are not quite dividing through by the total number of labeled subgraphs on

|V(H)| vertices of G , but our definition is asymptotically equivalent and simpler to analyze for our purposes. Observe that any labeled copy of H in G corresponds to a homomorphism of H into G . However, not every homomorphism corresponds to a labeled copy − there are some degenerate cases, in which multiple vertices of H are sent to the same vertex of G . That said, the number of such degenerate homomorphisms is only O(n ^{|V(H)|-1} ) , so we have t(H,G) = d(H,G) + O( 1 /n) . For instance, we see that for graphs with constant homomorphism density, the labeled subgraph density and homomorphism density are asymptotically equivalent. For H being a complete graph K _{m} , the homomorphism density and subgraph density are in fact equal (for G without self-loops), as the edges of K _{m} force all images under a graph homomorphism to be distinct.

Generalization to graphons

The notion of homomorphism density can be generalized to the case where instead of a graph

G , we have a graphon W ,t(H,W) = \int _{[ 0 , 1 ] ^{|V(H)|}} \prod _{ij\in} W(x _{i} ,x _{j} )\prod _{i\in} dx _{i}

Note that the integrand is a product that runs over the edges in the subgraph

H , whereas the differential is a product running over the vertices in H . Intuitively, each vertex i in H is represented by the variable x _{i} . For example, the triangle density in a graphon is given by t(K _{3,} W) = \int\limits _{[ 0 , 1 ] ^{3}} W(x,y)W(y,z)W(z,x) dx dy dz .

This definition of homomorphism density is indeed a generalization, because for every graph

G and its associated step graphon W _{G} , t(H,G) = t(H,W _{G} ) .

The definition can be further extended to all symmetric, measurable functions

W . The following example demonstrates the benefit of this further generalization. Relative to the function W(x,y) = 2 \cos( 2 \pi(x - y)) , the density of H in W is the number of Eulerian cycles in H .

This notion is helpful in understanding asymptotic behavior of homomorphism densities of graphs which satisfy certain property, since a graphon is a limit of a sequence of graphs.

Inequalities

Many results in extremal graph theory can be described by inequalities involving homomorphism densities associated to a graph. The following are a sequence of examples relating the density of triangles to the density of edges.

Turan's Theorem

A classic example is Turán's Theorem, which states that if

t(K _{r} ,W) =0 , then t(K _{2} ,W) \leq \left( 1- (1)/(r -1) \right) . A special case of this is Mantel's Theorem, which states that if t(K _{3} ,W) =0 , then t(K _{2} ,W)\leq 1 / 2 .

Goodman's Theorem

An extension of Mantel's Theorem provides an explicit lower bound on triangle densities in terms of edge densities.^[3]

Theorem (Goodman).

t(K _{3,} G) \geq t(K _{2,} G)( 2 t(K _{2,} G) - 1 ).

Kruskal-Katona Theorem

A converse inequality to Goodman's Theorem is a special case of Kruskal–Katona theorem, which states that

t(K _{3,} G) \leq t(K _{2,} G) ^{3/2} . It turns out that both of these inequalities are tight for specific edge densities.

Proof. It is sufficient to prove this inequality for any graph

G . Say G is a graph on n vertices, and \{ λ _{i} \} ^{n} _{i =1} are the eigenvalues of its adjacency matrix A _{G} . By spectral graph theory, we know\operatorname{hom}(K _{2} ,G) = t(K _{2} ,G)|V(G)| ^{2} = \sum ^{n} _{i =1} λ ^{2} _{i} , and \operatorname{hom}(K _{3} ,G) = t(K _{3} ,G)|V(G)| ^{3} = \sum ^{n} _{i =1} λ ^{3} _{i} .

The conclusion then comes from the following inequality:

\operatorname{hom}(K _{3} ,G) = \sum ^{n} _{i =1} λ ^{3} _{i} \leq\left(\sum ^{n} _{i =1} λ ^{2} _{i} \right) ^{3/2} = \operatorname{hom}(K _{2} ,G) ^{3/2} .

Description of triangle vs edge density

A more complete description of the relationship between

t(K _{3,} G) and t(K _{2,} G) was proven by Razborov. His work from 2008 completes the understanding of a homomorphism inequality problem, the description of D _{2,3} , which is the region of feasible edge density, triangle density pairs in a graphon.^[4]

D _{2,3} = \{(t(K _{2} ,W),t(K _{3} ,W)) : W isagraphon \}\subseteq [ 0 , 1 ] ^{2} .

The upper boundary of the region is tight and given by the Kruskal-Katona Theorem. The lower boundary is main result of work by Razborov in providing a complete description.

Useful tools

Cauchy-Schwarz

One particularly useful inequality to analyze homomorphism densities is the Cauchy–Schwarz inequality. The effect of applying the Cauchy-Schwarz inequality is "folding" the graph over a line of symmetry to relate it to a smaller graph. This allows for the reduction of densities of large but symmetric graphs to that of smaller graphs. As an example, we prove that the cycle of length 4 is Sidorenko. If the vertices are labelled 1,2,3,4 in that order, the diagonal through vertices 1 and 3 is a line of symmetry. Folding over this line relates

C _{4} to the complete bipartite graph K _{1,2} . Mathematically, this is formalized as \begin{align} t(C _{4,} G) & = \int _{1,2,3,4} W( 1 , 2 )W( 2 , 3 )W( 3 , 4 )W( 1 , 4 ) = \int _{1,3} \left(\int _{2} W( 1 , 2 )W( 2 , 3 )\right)\left(\int _{4} W( 1 , 4 )W( 4 , 3 )\right) = \int _{1,3} \left(\int _{2} W( 1 , 2 )W( 2 , 3 )\right) ^{2} \\ &\geq \left(\int _{1,2,3} W( 1 , 2 )W( 2 , 3 )\right) ^{2} = t(K _{1,2} , G) ^{2 \end{align}}

where we applied Cauchy-Schwarz to "fold" vertex 2 onto vertex 4. The same technique can be used to show

t(K _{1,2} , G) \geq t(K _{2,} G) ^{2} , which combined with the above verifies that C _{4} is a Sidorenko graph.

The generalization Hölder's inequality can also be used in a similar manner to fold graphs multiple times with a single step. It is also possible to apply the more general form of Cauchy-Schwarz to fold graphs in the case that certain edges lie on the line of symmetry.

Lagrangian

The Lagrangian can be useful in analyzing extremal problems. The quantity is defined to be

L(H) = max _{\begin{matrix} x _{1,} \ldots, x _{n} \geq 0 \ x _{1} + … x _{n} = 1 \end{matrix} } \sum _{e} \prod _{v} x _{v} .

One useful fact is that a maximizing vector

x is equally supported on the vertices of a clique in H . The following is an application of analyzing this quantity.

According to Hamed Hatami and Sergei Norine, one can convert any algebraic inequality between homomorphism densities to a linear inequality. In some situations, deciding whether such an inequality is true or not can be simplified, such as it is the case in the following theorem.

Theorem (Bollobás). Let

a _{1} , … ,a _{n} be real constants. Then, the inequality\sum ^{n} _{i =1} a _{i} t(K _{i} ,G)\geq 0

holds for every graph

G if and only if it holds for every complete graph K _{m} .^[5]

However, we get a much harder problem, in fact an undecidable one, when we have a homomorphism inequalities on a more general set of graphs

H _{i} :

Theorem (Hatami, Norine). Let a _{1} , … ,a _{n} be real constants, and \{H _{i} \} ^{n} _{i =1} graphs. Then, it is an undecidable problem to determine whether the homomorphism density inequality\sum ^{n} _{i =1} a _{r} t(H _{i} ,G)\geq 0

holds for every graph

G .

A recent observation^[6] proves that any linear homomorphism density inequality is a consequence of the positive semi-definiteness of a certain infinite matrix, or to the positivity of a quantum graph; in other words, any such inequality would follow from applications of the Cauchy-Schwarz Inequality.

See also

• Common graph
• Sidorenko's conjecture

Notes and References

1. Borgs . Christian. Chayes . Jennifer T.. Lovász . László . László Lovász. Sós . Vera T . Vera Sós. Vestergombi . Katalin. 2008. Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing. Advances in Mathematics. 219. 6. 1801–1851. 10.1016/j.aim.2008.07.008. free. math/0702004.
2. Hatami, H., Norine, S.. 2011. Undecidability of linear inequalities in graph homomorphism densities.. Journal of the American Mathematical Society. 24. 2. 553. 10.1090/S0894-0347-2010-00687-X. 3363894. MathSciNet. 1005.2382.
3. Book: Lovász, László. Large networks and graph limits. 2012. 978-0-8218-9085-1. Providence, Rhode Island. 812530987.
4. Razborov. Alexander. 2008. On the minimal density of triangles in graphs.. Combinatorics, Probability and Computing. 17. 4. 603–618. 10.1017/S0963548308009085. MathSciNet (AMS). 26524353.
5. Book: Bollobás, Bela. Combinatorics: Set systems, hypergraphs, families of vectors and combinatorial probability.. Cambridge University Press. 1986. 0-521-33059-9. Cambridge. 79-84.
6. Freedman, M., Lovász, L., Schrijver, A.. 2007. Reflection Positivity, Rank connectivity, and Homomorphism of Graphs. Journal of the American Mathematical Society. 20. 1. 1.