$O(N)$ Random Tensor Models
Sylvain Carrozza, Adrian Tanasa

TL;DR
This paper introduces a new class of $O(N)$ invariant tensor models with a large $N$ expansion, analyzing their critical behavior and identifying leading and next-to-leading order graphs using combinatorics techniques.
Contribution
It defines a novel class of tensor models with $O(N)^{ imes 3}$ invariance, establishes their large $N$ expansion, and analyzes their critical properties at leading and NLO.
Findings
Existence of a large $N$ expansion for the model.
Identification of leading and NLO graphs.
Computation of critical exponents at both orders.
Abstract
We define in this paper a class of three indices tensor models, endowed with invariance ( being the size of the tensor). This allows to generate, via the usual QFT perturbative expansion, a class of Feynman tensor graphs which is strictly larger than the class of Feynman graphs of both the multi-orientable model (and hence of the colored model) and the invariant models. We first exhibit the existence of a large expansion for such a model with general interactions. We then focus on the quartic model and we identify the leading and next-to-leading order (NLO) graphs of the large expansion. Finally, we prove the existence of a critical regime and we compute the critical exponents, both at leading order and at NLO. This is achieved through the use of various analytic combinatorics techniques.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
