Related papers: A New Large N Expansion for General Matrix-Tensor …
Hypergraph neural networks (HGNN) have recently become attractive and received significant attention due to their excellent performance in various domains. However, most existing HGNNs rely on first-order approximations of hypergraph…
We improve the best known lower bounds on the exponential behavior of the maximum of the number of connected sets, $N(G)$, and dominating connected sets, $N_{dom}(G)$, for regular graphs. These lower bounds are improved by constructing a…
We introduce and briefly analyze the rainbow tensor model where all planar diagrams are melonic. This leads to considerable simplification of the large N limit as compared to that of the matrix model: in particular, what are dressed in this…
We prove rigorously that the symmetric traceless and the antisymmetric tensor models in rank three with tetrahedral interaction admit a $1/N$ expansion, and that at leading order they are dominated by melon diagrams. This proves the recent…
We investigate a vectorial O(N) model with a generic nearest-neighbor interaction W(\bsigma_i\cdot \bsigma_j) (depending on {\cal N} tunable parameters), a Yukawa (and Gross Neveu) model with N_f fermions at finite temperature and the…
We studied the leading area term of the entanglement entropy of $\mathcal{N}=1$ supersymmetric $O(N)$ vector model in $2+1$ dimensions close to the line of second order phase transition in the large $N$ limit. We found that the area term is…
We apply a recently developed 1/(N-1) expansion to the full counting statistics for the N-fold degenerate Anderson impurity model in the Kondo regime. This approach is based on the perturbation theory in the Coulomb interaction U and is…
We prove two universality results for random tensors of arbitrary rank D. We first prove that a random tensor whose entries are N^D independent, identically distributed, complex random variables converges in distribution in the large N…
Tensor networks have been an important concept and technique in many research areas, such as quantum computation and machine learning. We study the exponential complexity of contracting tensor networks on two special graph structures:…
Random matrices in the large N expansion and the so-called double scaling limit can be used as toy models for quantum gravity: 2D quantum gravity coupled to conformal matter. This has generated a tremendous expansion of random matrix…
We give a complete description of the genus expansion of the one-cut solution to the generalized Penner model. The solution is presented in a form which allows us in a very straightforward manner to localize critical points and to…
We propose a random matrix model as a representation for $D=1$ open strings. We show that the model is equivalent to $N$ fermions with spin in a central potential that also includes a long-range ferromagnetic interaction between the…
We analyze composed quantum systems consisting of $k$ subsystems, each described by states in the $n$-dimensional Hilbert space. Interaction between subsystems can be represented by a graph, with vertices corresponding to individual…
We explore O(N) models in dimensions $4<d<6$. Specifically, we investigate models of an O(N) vector field coupled to an additional scalar field via a cubic interaction. Recent results in $d=6-\epsilon$ have uncovered an interacting…
Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their…
We reconsider critical properties of O(N) scalar models with cubic interactions in $d>4$ dimensions using functional renormalization group equations. Working at next-to-leading order in the derivative expansion, we find non-trivial IR fixed…
We propose a new neural network framework, termed Neural Network Machine Regression (NNMR), which integrates trainable input gating and adaptive depth regularization to jointly perform feature selection and function estimation in an…
Colored tensor models have been recently shown to admit a large N expansion, whose leading order encodes a sum over a class of colored triangulations of the D-sphere. The present paper investigates in details this leading order. We show…
We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \choose 2}-o(N^2)$ edges, which can be decomposed into…
We study the large-$N$ limit of adjoint fermion one-matrix models. We find one-cut solutions of the loop equations for the correlators of these models and show that they exhibit third order phase transitions associated with $m$-th order…