SearcharxivSearch

arXiv · 1405.5241

Harmonic pinnacles in the Discrete Gaussian model

Abstract

The 2D Discrete Gaussian model gives each height function $η: \mathbb{Z}^2\to\mathbb{Z}$ a probability proportional to $\exp(-β\mathcal{H}(η))$, where $β$ is the inverse-temperature and $\mathcal{H}(η) = \sum_{x\sim y}(η_x-η_y)^2$ sums over nearest-neighbor bonds. We consider the model at large fixed $β$, where it is flat unlike its continuous analog (the Gaussian Free Field). We first establish that the maximum height in an $L\times L$ box with 0 boundary conditions concentrates on two integers $M,M+1$ with $M\sim \sqrt{(1/2πβ)\log L\log\log L}$. The key is a large deviation estimate for the height at the origin in $\mathbb{Z}^2$, dominated by "harmonic pinnacles", integer approximations of a harmonic variational problem. Second, in this model conditioned on $η\geq 0$ (a floor), the average height rises, and in fact the height of almost all sites concentrates on levels $H,H+1$ where $H\sim M/\sqrt{2}$. This in particular pins down the asymptotics, and corrects the order, in results of Bricmont, El-Mellouki and Fröhlich (1986), where it was argued that the maximum and the height of the surface above a floor are both of order $\sqrt{\log L}$. Finally, our methods extend to other classical surface models (e.g., restricted SOS), featuring connections to $p$-harmonic analysis and alternating sign matrices.

Explore related subjects

Keep this discovery

BibTeXRIS

Eyal Lubetzky, Fabio Martinelli, Allan Sly. 2014-05-20. Harmonic pinnacles in the Discrete Gaussian model. https://arxiv.org/abs/1405.5241

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