On the Computation of Multidimensional Integrals by the Monte-Carlo Method
From MaRDI portal
Cited in
(15)- On the Bayesian calibration of computer model mixtures through experimental data, and the design of predictive models
- Hit and run as a unifying device
- Random sampling: billiard walk algorithm
- Asymptotic analysis of noisy fitness maximization, applied to metabolism \& growth
- Simple conditions for metastability of continuous Markov chains
- Hit and Run Sampling from Tropically Convex Sets
- Nested sampling methods
- Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
- Investigation of feasible and marginal operating regimes of electric power systems
- Randomized methods based on new Monte Carlo schemes for control and optimization
- Accelerated convergence in Hit-and-Run Monte Carlo and a coordinate-free randomized Kaczmarz algorithm
- Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
- Hit-and-run mixing via localization schemes
- On the _0 isoperimetric coefficient for measurable sets
- Gibbs sampling, exponential families and orthogonal polynomials
This page was built for publication: On the Computation of Multidimensional Integrals by the Monte-Carlo Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5672059)