Use of the MultiNest algorithm for gravitational wave data analysis

Classical and Quantum Gravity (Impact Factor: 3.1). 04/2009; DOI: 10.1088/0264-9381/26/21/215003
Source: arXiv

ABSTRACT We describe an application of the MultiNest algorithm to gravitational wave data analysis. MultiNest is a multimodal nested sampling algorithm designed to efficiently evaluate the Bayesian evidence and return posterior probability densities for likelihood surfaces containing multiple secondary modes. The algorithm employs a set of live points which are updated by partitioning the set into multiple overlapping ellipsoids and sampling uniformly from within them. This set of live points climbs up the likelihood surface through nested iso-likelihood contours and the evidence and posterior distributions can be recovered from the point set evolution. The algorithm is model-independent in the sense that the specific problem being tackled enters only through the likelihood computation, and does not change how the live point set is updated. In this paper, we consider the use of the algorithm for gravitational wave data analysis by searching a simulated LISA data set containing two non-spinning supermassive black hole binary signals. The algorithm is able to rapidly identify all the modes of the solution and recover the true parameters of the sources to high precision. Comment: 18 pages, 4 figures, submitted to Class. Quantum Grav; v2 includes various changes in light of referee's comments

  • [Show abstract] [Hide abstract]
    ABSTRACT: We present a parameter estimation procedure based on a Bayesian framework by applying a Markov Chain Monte Carlo algorithm to the calibration of the dynamical parameters of the LISA Pathfinder satellite. The method is based on the Metropolis-Hastings algorithm and a two-stage annealing treatment in order to ensure an effective exploration of the parameter space at the beginning of the chain. We compare two versions of the algorithm with an application to a LISA Pathfinder data analysis problem. The two algorithms share the same heating strategy but with one moving in coordinate directions using proposals from a multivariate Gaussian distribution, while the other uses the natural logarithm of some parameters and proposes jumps in the eigen-space of the Fisher Information matrix. The algorithm proposing jumps in the eigen-space of the Fisher Information matrix demonstrates a higher acceptance rate and a slightly better convergence towards the equilibrium parameter distributions in the application to LISA Pathfinder data. For this experiment, we return parameter values that are all within ∼1σ of the injected values. When we analyse the accuracy of our parameter estimation in terms of the effect they have on the force-per-unit of mass noise, we find that the induced errors are three orders of magnitude less than the expected experimental uncertainty in the power spectral density.
    Experimental Astronomy 02/2014; 37(1). · 2.66 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We present a newly developed version of BayeSED, a general Bayesian approach to the spectral energy distribution (SED) fitting of galaxies. The new BayeSED code has been systematically tested on a mock sample of galaxies. The comparison between estimated and inputted value of the parameters show that BayeSED can recover the physical parameters of galaxies reasonably well. We then applied BayeSED to interpret the SEDs of a large Ks-selected sample of galaxies in the COSMOS/UltraVISTA field with stellar population synthesis models. With the new BayeSED code, a Bayesian model comparison of stellar population synthesis models has been done for the first time. We found that the model by Bruzual & Charlot (2003), statistically speaking, has larger Bayesian evidence than the model by Maraston (2005) for the Ks-selected sample. Besides, while setting the stellar metallicity as a free parameter obviously increases the Bayesian evidence of both models, varying the IMF has a notable effect only on the Maraston (2005) model. Meanwhile, the physical parameters estimated with BayeSED are found to be generally consistent with those obtained with the popular grid-based FAST code, while the former exhibits more natural distributions. Based on the estimated physical parameters of galaxies in the sample, we qualitatively classified the galaxies in the sample into five populations that may represent galaxies at different evolution stages or in different environments. We conclude that BayeSED could be a reliable and powerful tool for investigating the formation and evolution of galaxies from the rich multi-wavelength observations currently available. A binary version of MPI parallelized BayeSED code is publicly available at
    The Astrophysical Journal Supplement Series 08/2014; 215(1). · 14.14 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Bayesian inference is usually divided into two categories: parameter estimation and model selection. Parameter estimation is mostly performed using Markov Chain Monte Carlo (MCMC) sampling methods, most often based on the standard Metropolis-Hastings algorithm or its variants, such as slice, Gibbs' and Hamiltonian sampling. These methods can be highly inefficient in exploring multi-modal distributions or ones exhibiting degeneracies between parameters. Moreover, in order to perform Bayesian model selection, estimation of Bayesian evidence is needed which is by definition, a (possibly high dimensional) integration over the entire parameter space. Unfortunately, the computational expense involved in the evaluation of Bayesian evidence is typically an order of magnitude higher than doing the parameter estimation. In this paper, we discuss some techniques, built around the nested sampling framework, that have been developed to efficiently calculate the Bayesian evidence. We also discuss applications of Bayesian evidence in astrophysics and particle physics, in problems involving model selection, source detection, consistency checks between different data-sets, multi-model inference and in determining the constraining power of different observables.
    Proceedings of the 2013 IEEE 13th International Conference on Data Mining Workshops; 12/2013

Full-text (2 Sources)

Available from
May 26, 2014