SearcharxivSearch

arXiv · 1710.01649

A note on parameter estimation for discretely sampled SPDEs

Abstract

We consider a parameter estimation problem for one dimensional stochastic heat equations, when data is sampled discretely in time or spatial component. We prove that, the real valued parameter next to the Laplacian (the drift), and the constant parameter in front of the noise (the volatility) can be consistently estimated under somewhat surprisingly minimal information. Namely, it is enough to observe the solution at a fixed time and on a discrete spatial grid, or at a fixed space point and at discrete time instances of a finite interval, assuming that the mesh-size goes to zero. The proposed estimators have the same form and asymptotic properties regardless of the nature of the domain - bounded domain or whole space. The derivation of the estimators and the proofs of their asymptotic properties are based on computations of power variations of some relevant stochastic processes. We use elements of Malliavin calculus to establish the asymptotic normality properties in the case of bounded domain. We also discuss the joint estimation problem of the drift and volatility coefficient. We conclude with some numerical experiments that illustrate the obtained theoretical results.

Explore related subjects

Keep this discovery

BibTeXRIS

Igor Cialenco, Yicong Huang. 2017-10-04. A note on parameter estimation for discretely sampled SPDEs. https://arxiv.org/abs/1710.01649

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