Multiple scaling limits of \(\mathrm{U} (N)^2 \times \mathrm{O} (D)\) multi-matrix models (Q2159583)

From MaRDI portal





scientific article; zbMATH DE number 7565693
Language Label Description Also known as
default for all languages
No label defined
    English
    Multiple scaling limits of \(\mathrm{U} (N)^2 \times \mathrm{O} (D)\) multi-matrix models
    scientific article; zbMATH DE number 7565693

      Statements

      Multiple scaling limits of \(\mathrm{U} (N)^2 \times \mathrm{O} (D)\) multi-matrix models (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      1 August 2022
      0 references
      Summary: We study the double- and triple-scaling limits of a complex multi-matrix model, with \(\mathrm{U} (N)^2 \times \mathrm{O} (D)\) symmetry. The double-scaling limit amounts to taking simultaneously the large-\(N\) (matrix size) and large-\(D\) (number of matrices) limits while keeping the ratio \(N / \sqrt{D} = M\) fixed. The triple-scaling limit consists in taking the large-\(M\) limit while tuning the coupling constant \(\lambda\) to its critical value \(\lambda_c\) and keeping fixed the product \(M (\lambda_c - \lambda)^\alpha\), for some value of \(\alpha\) that depends on the particular combinatorial restrictions imposed on the model. Our first main result is the complete recursive characterization of the Feynman graphs of arbitrary genus which survive in the double-scaling limit. Next, we classify all the dominant graphs in the triple-scaling limit, which we find to have a plane binary tree structure with decorations. Their critical behavior belongs to the universality class of branched polymers. Lastly, we classify all the dominant graphs in the triple-scaling limit under the restriction to three-edge connected (or two-particle irreducible) graphs. Their critical behavior falls in the universality class of Liouville quantum gravity (or, in other words, the Brownian sphere).
      0 references
      matrix models
      0 references
      large-\(N\) limit
      0 references
      classification and enumeration of graphs
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references