Anticoncentration and Berry–Esseen bounds for random tensors

نویسندگان

چکیده

We obtain estimates for the Kolmogorov distance to appropriately chosen gaussians, of linear functions $$\begin{aligned} \sum _{i\in [n]^d} \theta _i X_i \end{aligned}$$ random tensors $$\varvec{X}=\langle X_i:i\in [n]^d\rangle $$ which are symmetric and exchangeable, whose entries have bounded third moment vanish on diagonal indices. These expressed in terms intrinsic (and easily computable) parameters associated with tensor $$\varvec{X}$$ given coefficients $$\langle _i:i\in , they optimal various regimes. The key ingredient—which is independent interest—is a combinatorial CLT high-dimensional provides quantitative non-asymptotic normality under suitable conditions, statistics form _{(i_1,\dots ,i_d)\in \varvec{\zeta }\big (i_1,\dots ,i_d,\pi (i_1),\dots ,\pi (i_d)\big ) where $$\varvec{\zeta }:[n]^d\times [n]^d\rightarrow \mathbb {R}$$ deterministic real tensor, $$\pi permutation uniformly distributed group $$\mathbb {S}_n$$ . Our results extend, any dimension d, classical work Bolthausen who covered one-dimensional case, more recent Barbour/Chen treated two-dimensional case.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arithmetic Expanders and Deviation Bounds for Sums of Random Tensors

We prove hypergraph variants of the celebrated Alon–Roichman theorem on spectral expansion of sparse random Cayley graphs. One of these variants implies that for every odd prime p and any ε > 0, there exists a set of directions D ⊆ Fp of size Op,ε(p (1−1/p+o(1))n) such that for every set A ⊆ Fp of density α, the fraction of lines in A with direction in D is within εα of the fraction of all line...

متن کامل

A Bounds for block sparse tensors

A Bounds for block sparse tensors One of the main bounds to control is the spectral norm of the sparse perturbation tensor S. The success of the power iterations and the improvement in accuracy of recovery over iterative steps of RTD requires this bound.

متن کامل

Random Tensors and Planted Cliques

The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinct vertices. For r = 2, it is the adjacency matrix with 1’s for edges and −1’s for nonedges. It is well-known that the 2-norm of the adjacency matrix of a random graph is O( √ n). Here we show that the 2-norm of the r-par...

متن کامل

Random Tensors and Quantum Gravity

We provide an informal introduction to tensor field theories and to their associated renormalization group. We focus more on the general motivations coming from quantum gravity than on the technical details. In particular we discuss how asymptotic freedom of such tensor field theories gives a concrete example of a natural “quantum relativity” postulate: physics in the deep ultraviolet regime be...

متن کامل

Random Invariant Tensors

Youning Li, 2, ∗ Muxin Han, 4 Dong Ruan, 2 and Bei Zeng 6, 7 Department of Physics, Tsinghua University, Beijing, People’s Republic of China Collaborative Innovation Center of Quantum Matter, Beijing 100190, People’s Republic of China Department of Physics, Florida Atlantic University, FL 33431, USA Institut für Quantengravitation, Universität Erlangen-Nürnberg, Staudtstr. 7/B2, 91058 Erlangen,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Probability Theory and Related Fields

سال: 2023

ISSN: ['0178-8051', '1432-2064']

DOI: https://doi.org/10.1007/s00440-023-01211-x