Search arXivSearch

arXiv · 2103.04211

Statistical analysis of discretely sampled semilinear SPDEs: a power variation approach

Abstract

Motivated by problems from statistical analysis for discretely sampled SPDEs, first we derive central limit theorems for higher order finite differences applied to stochastic process with arbitrary finitely regular paths. These results are proved by using the notion of $\Delta$-power variations, introduced herein, along with the H\"older-Zygmund norms. Consequently, we prove a new central limit theorem for $\Delta$-power variations of the iterated integrals of a fractional Brownian motion (fBm). These abstract results, besides being of independent interest, in the second part of the paper are applied to estimation of the drift and volatility coefficients of semilinear stochastic partial differential equations in dimension one, driven by an additive Gaussian noise white in time and possibly colored in space. In particular, we solve the earlier conjecture from Cialenco, Kim, Lototsky (2019) about existence of a nontrivial bias in the estimators derived by naive approximations of derivatives by finite differences. We give an explicit formula for the bias and derive the convergence rates of the corresponding estimators. Theoretical results are illustrated by numerical examples.

Explore related subjects

Keep this discovery

BibTeXRIS

Igor Cialenco, Hyun-Jung Kim, Gregor Pasemann. 2021-03-06. Statistical analysis of discretely sampled semilinear SPDEs: a power variation approach. https://arxiv.org/abs/2103.04211

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