homomorphism density

[[concept]]
homomorphism density

Let G=(V,E) and F=(V,E) be graphs. The homomorphism density from F to G, denoted t(F,G) is given as

t(F,G)=hom(F,G)|V||V|

Where hom(F,G) is the the total number of homomorphisms from F to G.

We can think of this as the probability of sampling a version of F from the graph G.
^def

Mentions

File
convergent graph sequence
convergent sequence of graph signals
eigenvalues of the induced graphon converge pointwise to the eigenvalues of the limit
graph sequence converges if and only if the induced graphon sequence converges
graphon homomorphism density
2025-03-03 graphs lecture 11
2025-03-24 graphs lecture 14
2025-03-26 lecture 15
2025-03-31 lecture 16