Skip to content
Preprint

Spectral aspects of random heavy-tailed tensors

Jul 2026 · 0 citations · 24 references
Mathematics

Abstract

We investigate heavy-Wigner tensors: symmetric random tensors whose independent entries, up to the tensor symmetries, are centered and have moments of order $N^{-(p-1)}$, where $N$ is the tensor dimension. This framework includes normalized adjacency tensors of sparse Erd\H{o}s-R\'enyi hypergraphs and truncated heavy-tailed tensor models. We study trace invariants, a complete family of polynomial invariants under permutations of the tensor indices. We prove that, after the natural normalization, the only non-vanishing asymptotic contributions are those associated with fat hypertrees, and we derive a central limit theorem for these injective trace invariants. As applications, we first analyze Erd\H{o}s-R\'enyi $p$-uniform hypergraphs with edge probability $\alpha_N=c/N^{p-1}$. We prove local weak convergence to a uniform Galton-Watson hypertree with Poisson offspring distribution. We also prove convergence of the empirical spectral distribution of the matrix obtained by contracting the adjacency tensor; in the sparse regime the limiting law depends on the sparsity parameter $c$ and has unbounded support, while in the regime $N^{p-1}\alpha_N\to\infty$ with $N^{p-1}(1-\alpha_N)\to\infty$, the limiting spectral distribution is the semicircle law. This result generalizes for matrices obtained by contracting an arbitrary heavy-Wigner tensor and we derive an explicit formula for the moments of the limiting spectral measure.

View source

Similar papers

Preprint Aug 2026

Width Laws and Spectral Geometry

We develop a common framework for random width laws, spectral populations, and geometric reconstruction. For a $d$-dimensional orthotope, we prove an exact parity law for the maximal $\pi^{-1}$-grade of every spherical width cumulant, including noncancellation and sign in all dimensions and orders. The first $d$ scalar...

Omri Abas · 0 citations
Preprint Aug 2026

A Tight Analysis of Khatri-Rao Oblivious Subspace Embeddings

It is proved that sketching dimension m = O(k^{3/2}/\epsilon^2) suffices for subspace embedding with a Khatri-Rao sketching matrix with any fixed order $d$.

Lorenzo Beretta, Cameron Musco · 1 citation
Preprint Sep 2026

LDP for Tensor Forms

In this paper, we study the large deviation principle (LDP) for a tensor-weighted functional of i.i.d. random variables, when the sequence of tensors converges under a variant of the"bad"cut norm. Using the LDP, we analyze a Gibbs measure with a tensor-valued Hamiltonian, and characterize the optimizers of the limiting...

Reihaneh Malekian, Sohom Bhattacharya, Nabarun Deb et al. · 0 citations
Preprint Aug 2026

The Resultant Distribution Method: Universality for $p$-adic Random Matrices and Polynomials

We prove universality of limiting local eigenvalue statistics for random matrices over $\mathbb{Z}_p$. In previous work of the author and Van Peski (arXiv:2601.06283), the limiting eigenvalue correlation functions of additive Haar random matrices were studied in arbitrary finite extensions of $\mathbb{Q}_p$. The same H...

Jiahe Shen · 0 citations
Preprint Sep 2026

Robust dimension-free estimation of simple random tensors: optimal guarantees under heavy tails and adversarial contamination

We study robust estimation of simple random tensors of arbitrary order $q\in\mathbb{N}$ under finite-moment assumptions and adversarial contamination. We propose the first robust estimator achieving near-optimal dimension-free statistical rates in this setting. The estimator attains the near-optimal corruption rate whe...

R. Oliveira, Zoraida F. Rico, Philip Thompson · 0 citations
Preprint Sep 2026

Finite-rank multiplicative perturbations of rotationally invariant non-Hermitian random matrices

We study finite-rank multiplicative deformations of rotationally invariant non-Hermitian random matrices. More precisely, we consider models of the form $\mathbf{A}(\mathbf{I}+\mathbf{T})$, where $\mathbf{A}$ is a large rotationally invariant non-Hermitian random matrix, $\mathbf{T}$ is a finite-rank normal perturbatio...

Pierre Bousseyroux, Marc Potters · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.