Pith. sign in

REVIEW 1 cited by

Melonic dominance and the largest eigenvalue of a large random tensor

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.11220 v2 pith:IW6T5UIH submitted 2020-03-25 math-ph hep-thmath.MPmath.PRmath.SP

Melonic dominance and the largest eigenvalue of a large random tensor

classification math-ph hep-thmath.MPmath.PRmath.SP
keywords randomtensordimensionseigenvalueensemblelargelargestnumber
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We consider a Gaussian rotationally invariant ensemble of random real totally symmetric tensors with independent normally distributed entries, and estimate the largest eigenvalue of a typical tensor in this ensemble by examining the rate of growth of a random initial vector under successive applications of a nonlinear map defined by the random tensor. In the limit of a large number of dimensions, we observe that a simple form of melonic dominance holds, and the quantity we study is effectively determined by a single Feynman diagram arising from the Gaussian average over the tensor components. This computation suggests that the largest tensor eigenvalue in our ensemble in the limit of a large number of dimensions is proportional to the square root of the number of dimensions, as it is for random real symmetric matrices.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum estimates for classical polynomial optimization

    math-ph 2026-07 conditional novelty 5.0

    A quantum-variational matrix method is proposed for bounding homogeneous polynomials, with converging numerical tensor-eigenvalue estimates and a new conjectured inequality for Biasi's resonant Hamiltonians.