Search arXivSearch

arXiv · 2007.08484

Estimation of surface area

Abstract

We study the problem of estimating the surface area of the boundary $\partial S$ of a sufficiently smooth set $S\subset\mathbb{R}^d$ when the available information is only a finite subset $\X\subset S$. We propose two estimators. The first makes use of the Devroye--Wise support estimator and is based on Crofton's formula, which, roughly speaking, states that the $(d-1)$-dimensional surface area of a smooth enough set is the mean number of intersections of randomly chosen lines. For that purpose, we propose an estimator of the number of intersections of such lines with support based on the Devroye--Wise support estimators. The second surface area estimator makes use of the $α$-convex hull of $\X$, which is denoted by $C_α(\X)$. More precisely, it is the $(d-1)$-dimensional surface area of $C_α(\X)$, as denoted by $|C_α(\X)|_{d-1}$, which is proven to converge to the $(d-1)$-dimensional surface area of $\partial S$. Moreover, $|C_α(\X)|_{d-1}$ can be computed using Crofton's formula. Our results depend on the Hausdorff distance between $S$ and $\X$ for the Devroye--Wise estimator, and the Hausdorff distance between $\partial S$ and $\partial C_α(\X)$ for the second estimator.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Catherine Aaron, Alejandro Cholaquidis, Ricardo Fraiman. 2022-09-02. Estimation of surface area. https://arxiv.org/abs/2007.08484

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A note on the distribution of the partial correlation coefficient with nonparametrically estimated marginal regressions

There has been much interest in the nonparametric testing of conditional independence in the econometric and statistical literature, but the simplest and potentially most useful method, based on the sample partial correlation, seems to have been overlooked, its distribution only having been investigated in some simple parametric instances. The present note shows that an easy to apply permutation test based on the sample partial correlation with nonparametrically estimated marginal regressions has good large and small sample properties.

math.ST

Instance-Log-Optimality of Portfolio-Based E-Processes and their Sequential Hypothesis Tests

We consider the problem of sequential hypothesis testing using $e$-processes. For a rich class of composite testing problems---which include bounded mean testing, equal mean testing for bounded random tuples, and some key ingredients of two-sample and independence testing as special cases---we show that any $e$-process satisfying a certain sublinear regret bound is asymptotically and almost surely instance-log-optimal for a composite alternative. This is a strong notion of optimality that has not previously been established for the aforementioned problems, and we provide explicit test supermartingales and $e$-processes satisfying this notion in a more general case. Furthermore, we derive matching lower and upper bounds on the expected rejection time in the high-confidence regime for the resulting sequential tests in all of these cases. The proofs of these results make weak, algorithm-agnostic moment assumptions and rely on a proof technique involving the aforementioned regret and a family of numeraire portfolios. Finally, we discuss how all of these theorems hold in a distribution-uniform sense, a notion of log-optimality that is stronger still and seems to be new to the literature.

math.ST

Common Drivers in Sparsely Interacting Hawkes Processes

We study a multivariate Hawkes process as a model for time-continuous relational event networks. The model does not assume the network to be known, it includes covariates, and it allows for both common drivers, parameters common to all the actors in the network, and also local parameters specific for each actor. We derive rates of convergence for all of the model parameters when both the number of actors and the time horizon tends to infinity. To prevent an exploding network, sparseness is assumed. We also discuss numerical aspects.

math.ST