Graph norms and Sidorenko's conjecture
Hamed Hatami

TL;DR
This paper characterizes when graph homomorphism functions form norms, proves a H"older inequality criterion, verifies Sidorenko's conjecture for certain graphs, and explores the Banach space properties of these norms.
Contribution
It provides a complete characterization of graphs for which the homomorphism-based functions are norms, proves a H"older inequality criterion, and verifies Sidorenko's conjecture for specific graph classes.
Findings
h_H(·)^{1/m} is a norm iff a H"older type inequality holds for H
Verified Sidorenko's conjecture for hypercubes and related graphs
Determined moduli of smoothness and convexity of the norms
Abstract
Let and be two finite graphs. Define to be the number of homomorphisms from to . The function extends in a natural way to a function from the set of symmetric matrices to such that for , the adjacency matrix of a graph , we have . Let be the number of edges of . It is easy to see that when is the cycle of length , then is the -th Schatten-von Neumann norm. We investigate a question of Lov\'{a}sz that asks for a characterization of graphs for which the function is a norm. We prove that is a norm if and only if a H\"{o}lder type inequality holds for . We use this inequality to prove both positive and negative results, showing that is a norm for certain classes of graphs, and giving some necessary conditions on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Advanced Graph Theory Research
