An information theoretic approach to Sidorenko's conjecture
Combinatorics
2015-01-27 v3 Probability
Abstract
We investigate the famous conjecture by Erd\H os-Simonovits and Sidorenko using information theory. Our method gives a unified treatment for all known cases of the conjecture and it implies various new results as well. Our topological type conditions allow us to extend Sidorenko's conjecture to large families of -uniform hypergraphs. This is somewhat unexpected since the conjecture fails for uniform hypergraphs in general.
Cite
@article{arxiv.1406.6738,
title = {An information theoretic approach to Sidorenko's conjecture},
author = {Balazs Szegedy},
journal= {arXiv preprint arXiv:1406.6738},
year = {2015}
}