SearcharxivSearch

arXiv · 1403.1811

Heat content asymptotics of some random Koch type snowflakes

Abstract

We consider the short time asymptotics of the heat content $E$ of a domain $D$ of $\mathbb{R}^d$. The novelty of this paper is that we consider the situation where $D$ is a domain whose boundary $\partial D$ is a random Koch type curve. When $\partial D$ is spatially homogeneous, we show that we can recover the lower and upper Minkowski dimensions of $\partial D$ from the short time behaviour of $E(s)$. Furthermore, in some situations where the Minkowski dimension exists, finer geometric fluctuations can be recovered and the heat content is controlled by $s^\alpha e^{f(\log(1/s))}$ for small $s$, for some $\alpha \in (0, \infty)$ and some regularly varying function $f$. The function $f$ is not constant is general and carries some geometric information. When $\partial D$ is statistically self-similar, then the Minkowski dimension and content of $\partial D$ typically exist and can be recovered from $E(s)$. Furthermore, the heat content has an almost sure expansion $E(s) = c s^{\alpha} N_\infty + o(s^\alpha)$ for small $s$, for some $c$ and $\alpha \in (0, \infty)$ and some positive random variable $N_\infty$ with unit expectation arising as the limit of some martingale.

Explore related subjects

Keep this discovery

BibTeXRIS

Philippe H. A. Charmoy. 2014-03-07. Heat content asymptotics of some random Koch type snowflakes. https://arxiv.org/abs/1403.1811

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