SearcharxivSearch

arXiv · 1510.01967

Pattern size in Gaussian fields from spinodal decomposition

Abstract

We study the two-dimensional snake-like pattern that arises in phase separation of alloys described by spinodal decomposition in the Cahn-Hilliard model. These are somewhat universal patterns due to an overlay of eigenfunctions of the Laplacian with a similar wave-number. Similar structures appear in other models like reaction-diffusion systems describing animal coats' patterns or vegetation patterns in desertification. Our main result studies random functions given by cosine Fourier series with independent Gaussian coefficients, that dominate the dynamics in the Cahn-Hilliard model. This is not a cosine process, as the sum is taken over domains in Fourier space that not only grow and scale with a parameter of order $1/\varepsilon$, but also move to infinity. Moreover, the model under consideration is neither stationary nor isotropic. To study the pattern size of nodal domains we consider the density of zeros on any straight line through the spatial domain. Using a theorem by Edelman and Kostlan and weighted ergodic theorems that ensure the convergence of the moving sums, we show that the average distance of zeros is asymptotically of order $\varepsilon$ with a precisely given constant.

Explore related subjects

Keep this discovery

BibTeXRIS

Luigi Amedeo Bianchi, Dirk Blömker, Philipp Wacker. 2015-10-07. Pattern size in Gaussian fields from spinodal decomposition. https://doi.org/10.1137/15m1052081

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