弱膨胀图上的Lipschitz函数
Lipschitz functions on weak expanders
AI总结:
本文研究了弱膨胀图上的$M$-Lipschitz函数,证明了在放宽膨胀条件和更大$M$值下,随机函数仍具有小波动,部分回答了Peled等人的问题,并采用图容器方法和熵方法作为技术手段。
摘要:
给定一个连通有限图$G$,$V(G)$上的整数值函数$f$被称为$M$-Lipschitz的,如果$f$的值沿$G$的边的变化至多为$M$。2013年,Peled、Samotij和Yehudayoff证明了在具有足够好膨胀性的图上,随机$M$-Lipschitz函数通常表现出小的波动,并在$M$不太大的假设下,给出了此类函数典型范围的精确界限。我们证明了在放宽的膨胀条件和更大的$M$下,相同的结论仍然成立,(部分)回答了Peled等人的问题。我们的技术结合了Sapozhenko的图容器方法和信息论中的熵方法。
英文摘要:
Given a connected finite graph $G$, an integer-valued function $f$ on $V(G)$ is called $M$-Lipschitz if the value of $f$ changes by at most $M$ along the edges of $G$. In 2013, Peled, Samotij, and Yehudayoff showed that random $M$-Lipschitz functions on graphs with sufficiently good expansion typically exhibit small fluctuations, giving sharp bounds on the typical range of such functions, assuming $M$ is not too large. We prove that the same conclusion holds under a relaxed expansion condition and for larger $M$, (partially) answering questions of Peled et al. Our techniques involve a combination of Sapozhenko's graph container methods and entropy methods from information theory.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。