MCMC with strings and branes: The suburban algorithm (Extended Version)

DOI10.1142/S0217751X17501330zbMath1372.81131arXiv1605.05334MaRDI QIDQ5367510

Ben Vigoda, Jonathan J. Heckman, Jeffrey G. Bernstein

Publication date: 13 October 2017

Published in: International Journal of Modern Physics A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.05334

zbMATH Keywords

Markov chain Monte Carlostring theorystatistical inferencebranes

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) String and superstring theories; other extended objects (e.g., branes) in quantum field theory (81T30)

Related Items (1)

MCMC with strings and branes: The suburban algorithm (Extended Version)

Uses Software

• Dimple

Cites Work

• Ensemble samplers with affine invariance
• Statistical approach to quantum field theory. An introduction
• Equi-energy sampler with applications in statistical inference and statistical mechanics
• Conformal field theory
• Weak convergence and optimal scaling of random walk Metropolis algorithms
• Slice sampling. (With discussions and rejoinder)
• A First Course in String Theory
• Equation of State Calculations by Fast Computing Machines
• MCMC with strings and branes: The suburban algorithm (Extended Version)
• Monte Carlo sampling methods using Markov chains and their applications

This page was built for publication: MCMC with strings and branes: The suburban algorithm (Extended Version)