Journal
JOURNAL OF HIGH ENERGY PHYSICS
Volume -, Issue 12, Pages -Publisher
SPRINGER
DOI: 10.1007/JHEP12(2017)001
Keywords
Random Systems; Stochastic Processes; Lattice QCD; AdS-CFT Correspondence
Categories
Funding
- JSPS KAKENHI [16K05321, JP17J08709]
- Grants-in-Aid for Scientific Research [16K05321, 17J08709] Funding Source: KAKEN
Ask authors/readers for more resources
For a given Markov chain Monte Carlo algorithm we introduce a distance between two configurations that quantifies the difficulty of transition from one configuration to the other configuration. We argue that the distance takes a universal form for the class of algorithms which generate local moves in the configuration space. We explicitly calculate the distance for the Langevin algorithm, and show that it certainly has desired and expected properties as distance. We further show that the distance for a multimodal distribution gets dramatically reduced from a large value by the introduction of a tempering method. We also argue that, when the original distribution is highly multimodal with large number of degenerate vacua, an anti-de Sitter-like geometry naturally emerges in the extended configuration space.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available