Related papers: $O(N)$ Random Tensor Models
We first give a short intrinsic, diagrammatic proof of the First Fundamental Theorem of invariant theory (FFT) for the special orthogonal group $\text{SO}_m(\mathbb{C})$, given the FFT for $\text{O}_m(\mathbb{C})$. We then define, by means…
We construct a two-tensor model with order-3 and present its $W$-representation. Moreover we derive the compact expressions of correlators from the $W$-representation and analyze the free energy in large $N$ limit. In addition, we establish…
We present some approaches to the perturbative analysis of the classical and quantum gravity. First we introduce a graphical representation for a global SO(n) tensor $(\pl)^d h_\ab$, which generally appears in the weak field expansion…
In this paper we consider self-dual NRT-codes, that is, self-dual codes in the metric space endowed with the Niederreiter-Rosenbloom-Tsfasman (NRT-metric). We use polynomial invariant theory to describe the shape enumerator of a binary…
We study the O(N) loop model on the Honeycomb lattice with real value $N \geq 1$ by means of a cluster algorithm. The formulation of the algorithm is based on the equivalence of the O(N) loop model and the low-temperature graphical…
A SYK--like model close to the colored tensor models has recently been proposed \cite{Witten:2016iux}. Building on results obtained in tensor models \cite{GurSch}, we discuss the complete $1/N$ expansion of the model. We detail the two and…
1. Introduction 2. The Gross-Neveu Model 3. QCD 3.1 N-Counting Rules for Diagrams 3.1.1 U(1) Ghosts 3.2 The 't Hooft Model 3.3 $N$-Counting Rules for Correlation Functions 3.4 The Master Field 4. Meson Phenomenology 4.1 Zweig's Rule 4.2…
We study models of weighted exponential random graphs in the large network limit. These models have recently been proposed to model weighted network data arising from a host of applications including socio-econometric data such as migration…
In this article we report a preliminary investigation of the large $N$ limit of a generalized one-matrix model which represents an $O(n)$ symmetric model on a random lattice. The model on a regular lattice is known to be critical only for…
Statistical models corresponding to a new class of braid matrices ($\hat{o}_N; N\geq 3$) presented in a previous paper are studied. Indices labeling states spanning the $N^r$ dimensional base space of $T^{(r)}(\theta)$, the $r$-th order…
We simplify, to a single integral of dilogarithms, the least tractable O(1/N^3) contribution to the large-N critical exponent $\eta$ of the non-linear sigma-model, and hence $\phi^4$-theory, for any spacetime dimensionality, D. It is the…
We define several new types of quantum chromatic numbers of a graph and characterise them in terms of operator system tensor products. We establish inequalities between these chromatic numbers and other parameters of graphs studied in the…
In this paper we present a quantum algorithm solving the triangle finding problem in unweighted graphs with query complexity $\tilde O(n^{5/4})$, where $n$ denotes the number of vertices in the graph. This improves the previous upper bound…
In the last few years the derivative expansion of the Non-Perturbative Renormalization Group has proven to be a very efficient tool for the precise computation of critical quantities. In particular, recent progress in the understanding of…
It is shown that classical spaces with geometries emerge on boundaries of randomly connected tensor networks with appropriately chosen tensors in the thermodynamic limit. With variation of the tensors, the dimensions of the spaces can be…
We introduce a very general model of an inhomogenous random graph with independence between the edges, which scales so that the number of edges is linear in the number of vertices. This scaling corresponds to the p=c/n scaling for G(n,p)…
This article studies large $N$ limits of a coupled system of $N$ interacting $\Phi^4$ equations posed over $\mathbb{T}^{d}$ for $d=2$, known as the $O(N)$ linear sigma model. Uniform in $N$ bounds on the dynamics are established, allowing…
The statistical mechanics of spin models, such as the Ising or Potts models, on generic random graphs can be formulated economically by considering the N --> 1 limit of Hermitian matrix models. In this paper we consider the N --> 1 limit in…
A combination of direct and inverse Fourier transforms on the unitary group $U(N)$ identifies normalized characters with probability measures on $N$-tuples of integers. We develop the $N\to\infty$ version of this correspondence by matching…
This paper systematically studies the behavior of the leading eigenvectors for independent edge undirected random graphs generated from a general latent position model whose link function is possibly infinite rank and also possibly…