稀疏图极限、熵最大化与传递图
Sparse graph limits, entropy maximization and transitive graphs
摘要:
本文描述了图极限、信息论和群论之间的三重对应。我们提出了一个新的图极限概念,称为对数收敛,它与稠密图极限密切相关,但它的主要应用是稀疏图序列的研究。我们提出了一个信息论极限的概念$k$ -元组的随机变量,是基于联合分布的随机变量的边缘分布系统的熵最大化问题。我们给出了一个富有成效的对应关系的两个极限概念,具有群论性质。我们的应用是在图论和信息论。我们表明,如果$H$是一个二部图,$P_1$是边缘和$t$是同态密度函数,然后$\log t(H,G)/\log t(P_1,G)$的上确界的所有图的集合$G$是相同的,在一组图的边缘和顶点传递。这一结果给出了一个群论方法Sidorenko的著名猜想。我们得到了关于熵最大化问题的信息论不等式。我们研究了稀疏随机图的极限,并在我们的框架中讨论了拟随机性。
英文摘要:
In this paper we describe a triple correspondence between graph limits, information theory and group theory. We put forward a new graph limit concept called log-convergence that is closely connected to dense graph limits but its main applications are in the study of sparse graph sequences. We present an information theoretic limit concept for $k$-tuples of random variables that is based on the entropy maximization problem for joint distributions of random variables where a system of marginal distributions is prescribed. We give a fruitful correspondence between the two limit concepts that has a group theoretic nature. Our applications are in graph theory and information theory. We shows that if $H$ is a bipartite graph, $P_1$ is the edge and $t$ is the homomorphism density function then the supremum of $\log t(H,G)/\log t(P_1,G)$ in the set of all graphs $G$ is the same as in the set of graphs that are both edge and vertex transitive. This result gives a group theoretic approach to Sidorenko's famous conjecture. We obtain information theoretic inequalities regarding the entropy maximization problem. We investigate the limits of sparse random graphs and discuss quasi-randomness in our framework.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。