Related papers: The Large D Limit of Planar Diagrams
Recently developed methods for PT-symmetric models can be applied to quantum-mechanical matrix and vector models. In matrix models, the calculation of all singlet wave functions can be reduced to the solution a one-dimensional PT-symmetric…
K-Theory for hermitian symmetric spaces of non-compact type, as developed recently by the authors, allows to put Cartan's classification into a homological perspective. We apply this method to the case of inductive limits of finite…
In the present paper we propose generalizations of the regularity and counting lemmas for multidimensional matrices under a finite alphabet. Firstly, we prove a variant of a multidimensional regularity lemma with the help of a translation…
The melonic limit is a relatively new type of large-$N$ limit, differing from the much older and well-known large-$N$ limits of vector and matrix field theories, which are dominated by cactus and planar Feynman diagrams, respectively. The…
In this talk we go over several new developments regarding the techniques for a large class of non-hermitian matrix models with unitary randomness (complex random numbers). In particular, we discuss: (a) - A diagrammatic approach based on a…
We review one dimensional matrix theory and its variations, collective field theory and quantum phase space description. In the planar limit, these theories become classical and can be easily analyzed. With these descriptions, one…
It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show…
A non-Hermitean random matrix model proposed a few years ago has a remarkably intricate spectrum. Various attempts have been made to understand the spectrum, but even its dimension is not known. Using the Dyson-Schmidt equation, we show…
We provide upper bounds on the perturbation of invariant subspaces of normal matrices measured using a metric on the space of vector subspaces of $\mathbb{C}^n$ in terms of the spectrum of both the unperturbed \& perturbed matrices, as well…
Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…
A law of large numbers and a central limit theorem are derived for linear statistics of random symmetric matrices whose on-or-above diagonal entries are independent, but neither necessarily identically distributed, nor necessarily all of…
$O(N)$ invariant vector models have been shown to possess non-trivial scaling large $N$ limits, at least perturbatively within the loop expansion, a property they share with matrix models of 2D quantum gravity. In contrast with matrix…
The process of alternately row scaling and column scaling a positive $n \times n$ matrix $A$ converges to a doubly stochastic positive $n \times n$ matrix $S(A)$, called the \emph{Sinkhorn limit} of $A$. Exact formulae for the Sinkhorn…
One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic…
This paper is concerned with the asymptotic behavior of the free energy for a class of Hermitean random matrix models, with odd degree polynomial potential, in the large N limit. It continues an investigation initiated and developed in a…
Colored tensor models generalize matrix models in arbitrary dimensions yielding a statistical theory of random higher dimensional topological spaces. They admit a 1/N expansion dominated by graphs of spherical topology. The simplest tensor…
$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…
We study largest singular values of large random matrices, each with mean of a fixed rank $K$. Our main result is a limit theorem as the number of rows and columns approach infinity, while their ratio approaches a positive constant. It…
We consider the sum of dichromatic polynomials over non-separable rooted planar maps, an interesting special case of which is the enumeration of such maps. We present some known results and derive new ones. The general problem is equivalent…
Let $L$ be a finite extension of the rational function field over a finite field $\mathbb{F}_q$ and $E$ be a Drinfeld module defined over $L$. Given finitely many elements in $E(L)$, this paper aims to prove that linear relations among…