2018
DOI: 10.1007/s10955-018-2195-6
|View full text |Cite
|
Sign up to set email alerts
|

Simulating Coulomb and Log-Gases with Hybrid Monte Carlo Algorithms

Abstract: Coulomb and log-gases are exchangeable singular Boltzmann-Gibbs measures appearing in mathematical physics at many places, in particular in random matrix theory. We explore experimentally an efficient numerical method for simulating such gases. It is an instance of the Hybrid or Hamiltonian Monte Carlo algorithm, in other words a Metropolis-Hastings algorithm with proposals produced by a kinetic or underdamped Langevin dynamics. This algorithm has excellent numerical behavior despite the singular interaction, … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
21
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 12 publications
(22 citation statements)
references
References 78 publications
1
21
0
Order By: Relevance
“…The Kolmogorov-Smirnov distances [35] between the empirical distributions of the spectrum of L, and each of these curves (after fitting β) are listed in Table I. The spacings for the Coulomb gas are obtained by generating points with the distribution (4) by using the Metropolis algorithm, following [36], and then determining the spacing numerically. Fig.…”
mentioning
confidence: 99%
“…The Kolmogorov-Smirnov distances [35] between the empirical distributions of the spectrum of L, and each of these curves (after fitting β) are listed in Table I. The spacings for the Coulomb gas are obtained by generating points with the distribution (4) by using the Metropolis algorithm, following [36], and then determining the spacing numerically. Fig.…”
mentioning
confidence: 99%
“…Moreover, our problem is made harder by the singularity of the pair interaction in the Hamiltonian (1.9). It is known that Hybrid Monte Carlo schemes (relying on a second order discretization of an underdamped Langevin dynamics with a Metropolis-Hastings acceptance rule) provide efficient methods for sampling such probability distributions, see [11] and references therein. An issue when combining a Metropolis-Hastings rule with a projection on a submanifold is that reversibility may be lost, which introduces a bias.…”
Section: Description Of the Algorithm The Description Of The Constramentioning
confidence: 99%
“…Let us mention that the long time convergence of the law of this process towards P n (a difficult problem due to the singularity of the Hamiltonian) can be proved through Lyapunov function techniques, see [38] for a recent account. In practice, the singularity of g also makes the numerical integration of (4.10) difficult, and a Metropolis-Hastings selection rule can be used to stabilize the numerical discretization, see [11] and references therein. The algorithm described below makes precise how to adapt this strategy to sample measures constrained to the submanifold M.…”
Section: Constrained Langevin Dynamicsmentioning
confidence: 99%
See 1 more Smart Citation
“…The case λ < 1 is useless since Lemma 1.1 tells us in this case that Z n = ∞. We used the algorithm from [17] with dt=.5 and T=10e6. About 10 independent copies were simulated and merged and we retained only the last 10% the trajectories.…”
Section: Lemma 11 (Confinement or Integrability Condition) We Havementioning
confidence: 99%