Search arXivSearch

arXiv · 2409.15059

Multivariate change estimation for a stochastic heat equation from local measurements

Abstract

We study a stochastic heat equation with piecewise constant diffusivity $θ$ having a jump at a hypersurface $Γ$ that splits the underlying space $[0,1]^d$, $d\geq2,$ into two disjoint sets $Λ_-\cupΛ_+.$ Based on multiple spatially localized measurement observations on a regular $δ$-grid of $[0,1]^d$, we propose a joint M-estimator for the diffusivity values and the set $Λ_+$ that is inspired by statistical image reconstruction methods. We study convergence of the domain estimator $\hatΛ_+$ in the vanishing resolution level regime $δ\to 0$ and with respect to the expected symmetric difference pseudometric. As a first main finding we give a characterization of the convergence rate for $\hatΛ_+$ in terms of the complexity of $Γ$ measured by the number of intersecting hypercubes from the regular $δ$-grid. Furthermore, for the special case of domains $Λ_+$ that are built from hypercubes from the $δ$-grid, we demonstrate that perfect identification with overwhelming probability is possible with a slight modification of the estimation approach. Implications of our general results are discussed under two specific structural assumptions on $Λ_+$. For a $β$-Hölder smooth boundary fragment $Γ$, the set $Λ_+$ is estimated with rate $δ^β$. If we assume $Λ_+$ to be convex, we obtain a $δ$-rate. While our approach only aims at optimal domain estimation rates, we also demonstrate consistency of our diffusivity estimators, which is strengthened to a CLT at minimax optimal rate for sets $Λ_+$ anchored on the $δ$-grid.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anton Tiepner, Lukas Trottner. 2025-01-30. Multivariate change estimation for a stochastic heat equation from local measurements. https://doi.org/10.1016/j.spa.2025.104832

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

KEEP EXPLORING

Related papers

Functional independent component analysis by choice of norm: a framework for near-perfect classification

We develop a theory for functional independent component analysis in an infinite-dimensional framework using Sobolev spaces that accommodate smoother functions. The notion of penalized kurtosis is introduced motivated by Silverman's method for smoothing principal components. This approach allows for a classical definition of independent components obtained via projection onto the eigenfunctions of a smoothed kurtosis operator mapping a whitened functional random variable. We discuss the theoretical properties of this operator in relation to a generalized Fisher discriminant function and the relationship it entails with the Feldman-Hájek dichotomy for Gaussian measures, both of which are critical to the principles of functional classification. The proposed estimators are a particularly competitive alternative in binary classification of functional data and can eventually achieve the so-called near-perfect classification, which is a genuine phenomenon of high-dimensional data. Our methods are illustrated through simulations, various real datasets, and used to model electroencephalographic biomarkers for the diagnosis of depressive disorder.

math.ST

Trace-Class Results for MCMC Algorithms for Student-$t$ Regression Models

In this paper, we consider MCMC algorithms for Student-$t$ regression models. In three cases, we investigate the efficiency of Markov chains based on the algorithms in terms of whether trace-class results hold or not. First, we consider the case where the parameters follow a matrix-normal-inverse-Wishart distribution and show that the Markov operator associated with a standard data augmentation algorithm is trace-class. Second, we consider the case of an improper prior and univariate outcomes. In this case, the standard Markov operator is not trace-class but the Markov operator associated with a collapsed Gibbs algorithm is trace-class. Third, we consider the case of an improper prior and multivariate outcomes. We obtain a trace-class result for a parameter expanded data augmentation algorithm which is based on a univariate working parameter. Finally, we consider the problem of numerially estimating a convergence rate of the trace-class Markov operator in the second case.

math.ST

The Manifold Hypothesis under Unknown Gaussian Noise:Conditional Certificates and Consistent Dimension Estimation

We study what noisy data can establish about the Manifold Hypothesis under explicit identification and regularity conditions. A population residual certificate combines independent-view localization, Gaussian concentration, membership uncertainty, and population transfer. Existing rectifiability criteria then yield a covered-scale consequence. For a local smooth manifold with positive Hölder density, the actual-ball covariance limit identifies the spectral crossing with geometric dimension. We prove almost-sure eventual recovery under repeated observations. Reusing accurate localization averages improves the sufficient point-sample condition from $Nr^{d+4}\gg\log N$ to $Nr^d\gg\log N$, with replication $kr^2\gg\log N$. A two-mass certificate controls incorrect geometric-dimension emissions under declared class bounds. For single observations with unknown Gaussian noise, affine-support or known coordinate-bound restrictions provide noise intervals and consistent Gaussian correlation-dimension estimators. Ahlfors regularity identifies this exponent with Hausdorff dimension and with the geometric dimension of a homogeneous smooth class. Exact Cantor calculations delineate the limits of integer spectral counts and adjacent-radius slopes. We credit established local PCA, rectifiability, concentration, binomial inference, and deconvolution results before specifying our constructions. Reproducible experiments distinguish point estimation, finite-scale coverage, and certificate emission.

math.ST