SearcharxivSearch

arXiv · 2209.10383

Surface area and volume of excursion sets observed on point cloud based polytopic tessellations

Abstract

The excursion set of a $C^2$ smooth random field carries relevant information in its various geometric measures. From a computational viewpoint, one never has access to the continuous observation of the excursion set, but rather to observations at discrete points in space. It has been reported that for specific regular lattices of points in dimensions 2 and 3, the usual estimate of the surface area of the excursions remains biased even when the lattice becomes dense in the domain of observation. In the present work, under the key assumptions of stationarity and isotropy, we demonstrate that this limiting bias is invariant to the locations of the observation points. Indeed, we identify an explicit formula for the bias, showing that it only depends on the spatial dimension $d$. This enables us to define an unbiased estimator for the surface area of excursion sets that are approximated by general tessellations of polytopes in $\mathbb{R}^d$, including Poisson-Voronoi tessellations. We also establish a joint central limit theorem for the surface area and volume estimates of excursion sets observed over hypercubic lattices.

Explore related subjects

Keep this discovery

BibTeXRIS

Ryan Cotsakis, Elena Di Bernardino, Céline Duval. 2022-09-21. Surface area and volume of excursion sets observed on point cloud based polytopic tessellations. https://arxiv.org/abs/2209.10383

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