On a decomposition of additive random fields

Authors

  • Marguerite Zani Institut Denis Poisson, Universit´e d’Orl´eans
  • Alexey A. Khartov Saint Petersburg State University https://orcid.org/0000-0003-4134-083X

DOI:

https://doi.org/10.21638/11701/spbu01.2020.104

Abstract

We consider an additive random field on [0, 1]d , which is a sum of d uncorrelated random processes. We assume that the processes have zero mean and the same continuous covariance function. There is a significant interest in the study of random fields of this type. They appear for example in the theory of intersections and selfintersections of Brownian processes, in the problems concerning the small ball probabilities, and in the finite rank approximation problems with arbitrary large parametric dimension d. In the last problems the spectral characteristics of the covariance operator play key role. For a given additive random field the eigenvalues of its covariance operator easily depend on the eigenvalues of the  ovariance operator of the marginal processes in the case, when the latter has identical 1 as an eigenvector. In the opposite case the dependence is complex, that makes these random fields difficult to study. Here decomposing the random field into the sum of its integral and its centered version, the summands will be orthogonal in L2([0, 1]d), but in the general case they are correlated. In the present paper we propose another interesting decomposition for the random field, that was observed by the authors within finite rank approximation problems in the average case setting. In the derived decomposition the summands are orthogonal in L2([0, 1]d) and uncorrelated. Moreover, for large d they are respectively close
to the integral and to the centered version of the random field with small relative mean squared error.

Keywords:

additive random fields, decomposition, covariance function, covariance operator, eigenpairs, average case approximation complexity

Downloads

Download data is not yet available.
 

References

Литература

Chen X., Li W. V. Small deviation estimates for some additive processes // Proc. Conf. High Dimensional Probab. III, Progress in Probability. Birkh¨auser, 2003. Vol. 55. P. 225–238.

Karol A., Nazarov A., Nikitin Ya. Small ball probabilities for Gaussian random fields and tensor products of compact operators // Trans. Amer. Math. Soc. 2008. Vol. 360, no. 3. P. 1443–1474.

Hickernell F. J., Wasilkowski G. W., Wo´zniakowski H. Tractability of linear multivariate problems in the average-case setting. In: Monte Carlo and Quasi-Monte Carlo Methods 2006 / Eds. A. Keller, S. Heinrich, H. Niederreiter. Berlin: Springer, 2008. P. 461–493.

Lifshits M. A., Zani M. Approximation complexity of additive random fields // J. Complexity. 2008. Vol. 24, no. 3. P. 362–379.

Lifshits M. A., Zani M. Approximation of additive random fields based on standard information: Average case and probabilistic settings // J. Complexity. 2015. Vol. 31, no. 5. P. 659–674.

Khartov A. A., Zani M. Asymptotic analysis of average case approximation complexity of additive random fields // J. Complexity. 2019. Vol. 52. P. 24–44.

Khartov A. A., Zani M. Approximation complexity of sums of random processes // J. Complexity. 2019. Vol. 54. Art. no. 101399.

Brown J. L. Mean Square truncation error in series expansions of random functions // J. Soc. Indust. Appl. Math. 1960. Vol. 8, no. 1. P. 28–32.

Ritter K. Average-case Analysis of Numerical Problems. In Ser.: Lecture Notes in Math. No. 1733. Berlin: Springer, 2000.

References

Chen X., Li W. V., “Small deviation estimates for some additive processes”, Proc. Conf. High Dimensional Probab. III, Progress in Probability 55, 225–238 (Birkh¨auser, 2003).

Karol A., Nazarov A., Nikitin Ya., “Small ball probabilities for Gaussian random fields and tensor products of compact operators”, Trans. Amer. Math. Soc. 360(3), 1443–1474 (2008).

Hickernell F. J., Wasilkowski G.W., Wo´zniakowski H., Tractability of linear multivariate problems in the average-case setting, in: Monte Carlo and Quasi-Monte Carlo Methods 2006, 461–493 (A. Keller, S. Heinrich, H. Niederreiter (eds.), Springer, Berlin, 2008).

Lifshits M. A., Zani M., “Approximation complexity of additive random fields”, J. Complexity 24(3), 362–379 (2008).

Lifshits M. A., Zani M., “Approximation of additive random fields based on standard information: Average case and probabilistic settings”, J. Complexity 31(5), 659–674 (2015).

Khartov A. A., Zani M., “Asymptotic analysis of average case approximation complexity of additive random fields”, J. Complexity 52, 24–44 (2019).

Khartov A. A., Zani M., “Approximation complexity of sums of random processes”, J. Complexity 54, 101399 (2019).

Brown J. L., “Mean Square truncation error in series expansions of random functions”, J. Soc. Indust. Appl. Math. 8(1), 28–32 (1960).

Ritter K., Average-case Analysis of Numerical Problems, in Ser. Lecture Notes in Math., no. 1733 (Springer, Berlin, 2000).

Published

2020-05-13

How to Cite

Zani, M., & Khartov, A. A. (2020). On a decomposition of additive random fields. Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy, 7(1), 39–49. https://doi.org/10.21638/11701/spbu01.2020.104

Issue

Section

Mathematics