CosmoPMC: Cosmology Population Monte Carlo
release_rnzxcgi5djajjoycapvpw2qkwe
by
Martin Kilbinger, Karim Benabed, Olivier Cappe, Jean-Francois Cardoso,
Jean Coupon, Gersende Fort, Henry J. McCracken, Simon Prunet, Christian P.
Robert, Darren Wraith
2012
Abstract
We present the public release of the Bayesian sampling algorithm for
cosmology, CosmoPMC (Cosmology Population Monte Carlo). CosmoPMC explores the
parameter space of various cosmological probes, and also provides a robust
estimate of the Bayesian evidence. CosmoPMC is based on an adaptive importance
sampling method called Population Monte Carlo (PMC). Various cosmology
likelihood modules are implemented, and new modules can be added easily. The
importance-sampling algorithm is written in C, and fully parallelised using the
Message Passing Interface (MPI). Due to very little overhead, the wall-clock
time required for sampling scales approximately with the number of CPUs. The
CosmoPMC package contains post-processing and plotting programs, and in
addition a Monte-Carlo Markov chain (MCMC) algorithm. The sampling engine is
implemented in the library pmclib, and can be used independently. The software
is available for download at http://www.cosmopmc.info.
In text/plain
format
Archived Files and Locations
application/pdf 560.3 kB
file_nxcvhqgz6nh77mx7cdai7vm77i
|
arxiv.org (repository) web.archive.org (webarchive) |
application/pdf 560.3 kB
file_adby22u555df3m56jgv3ugznbe
|
archive.org (archive) |
1101.0950v3
access all versions, variants, and formats of this works (eg, pre-prints)