A profile likelihood analysis of the constrained MSSM with genetic algorithms
From MaRDI portal
Publication:367795
DOI10.1007/JHEP04(2010)057zbMATH Open1272.81204arXiv0910.3950MaRDI QIDQ367795FDOQ367795
Authors: Yashar Akrami, Pat Scott, Joakim Edsjö, Lars Bergström, Jan O. Conrad 
Publication date: 16 September 2013
Published in: Journal of High Energy Physics (Search for Journal in Brave)
Abstract: The Constrained Minimal Supersymmetric Standard Model (CMSSM) is one of the simplest and most widely-studied supersymmetric extensions to the standard model of particle physics. Nevertheless, current data do not sufficiently constrain the model parameters in a way completely independent of priors, statistical measures and scanning techniques. We present a new technique for scanning supersymmetric parameter spaces, optimised for frequentist profile likelihood analyses and based on Genetic Algorithms. We apply this technique to the CMSSM, taking into account existing collider and cosmological data in our global fit. We compare our method to the MultiNest algorithm, an efficient Bayesian technique, paying particular attention to the best-fit points and implications for particle masses at the LHC and dark matter searches. Our global best-fit point lies in the focus point region. We find many high-likelihood points in both the stau co-annihilation and focus point regions, including a previously neglected section of the co-annihilation region at large m_0. We show that there are many high-likelihood points in the CMSSM parameter space commonly missed by existing scanning techniques, especially at high masses. This has a significant influence on the derived confidence regions for parameters and observables, and can dramatically change the entire statistical inference of such scans.
Full work available at URL: https://arxiv.org/abs/0910.3950
Recommendations
- Challenges of profile likelihood evaluation in multi-dimensional SUSY scans
- Investigating multiple solutions in the constrained minimal supersymmetric standard model
- Fast supersymmetry phenomenology at the large hadron collider using machine learning techniques
- A coverage study of the CMSSM based on ATLAS sensitivity using fast neural networks techniques
- Supersymmetry without prejudice
Bayesian inference (62F15) Supersymmetric field theories in quantum mechanics (81T60) Unified quantum theories (81V22)
Cites Work
- SOFTSUSY: A program for calculating supersymmetric spectra
- \texttt{HiggsBounds}: confronting arbitrary Higgs sectors with exclusion bounds from LEP and the Tevatron
- Title not available (Why is that?)
- Nested sampling for general Bayesian computation
- A supersymmetry primer
- Genetic Algorithms and Genetic Programming
- Soft supersymmetry-breaking terms from supergravity and superstring models.
- A global optimization method for Landau gauge fixing in lattice QCD
- \textit{FeynHiggs}: A program for the calculation of the masses of the neutral \({\mathcal C}P\)-even Higgs bosons in the MSSM
- Weak scale supersymmetry. From superfields to scattering events.
- Evolutionary algorithms applied to Landau-gauge fixing
- Effective Lagrangian approach to pion photoproduction from the nucleon
- Introduction to Fuzzy Logic using MATLAB
- The search for black hole binaries using a genetic algorithm
- Supersymmetry in Particle Physics
- Genetic algorithm for SU(\(N\)) gauge theory on a lattice
- The dark side of mSUGRA
- Evolutionary fitting methods for the extraction of mass spectra in lattice field theory
Cited In (12)
- An information theoretic exploration of constrained MSSM
- Searching the landscape of flux vacua with genetic algorithms
- Testing the ΛCDM paradigm with growth rate data and machine learning
- Investigating multiple solutions in the constrained minimal supersymmetric standard model
- Exploring supersymmetry with machine learning
- Constraints on the distance duality relation with standard sirens
- Challenges of profile likelihood evaluation in multi-dimensional SUSY scans
- A coverage study of the CMSSM based on ATLAS sensitivity using fast neural networks techniques
- A systematic approach to Kähler moduli stabilisation
- A robust and efficient algorithm to find profile likelihood confidence intervals
- Machine learning meets the redshift evolution of the CMB temperature
- Data science applications to string theory
Uses Software
This page was built for publication: A profile likelihood analysis of the constrained MSSM with genetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367795)
