SearcharxivSearch

arXiv · 1907.05803

Coulomb gases under constraint: some theoretical and numerical results

Abstract

We consider Coulomb gas models for which the empirical measure typically concentrates, when the number of particles becomes large, on an equilibrium measure minimizing an electrostatic energy. We study the behavior when the gas is conditioned on a rare event. We first show that the special case of quadratic confinement and linear constraint is exactly solvable due to a remarkable factorization, and that the conditioning has then the simple effect of shifting the cloud of particles without deformation. To address more general cases, we perform a theoretical asymptotic analysis relying on a large deviations technique known as the Gibbs conditioning principle. The technical part amounts to establishing that the conditioning ensemble is an I-continuity set of the energy. This leads to characterizing the conditioned equilibrium measure as the solution of a modified variational problem. For simplicity, we focus on linear statistics and on quadratic statistics constraints. Finally, we numerically illustrate our predictions and explore cases in which no explicit solution is known. For this, we use a Generalized Hybrid Monte Carlo algorithm for sampling from the conditioned distribution for a finite but large system.

Explore related subjects

Keep this discovery

BibTeXRIS

Djalil Chafaï, Grégoire Ferré, Gabriel Stoltz. 2019-07-12. Coulomb gases under constraint: some theoretical and numerical results. https://doi.org/10.1137/19m1296859

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR