2017
DOI: 10.1142/s0217751x17501330
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: Motivated by the physics of strings and branes, we develop a class of Markov chain Monte Carlo (MCMC) algorithms involving extended objects. Starting from a collection of parallel Metropolis-Hastings (MH) samplers, we place them on an auxiliary grid, and couple them together via nearest neighbor interactions. This leads to a class of "suburban samplers" (i.e., spread out Metropolis). Coupling the samplers in this way modifies the mixing rate and speed of convergence for the Markov chain, and can in many cases … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 26 publications
0
3
0
Order By: Relevance
“…This is related to the broader question of how well a low energy observer can ever hope to reconstruct a given UV completion, see, e.g.,[14,[40][41][42][43][44] as well as[45][46][47][48][49][50][51][52].…”
mentioning
confidence: 99%
“…This is related to the broader question of how well a low energy observer can ever hope to reconstruct a given UV completion, see, e.g.,[14,[40][41][42][43][44] as well as[45][46][47][48][49][50][51][52].…”
mentioning
confidence: 99%
“…The second order expansion in θ i of the KL divergence then yields the Fisher information metric which forms the basis for information geometry [9,10]. (See [11][12][13][14][15][16][17][18][19][20][21][22] for contemporary appearances of the information metric in statistical inference and its relevance to quantum field theory and string theory. )…”
Section: Introductionmentioning
confidence: 99%
“…On general grounds, one might ask to what extent a set of IR observables can serve to constrain the content of some candidate UV completion (see e.g. [5][6][7][8][9][10] as well as [11][12][13][14][15][16][17]). This issue is also of general interest in trying to understand the extent to which information is lost in passing from short to long distance scales.…”
Section: Introductionmentioning
confidence: 99%