SearcharxivSearch

arXiv · 1107.3670

Large deviations for cluster size distributions in a continuous classical many-body system

Abstract

An interesting problem in statistical physics is the condensation of classical particles in droplets or clusters when the pair-interaction is given by a stable Lennard-Jones-type potential. We study two aspects of this problem. We start by deriving a large deviations principle for the cluster size distribution for any inverse temperature $β\in (0,\infty)$ and particle density $ρ\in(0,ρ_{\mathrm{cp}})$ in the thermodynamic limit. Here $ρ_{\mathrm{cp}}>0$ is the close packing density. While in general the rate function is an abstract object, our second main result is the $Γ$-convergence of the rate function toward an explicit limiting rate function in the low-temperature dilute limit $β\to \infty$, $ρ\downarrow0$ such that $-β^{-1}\logρ\toν$ for some $ν\in(0,\infty)$. The limiting rate function and its minimisers appeared in recent work, where the temperature and the particle density were coupled with the particle number. In the decoupled limit considered here, we prove that just one cluster size is dominant, depending on the parameter $ν$. Under additional assumptions on the potential, the $Γ$-convergence along curves can be strengthened to uniform bounds, valid in a low-temperature, low-density rectangle.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sabine Jansen, Wolfgang König, Bernd Metzger. 2015-03-17. Large deviations for cluster size distributions in a continuous classical many-body system. https://doi.org/10.1214/14-aap1014

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