惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

D
DataBreaches.Net
IT之家
IT之家
The Cloudflare Blog
Apple Machine Learning Research
Apple Machine Learning Research
WordPress大学
WordPress大学
N
Netflix TechBlog - Medium
阮一峰的网络日志
阮一峰的网络日志
P
Proofpoint News Feed
L
LangChain Blog
博客园 - Franky
美团技术团队
J
Java Code Geeks
Microsoft Security Blog
Microsoft Security Blog
博客园 - 叶小钗
小众软件
小众软件
Y
Y Combinator Blog
B
Blog RSS Feed
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
D
Docker
Hugging Face - Blog
Hugging Face - Blog
Jina AI
Jina AI
罗磊的独立博客
大猫的无限游戏
大猫的无限游戏
Vercel News
Vercel News

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Anticoncentration and Berry--Esseen bounds for random ten...
Pandelis Dodos, Konstantinos Tyros · 2022-05-02 · via math.CO updates on arXiv.org

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