Bootstraps to strings: solving random matrix models with positivity
From MaRDI portal
Abstract: A new approach to solving random matrix models directly in the large limit is developed. First, a set of numerical values for some low-pt correlation functions is guessed. The large loop equations are then used to generate values of higher-pt correlation functions based on this guess. Then one tests whether these higher-pt functions are consistent with positivity requirements, e.g., . If not, the guessed values are systematically ruled out. In this way, one can constrain the correlation functions of random matrices to a tiny subregion which contains (and perhaps converges to) the true solution. This approach is tested on single and multi-matrix models and handily reproduces known solutions. It also produces strong results for multi-matrix models which are not believed to be solvable. A tantalizing possibility is that this method could be used to search for new critical points, or string worldsheet theories.
Recommendations
- Bootstrapping the latent roots of certain random matrices
- Bridging positivity and S-matrix bootstrap bounds
- Random string: an explicitly solvable model
- Bootstrapping the O(N ) vector models
- Analytic and numerical bootstrap for one-matrix model and ``unsolvable two-matrix model
- Bootstrapping and Askey-Wilson polynomials
- On random multitraces matrix models
- Random matrix theories and exactly solvable models
- A note on probabilistic models over strings: the linear algebra approach
- S-matrix bootstrap in 3 + 1 dimensions: regularization and dual convex problem
Cites work
- A large-N reduced model as superstring
- Developments in topological gravity
- Formal Matrix Integrals and Combinatorics of Maps
- Loop equations and bootstrap methods in the lattice
- Planar diagrams
- Quantum field theory techniques in graphical enumeration
- Solvable matrix models
- Symmetric vertex models on planar random graphs
- The classical moment problem as a self-adjoint finite difference operator
- The planar approximation. II
- The truncated complex K-moment problem
- The truncated tracial moment problem
- Unitary and complex matrix models as 1-d type 0 strings
Cited in
(44)- Numerical bootstrap in quantum mechanics
- Notes on matrix models (matrix musings)
- Analytic and numerical bootstrap for one-matrix model and ``unsolvable two-matrix model
- Bootstrapping Calabi–Yau quantum mechanics
- Coloured combinatorial maps and quartic bi-tracial 2-matrix ensembles from noncommutative geometry
- Bootstrapping the critical behavior of multi-matrix models
- Analytic trajectory bootstrap for matrix models
- Bootstrapping the O(N ) vector models
- Thermal bootstrap of matrix quantum mechanics
- Gravity as a mesoscopic system
- Feynman integrals from positivity constraints
- Bootstrap for finite N lattice Yang-Mills theory
- Microscopic ensemble bootstrap in phase space
- Bootstrapping the gap in quantum spin systems
- Bootstrapping ground state correlators in matrix theory. I.
- More on holographic correlators: twisted and dimensionally reduced structures
- \( \mathrm{AdS}_3\) wormholes from a modular bootstrap
- Bootstrapping Bloch bands
- Bootstrapping the abelian lattice gauge theories
- Universality of heavy operators in matrix models
- Coarse-grained bootstrap of quantum many-body systems
- Nonequilibrium phase transitions in large N matrix quantum mechanics
- Massive deformations of supersymmetric Yang-Mills matrix models
- From noncommutative geometry to random matrix theory
- Bootstrapping supersymmetric (matrix) quantum mechanics
- Bootstrapping SU(3) lattice Yang-Mills theory
- (Un)solvable matrix models for BPS correlators
- Bootstrap method in harmonic oscillator
- Hidden symmetries and large \(N\) factorisation for permutation invariant matrix observables
- Bootstrap bounds on D0-brane quantum mechanics
- Bootstrapping nonequilibrium stochastic processes
- Ringdown in the SYK model
- Bootstrap bounds on closed Einstein manifolds
- Unify the effect of anharmonicity in double-wells and anharmonic oscillators
- Thermofield theory of large N matrix models
- Goldilocks and the bootstrap
- Resurrecting the coherent state variational algorithm for large N gauge theories
- Matrix bootstrap approximation without positivity constraint
- Bootstrapping shape invariance: numerical bootstrap as a detector of solvable systems
- ``Glueballs in the quantum mechanics of three large massless Yang-Mills coupled matrices
- Bootstrapping more QM systems
- Bootstrapping Dirac ensembles
- Large \(N\) optimization for multi-matrix systems
- The loop equations for noncommutative geometries on quivers
This page was built for publication: Bootstraps to strings: solving random matrix models with positivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q783904)
