SearcharxivSearch

arXiv · math/0112225

Enhanced interface repulsion from quenched hard-wall randomness

Abstract

We consider the harmonic crystal on the d-dimensional lattice, d larger or equal to 3, that is the centered Gaussian field $ϕ$ with covariance given by the Green function of the simple random walk on $Z^d$. Our main aim is to obtain quantitative information on the repulsion phenomenon that arises when we condition the field to be larger than an IID field $σ$ (which is also independent of $ϕ$), for every x in a large region $D_N=ND\cap \Z^d$, with N a positive integer and $D \subset\R^d$. We are mostly motivated by results for given typical realizations of the $σ$ (quenched set-up), since the conditioned harmonic crystal may be seen as a model for an equilibrium interface, constrained not to go below a inhomogeneous substrate that acts as a hard wall. We consider various types of substrate and we observe that the interface is pushed away from the wall much more than in the case of a flat wall as soon as the upward tail of $σ$ is heavier than Gaussian, while essentially no effect is observed if the tail is sub--Gaussian. In the critical case, that is the one of approximately Gaussian tail, the interplay of the two sources of randomness, $ϕ$ and $σ$, leads to an enhanced repulsion effect of additive type.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniela Bertacchi, Giambattista Giacomin. 2001-12-20. Enhanced interface repulsion from quenched hard-wall randomness. https://arxiv.org/abs/math/0112225

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