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

具有独立条目的矩阵谱范数上限

Spectral norm of matrices with independent entries up to polyloglog

University of Warsaw(华沙大学);Institute of Mathematics, University of Warsaw(华沙大学数学研究所)

Rafał Meller

AI总结:

本文研究了具有独立条目的随机矩阵的谱范数上限,推导出一个基于迭代对数的上界,支持了Latala和Swiatkowski的猜想。

摘要:

本文研究了在假设随机变量(X_{ij})独立、对称且满足矩增长条件||X_{ij}||_{2p} <= C ||X_{ij}||_{p}(对于每个p >= 1)的情况下,随机矩阵(a_{ij} X_{ij})的算子范数的期望。我们推导出一个上界,该上界可以以许多情况下可以显式计算的量来表达。这个上界意味着一个双侧估计,其因子由一个迭代对数的幂给出。这个因子比问题的自然尺度要小得多。我们的结果因此提供了对Rafal Latala和Jan Swiatkowski所提出的猜想的积极证据。

英文摘要:

In this paper, we study the expectation of the operator norm of the random matrix (a_{ij} X_{ij}) for i,j <= n, under the assumption that the random variables (X_{ij}) are independent, symmetric and satisfy the moment growth condition ||X_{ij}||{2p} <= C ||X_{ij}||{p} for every p >= 1. We derive an upper bound expressed in terms of quantities that can be explicitly computed in many cases. This bound implies a two-sided estimate, up to a factor given by a power of an iterated logarithm. This factor is considerably smaller than the natural scale of the problem. Our result thus provides positive evidence supporting a conjecture formulated by Rafal Latala and Jan Swiatkowski.

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

↑