arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.06009math.PRcs.DMmath.FA
收藏

随机游动和置换的熵不等式

Entropy inequalities for random walks and permutations

Alexandre Bristiel, Pietro Caputo

摘要:

我们考虑一个新的函数不等式控制相对熵衰减率的随机游动,交换过程和更一般的块型动力学的排列。该不等式介于经典的对数Sobolev不等式和修正的对数Sobolev不等式之间,随着块的大小的增加,该不等式大致介于两者之间。我们的结果表明,新的不等式可能有一些优势,后者众所周知的不等式时,考虑多粒子过程。我们证明了一个强大的形式张量独立粒子通过同步更新相互作用。此外,对于块动态排列,我们计算在所有平均场设置的最佳常数,即每当块的更新速率只取决于块的大小。一路上,我们建立了独立的光谱间隙的粒子数为这些平均场过程。作为熵不等式的一个应用,我们证明了置换的一个新的次可加性估计,它包含了任意非负矩阵的积和式的一个精确的上界,从而解决了一个著名的猜想.

英文摘要:

We consider a new functional inequality controlling the rate of relative entropy decay for random walks, the interchange process and more general block-type dynamics for permutations. The inequality lies between the classical logarithmic Sobolev inequality and the modified logarithmic Sobolev inequality, roughly interpolating between the two as the size of the blocks grows. Our results suggest that the new inequality may have some advantages with respect to the latter well known inequalities when multi-particle processes are considered. We prove a strong form of tensorization for independent particles interacting through synchronous updates. Moreover, for block dynamics on permutations we compute the optimal constants in all mean field settings, namely whenever the rate of update of a block depends only on the size of the block. Along the way we establish the independence of the spectral gap on the number of particles for these mean field processes. As an application of our entropy inequalities we prove a new subadditivity estimate for permutations, which implies a sharp upper bound on the permanent of arbitrary matrices with nonnegative entries, thus resolving a well known conjecture.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑