Asymptotics for Spherical Functional Autoregressions
Alessia Caponera, Domenico Marinucci

TL;DR
This paper studies spherical functional autoregressive processes, establishing consistency, a central limit theorem, and weak convergence results for their estimation, supported by numerical validation.
Contribution
It introduces new asymptotic results for spherical functional autoregressions, including consistency and limit theorems, under specific regularity conditions.
Findings
Established consistency in sup and mean-square norms
Proved a quantitative central limit theorem in Wasserstein distance
Validated results with numerical experiments
Abstract
In this paper, we investigate a class of spherical functional autoregressive processes, and we discuss the estimation of the corresponding autoregressive kernels. In particular, we first establish a consistency result (in sup and mean-square norm), then a quantitative central limit theorem (in Wasserstein distance), and finally a weak convergence result, under more restrictive regularity conditions. Our results are validated by a small numerical investigation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Asymptotics for Spherical Functional Autoregressions
Alessia Caponeralabel=e1][email protected] and Domenico Marinuccilabel=e2][email protected] [[ Piazzale Aldo Moro, 5
00185 Rome
Italy
Department of Statistical Sciences, Sapienza University of Rome
Via della Ricerca Scientifica, 1
00133 Rome
Italy
Department of Mathematics, University of Rome Tor Vergata
Alessia Caponeralabel=e1][email protected] and Domenico Marinuccilabel=e2][email protected] [[ Piazzale Aldo Moro, 5
00185 Roma
Italy
Department of Statistical Sciences, Sapienza University of Rome
Via della Ricerca Scientifica, 1
00133 Roma
Italy
Department of Mathematics, University of Rome Tor Vergata
Supplement to "Asymptotics for Spherical Functional Autoregressions"
Alessia Caponeralabel=e1][email protected] and Domenico Marinuccilabel=e2][email protected] [[ Piazzale Aldo Moro, 5
00185 Rome
Italy
Department of Statistical Sciences, Sapienza University of Rome
Via della Ricerca Scientifica, 1
00133 Rome
Italy
Department of Mathematics, University of Rome Tor Vergata
Alessia Caponeralabel=e1][email protected] and Domenico Marinuccilabel=e2][email protected] [[ Piazzale Aldo Moro, 5
00185 Roma
Italy
Department of Statistical Sciences, Sapienza University of Rome
Via della Ricerca Scientifica, 1
00133 Roma
Italy
Department of Mathematics, University of Rome Tor Vergata
Abstract
In this paper, we investigate a class of spherical functional autoregressive processes, and we discuss the estimation of the corresponding autoregressive kernels. In particular, we first establish a consistency result (in sup and mean-square norm), then a quantitative central limit theorem (in Wasserstein distance), and finally a weak convergence result, under more restrictive regularity conditions. Our results are validated by a small numerical investigation.
62M15,
60G15 60F05 62M40,
Spherical Functional Autoregressions,
Spherical Harmonics,
Quantitative Central Limit Theorem,
Wasserstein Distance,
Weak Convergence,
keywords:
[class=MSC]
keywords:
\setattribute
journalname
\startlocaldefs
\endlocaldefs
t1DM acknowledges the MIUR Excellence Department Project awarded to the Department of Mathematics, University of Rome Tor Vergata, CUP E83C18000100006. We are also grateful to Pierpaolo Brutti for many insightful suggestions and conversations.
1 Introduction
In recent years, a lot of interest has been drawn by the statistical analysis of spherical isotropic random fields. These investigations have been motivated by a wide array of applications arising in many different areas, including in particular, Cosmology, Astrophysics, Geophysics, Climate and Atmospheric Sciences, and many others, see, e.g., [2, 4, 12, 7, 16, 13, 14, 23, 25, 31]. Most papers in Cosmology and Astrophysics have focussed so far on spherical random fields with no temporal dependence; the next generation of Cosmological experiments is however going to make the time dependence much more relevant. On the other hand, applications in Climate, Atmospheric Sciences, Geophysics, and several other areas have always been naturally modelled in terms of a double-dependence in the spatial and temporal domains. In many works of these fields, the attention has been focussed on the definition of wide classes of space-time covariance functions, and then on the derivation of likelihood functions; the literature on these themes is vast and we make no attempt to a complete list of references, see for instance [12, 16, 20, 31] and the references therein.
Our purpose in this paper is to investigate a class of space-time processes, which can be viewed as functional autoregressions taking values in ; we refer to [5] for a general textbook analysis of functional autoregressions taking values in Hilbert spaces, and [1, 18, 29] for a very partial list of some important recent references.
Dealing with functional spherical autoregressions ensures some very convenient simplifications; in particular, we exploit the analytic properties of the standard orthonormal basis of and some natural isotropy requirements to obtain neat expressions for the autoregressive functionals, which are then estimated by a form of frequency-domain least squares. For our estimators, we are able to establish rates of consistency (in and norms) and a quantitative version of the Central Limit Theorem, in Wasserstein distance. In particular, we derive explicit bounds for the rate of convergence to the limiting Gaussian distribution by means of the rich machinery of Stein-Malliavin methods (see [28]); to the best of our knowledge, this is the first Quantitative Central Limit Theorem established in the framework of functional-valued stationary processes. Under stronger regularity conditions, we are able to establish a weak convergence result for the kernel estimators; our results are then illustrated by simulations.
The plan of our work is then as follows: in Section 2 we present background results on the harmonic analysis of spherical random fields and on Stein-Malliavin methods. In Section 3 we present our basic model; we show how, under isotropy, the model enjoys a number of symmetry properties which greatly simplify our approach. Our main results are then collected in Section 4, where we investigate rates of convergence and the Quantitative Central Limit Theorem; we consider also weak convergence in , under stronger regularity conditions for the autoregressive kernels. Large parts of the proofs and many auxiliary lemmas, some of possible independent interest, are collected in Sections 5 and in the Appendix (Supplementary Material). Finally, Section 6 provides numerical estimates on the behaviour of our procedures.
2 Background and Notation
2.1 Spectral Representation of Isotropic Random Fields on the Sphere
Let denote a finite variance, isotropic random field on the unit sphere , by which we mean as usual that the standard 3-dimensional group of rotations; here the identity in distribution must be understood in the sense of stochastic processes: for notational simplicity, and without loss of generality, we will assume in the sequel that . It is well-known that the following representation holds, in the mean-square sense:
[TABLE]
where are the standard basis of spherical harmonics, which satisfy (for , )
[TABLE]
also are a triangular array of zero-mean, real-valued random coefficients whose covariance structure is given by
[TABLE]
here is the Kronecker delta function, and the sequence represents the angular power spectrum of the field. Throughout this paper we consider the real-valued basis of spherical harmonics, and therefore the random coefficients are real-valued random variables for all (we refer for instance to [24] for a more detailed discussion on spectral representations on the sphere). Note that the random coefficients can be obtained by a direct inversion formula from the map indeed we have
[TABLE]
Here, we recall also the following addition formula for spherical harmonics (see [24], equation 3.42) which entails that, for any ,
[TABLE]
where denotes the standard inner product in , and represents the -th Legendre polynomial, defined as usual by
[TABLE]
It is easy to show that moreover, the following reproducing property is satisfied, i.e.,
[TABLE]
Under isotropy, from (1) and (2) the covariance function satisfies
[TABLE]
In the sequel, given any two positive sequences , , we shall write if such that . In addition, we will denote with a positive real constant, which may change from line to line; also, we use for the usual norm on the sphere, and for the minimum and maximum eigenvalues of the matrix , respectively, for the operator norm of , i.e., , and for the trace of .
2.2 Hermite Polynomials and Stein-Malliavin Results
Let us recall the family of Hermite polynomials , defined by
[TABLE]
for instance, the first few are given by , , and . The sequence is an orthonormal basis of the space of finite variance transform of Gaussian variables, i.e.,
[TABLE]
more generally, for the space generated by any Gaussian random measure we can write the Stroock-Varadhan decomposition
[TABLE]
where is the -th order Wiener chaos, i.e., the space spanned by linear combinations of -th order Hermite polynomials, see [28] for more discussions and details.
We shall exploit extensively a very powerful technique, recently discovered by [27], to establish Quantitative Central Limit Theorems for sequences of random variables belonging to Wiener chaoses. To explain what we mean by a Quantitative Central Limit Theorem, we recall first the notion of Wasserstein distance, i.e., for any two -dimensional random variables
[TABLE]
with the usual Euclidean norm on , where we assume that , for every . See [28] for a discussion of the main properties of and for other examples of probability metrics; here we recall simply that
[TABLE]
It is shown in [28] that for sequences of zero-mean scalar random variables belonging to () such that , one has the remarkable inequality
[TABLE]
where (in our proof below we will actually exploit a multivariate extension of this inequality, also given in [28]). The inequality in (4) can be proved by means of the so-called Stein-Malliavin approach, which establishes a deep and surprising connection between Malliavin calculus and Stein’s equation as a tool for the investigation of limiting distributions. In particular, in view of (4) for sequences that belong to Wiener chaoses the investigation of the asymptotic behaviour of the fourth-moment is enough to investigate not only the validity of a central limit theorem, but also the rate of convergence to the Gaussian limiting distribution.
3 Spherical Random Fields with Temporal Dependence
We are now ready to introduce our model of interest. As usual, by space-time spherical random fields we mean a collection of random variables such that the application is -measurable, for some probability space . The following definition is standard:
Definition 1**.**
* is 2-weakly isotropic stationary if is constant and the covariance function is a spatially isotropic and temporally stationary function on , that is there exists such that*
[TABLE]
In particular, we will focus on Gaussian random fields, where of course weak stationarity entails strong isotropy and stationarity, i.e., the law of is the same as the law of in the sense of processes, for all and . Note that, for (zero-mean) finite variance random fields, is a random function of , . Thus, for any fixed , the following spectral representation holds:
[TABLE]
where are spherical harmonics, and (zero-mean) random coefficients which satisfy
[TABLE]
Note that corresponds to the angular power spectrum of the spherical field at a given time point, for which we will simply write . As for the isotropic case, for fixed , the covariance function is easily shown to have a spectral decomposition in terms of Legendre polynomials (Schoenberg’s Theorem, see also [4]), i.e., for every ,
[TABLE]
Remark 2**.**
By exploiting results from [29], it would also be possible to rewrite (5) by means of the Cramér-Karhunen-Loéve representation
[TABLE]
where is a family of independent complex-valued Gaussian random measures, with mean zero and covariance structure
[TABLE]
where denotes the spectral density of the process which is introduced below and satisfies
[TABLE]
This approach is not pursued here, see also [8] for more discussion and details.
3.1 Spherical Autoregressions
Consider now two zero-mean Gaussian isotropic stationary random fields
[TABLE]
so that and . Let us start from the definition of a Gaussian spherical white noise process.
Definition 3** (Gaussian Spherical White Noise).**
* is a sequence of independent and identically distributed Gaussian isotropic spherical random fields. That is*
a) for every fixed , is a Gaussian, zero-mean isotropic random field, with covariance function
[TABLE]
here, denotes as usual the angular power spectrum of ;
b) for every the random fields are independent.
Remark 4**.**
Note that we are defining the field as a collection of random variables defined on every pair Alternatively, one could view the fields as random elements in a Hilbert space (in our case, corresponding to see [5] the two approaches are equivalent here, because throughout this paper we will always be dealing with mean-square continuous random fields.
Definition 5**.**
A spherical isotropic kernel operator is an application which satisfies
[TABLE]
The following representation holds, in the sense, for the kernel associated to :
[TABLE]
The coefficients corresponds to the eigenvalues of the operator and the associated eigenfunctions are the family of spherical harmonics , yielding
[TABLE]
Thus, it holds , and hence this operator is Hilbert-Schmidt (see, e.g., [19]). In this paper, we shall also consider trace class operators, namely such that , for which the representation (6) holds pointwise for every .
Definition 6**.**
The collection of random variables satisfies the Spherical Autoregressive process of order (written ) if there exist isotropic kernel operators such that
[TABLE]
for all , the equality holding both in the and in the sense.
Remark 7**.**
It should be noted that the solution process is defined pointwise, i.e., for each there exists a random variable defined on () such that the identity (7) holds.
Let us define the eigenvalues which satisfy
[TABLE]
Hence, for any ,
[TABLE]
that is admits a spectral representation in terms of spherical harmonics with coefficients . Likewise, we obtain
[TABLE]
to ensure identifiability, we assume that there exists at least an such that so that see again [5]. Let us now define as usual the associated polynomials :
[TABLE]
Condition 8**.**
The sequence of polynomials (9) is such that , some . More explicitly, there are no roots in a -enlargement of the unit disk, for all .
Remark 9**.**
Under Condition 8, Equation (7) admits a unique stationary isotropic solution; the proof can be given along the same lines as in [5], and it is omitted for brevity’s sake, see [8] for more discussion and details.
Example 10** ().**
The family of random variables is a spherical process if for all pairs it satisfies
[TABLE]
In this case, the Condition 8 simply becomes , .
Remark 11**.**
The autocovariance function of a stationary spherical process is easily seen to be given by (writing
[TABLE]
It is easy hence to envisage a number of parametric models for sphere-time covariances; for instance, a simple proposal is
[TABLE]
Here, the parameters control, respectively, the smoothness of the innovation process and the regularity of the autoregressive kernel (see [22]); the positive integer can be seen as a sort of "characteristic scale", where the power of the kernel is concentrated. More generally, we can take where are fixed parameters and is any function such that
[TABLE]
uniformly over all values of
Condition 12** (Identifiability).**
The Gaussian spherical white noise process is such that for all
Remark 13**.**
The previous condition is an identifiability assumption; indeed, it is simple to verify from our arguments below that for the component of the kernel corresponding to the -th multipole is not observable, i.e., the process has the same distribution whatever the value of It is possible, however, to estimate the "sufficient" version of the kernel, i.e., its projection on the relevant subspace, such that The extension is straightforward and we avoid it just for brevity and notational simplicity. Of course, as a consequence we have that
[TABLE]
4 Main Results
Throughout this paper, we shall assume to be able to observe the projections of the fields on the orthonormal basis i.e., we assume to observe
[TABLE]
The estimator we shall focus on is a form of least square regression on an increasing subset of the orthonormal system more precisely, we shall define for the vector of nuclear kernels, a growing sequence of integers as and a vector of estimators
[TABLE]
where , , and is the Cartesian product of copies of
[TABLE]
As common in the autoregressive context, we drop the first observations when computing our estimators, in order to avoid initialization issues. We shall write for the function ,
[TABLE]
Note that
[TABLE]
on the other hand, for we have the identity (see [33, 17])
[TABLE]
it is then possible to show that (see Lemma 4 in the Supplementary Material)
[TABLE]
where indicates that the ratio of left- and right-hand sides converges to unity.
For our results to follow, we need slightly stronger assumptions on the "high frequency" behaviour of the kernels More precisely, we shall introduce the following:
Condition 14** (Smoothness).**
For all there exists positive constants such that
[TABLE]
We let . We shall say that this condition is satisfied in the strong sense if .
Remark 15**.**
It is readily seen that Condition 14 leads to Hilbert-Schmidt operators, since it implies , ; whereas the strong version Condition 14 is specific for nuclear operators, since it entails , , see again [19].
Remark 16**.**
Condition 14 is easily interpretable in terms of the regularity of each kernel . Indeed, in [22] it is shown that
[TABLE]
implies integrability of the first derivatives of i.e., belongs to the Sobolev space .
Our first result refers to the asymptotic consistency of the kernel estimators that we just introduced.
Theorem 17** (Consistency).**
Consider in Equation (11). Under Conditions 8, 12 and 14, for , we have that
[TABLE]
Moreover, under Conditions 8, 12 and 14 (in the strong sense), for ,
[TABLE]
Remark 18** (Optimal choice of ).**
The optimal choice of in terms of the best convergence rates, is given by leading to the exponents and respectively. Heuristically, the result can be explained as follows: larger values of entail higher regularity/smoothness properties of the kernels to be estimated; as usual in nonparametric estimation, more regular functions can be estimated with better convergence rates, as the bias term is controlled more efficiently. Indeed, for and , the mean square error approximates the parametric rate , as expected.
Remark 19** (Plug-in estimates).**
For applications to empirical data, the optimal rate can be implemented by means of plug-in techniques, i.e., estimating (under additional regularity conditions) the value of the parameter by means of first step-estimators of the coefficients Let us sketch the main ideas for this approach, omitting some details for brevity. Consider for simplicity the case, and let us make Condition 14 stronger by assuming that
[TABLE]
Consider the estimator
[TABLE]
from which we can now build the pseudo log-regression model
[TABLE]
where the "regression residuals" are independent over , with asymptotically mean zero and bounded variance as It is then possible to study the asymptotic consistency of the OLS-like estimator (see also [32] for the related log-periodogram estimator)
[TABLE]
The optimal rates can then be consistently estimated by means of the plug-in estimates
A more rigorous and complete investigation on these issues is currently in preparation and is not reported here for brevity’s sake.
Our second result refers to a Quantitative Central Limit Theorem for the kernel estimators. Consider in Equation (11) and, for any , any , , define the vectors
[TABLE]
Theorem 20**.**
Under Conditions 8, 12 and 14 (in the strong sense), for , we have that
[TABLE]
Remark 21**.**
It is easy to see that the bound in Theorem 20 can also be expressed as
[TABLE]
An immediate Corollary is the following.
Corollary 22**.**
Under the same Conditions and notation as in Theorem 20, for any fixed , we have that
[TABLE]
Remark 23**.**
Plug-in procedures can be exploited to determine the choice of the "bandwidth" parameter which yields the optimal convergence rate in Wasserstein distance. As usual, the values of that guarantee asymptotic normality do not minimize the mean squared error; in fact, we have that which is the minimal value of for Theorem 20 to hold. Indeed, asymptotic Gaussianity requires undersmoothing, i.e., a value of which makes the asymptotic bias negligible, rather than of the same order as the variance. Once again the rate can be taken to approach for
For our third and final result, we need to strengthen the conditions on the regularity of the autoregressive kernels.
Condition 24**.**
The kernel admits a final expansion in the Legendre basis, i.e., there exist an (arbitrary large but finite) integer such that
[TABLE]
Condition 24 clearly implies that there exist finite integers such that
[TABLE]
we also need to introduce, for the autocovariance matrix
[TABLE]
and we shall write for the zero-mean, -dimensional Gaussian process with covariance function
[TABLE]
We are now able to state our last Theorem.
Theorem 25**.**
Under Conditions 8, 12 and 24, we have that
[TABLE]
where denotes weak convergence in (the space of continuous functions from to with the standard uniform metric).
Remark 26**.**
At first sight, it may look surprising that the weak convergence for the estimators in Theorem 25 occurs at a faster rate than the convergence in finite-dimensional distributions of Theorem 20. This comparison, however, is misleading; indeed, in Theorem 20 we are not assuming the expansion of the kernels to be finite, and therefore we need to include a growing number of multipoles to ensure that bias terms are asymptotically negligible. On the other hand, note that weak convergence cannot hold under the conditions of Theorem 20, as the limiting finite dimensional distributions correspond to Gaussian independent random variables for any choice of fixed points no Gaussian process with measurable trajectories can have these finite-dimensional distributions. The limiting distribution is characterized by the nuisance parameters for brevity’s sake, estimation of these parameters is deferred to future work.
5 Proofs of the Main Results
We now present the main arguments of our proofs, which are based on a number of technical results collected in the Appendix (Supplementary Material). For it is convenient to introduce the -dimensional vectors
[TABLE]
moreover, let us consider the matrix
[TABLE]
where
[TABLE]
We start from the proof of the consistency results.
Proof (Theorem 17).
It is easy to see that we have
[TABLE]
where
[TABLE]
Now, let be the difference between the kernel and its truncated version
[TABLE]
i.e.,
[TABLE]
where the equality holds in the sense. Then,
[TABLE]
since , from orthogonality of Legendre polynomials.
Now notice that
[TABLE]
Then, from Lemma 2 in the Supplementary material,
[TABLE]
On the other hand,
[TABLE]
Therefore, under Condition 14 and for , we have
[TABLE]
and
[TABLE]
where , as claimed.
Under the strong version of Condition 14, each kernel is defined for all as the pointwise limit of its expansion in terms of Legendre polynomials and
[TABLE]
by the triangle inequality. Hence, for the first component we have
[TABLE]
again in view of Lemma 2 in the Appendix (Supplementary Material)and the Cauchy-Schwartz inequality. On the other hand
[TABLE]
Therefore, again under the strong version of Condition 14 and for , we have
[TABLE]
and thus
[TABLE]
as claimed.
We are now in the position to establish the Quantitative Central Limit Theorem.
Proof (Theorem 20).
Let us recall that the minimizing estimator takes the form
[TABLE]
where
[TABLE]
We shall introduce some more notation:
[TABLE]
and
[TABLE]
Therefore
[TABLE]
Heuristically, the proof of the Quantitative Central Limit Theorem can be described as follows: in order to be able to exploit Stein-Malliavin techniques, we need to deal with variables belonging to some -th order chaos; now the ratio above does not fulfill this requirement, because is a random quantity which does not belong to any . On the other hand, componentwise we have , for each . We shall then show that it is possible to replace by its (deterministic) probability limit , without affecting asymptotic results; because our kernel estimators will be written as linear combinations of , the proof can be completed by a careful investigation of multivariate fourth-order cumulants.
Let us now make the previous argument rigorous. Let and be two -dimensional random vectors, defined as
[TABLE]
and
[TABLE]
In particular, and , where is a block matrix whose generic -th block, , is given by
[TABLE]
Now, consider and . Applying the triangle inequality twice, it follows that
[TABLE]
We recall from [28], p. 126, Equation 6.4.2 that
[TABLE]
where , and we observe that
[TABLE]
from Lemmas 3 and 4 in the Supplementary Material. Indeed, for every ,
[TABLE]
the logarithmic term comes from Equation (8) in the Supplementary Lemma 4. Equation (17) entails that , thus we have , as , and
[TABLE]
Let us recalll again from [28], p. 122 (second point of Theorem 6.2.2) that
[TABLE]
where
[TABLE]
being the -th element of . Moreover, for the -th element of we have
[TABLE]
see Equation (4) in Lemma 1. In addition,
[TABLE]
in view of the independence across different multipoles . Therefore
[TABLE]
Thus, we have
[TABLE]
and
[TABLE]
Now, consider the decomposition
[TABLE]
Without loss of generality, we shall focus on the case ; the more general argument is basically identical, with a slightly more cumbersome notation. For ,
[TABLE]
and then, also using Hilb’s equation,
[TABLE]
where for the second inequality we have exploited the Supplementary Lemma 2. Likewise,
[TABLE]
[TABLE]
In the end, combining Equations (18), (19) and (22), it holds that
[TABLE]
Note that the constant in this bound may depend on the choice of and .
We can now give the proof of the third (and final) result.
Proof (Theorem 25).
We have that, for ,
[TABLE]
Then,
[TABLE]
and hence
[TABLE]
in view of the Supplementary Lemma 2. Then the second part of the sum in (5) goes to zero in probability. Since the sum (over ) has independent components, we just need to prove that, for each , forms a tight sequence. Using the tightness criterion given in [3], Equation 13.14 on page 143, it is sufficient to show that, for ,
[TABLE]
Convergence of the finite-dimensional distributions is standard and we omit the details, which are closed to those given in the proofs of the previous Theorem. Thus the sequence converges weakly to a zero-mean multivariate Gaussian process with covariance function .
6 Some Numerical Evidence
In this section, we present some short numerical results to illustrate the models and methods that we discussed in this paper.
We stress first that random fields on the sphere cross time can be very conveniently generated by combining the general features of Python with the HEALPix software (see [15] and https://healpix.sourceforge.io). More precisely, HEALPix (which stands for Hierarchical Equal Area and iso-Latitude Pixelation) is a multi-purpose computer software package for a high resolution numerical analysis of functions on the sphere, based on a clever tessellation scheme: the spherical surface is hierarchically partitioned into curvilinear quadrilaterals of equal area (at a given resolution), distributed on lines of constant latitude, as suggested in the name. In particular, we shall make use of healpy, which is a Python package based on the HEALPix C++ library. HEALPix was developed to efficiently process Cosmic Microwave Background data from Cosmology experiments (like Planck, [30]), but it is now used in many other branches of Astrophysics and applied sciences.
In short, HEALPix allows to create spherical maps according to the spectral representation (1), accepting in input either an array of random coefficients , or the angular power spectrum , by means of the routines alm2map and synfast: in the latter case, random are generated according to a Gaussian zero mean distribution with variance . The routine is extremely efficient and allows to generate maps of resolution up to a few thousands multipoles in a matter of seconds on a standard laptop computer.
In our case, however, we need random fields where the random spherical harmonics coefficients have themselves a temporal dependence structure. For this reason, we implemented a simple routine in Python, to simulate Gaussian processes, each following an dependence structure. These random harmonic coefficients are then uploaded into HEALPix, to generate maps such as those that are given in Figure 1. In particular, in these two cases we fixed , respectively. Then we generated according to a stationary processes, with parameters ; similarly, we took here . In the figure, we report the realization for the first 4 periods, simply for illustrative purposes.
We are now in the position to use simulations to validate the previous results. In our first Tables 1-3, we report for Monte Carlo replications the values of the "variance" and "bias" terms, i.e., the first and second summand in the mean square equation (16); the second term is actually deterministic, and it is reported to illustrate the approximation one obtains by cutting the expansion to a finite multipole value. In the third column, we report, the actual (squared) error. On the left-hand side, we fix the number of multipoles to be exploited in the reconstruction of the kernel; on the right-hand side, we consider a sort of "oracle" estimator, where the number of multipoles grows with the optimal rate . As before, we took , for ; for the left -hand side uses , while the right-hand side takes , as explained above.
We note how the estimators perform very efficiently, and show the errors scale approximately as , where , as predicted by our computations, see Remark 18. In particular, for our results predict an upper bound for the error decaying as whereas simulations show a decay in the order of for we have and and finally for the predicted upper bound is in the order of , while the observed decay is in the order of
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We can now focus quickly on the main result of our paper, dealing with the Quantitative Central Limit Theorem, in Wasserstein distance; the latter is computed following the Python routine (scipy.stats.wasserstein distance). We consider again a model where the autoregressive parameter and the angular power spectra are exactly the same as in the previous settings, in particular taking and ; we fix for the number of components under the null hypothesis. Under these circumstances, we evaluate (univariate) Wasserstein distances for the kernel estimators at different locations, performing Monte Carlo replications.
The results are reported in Table 4; here we take Monte Carlo replications, and taking for the cardinality of the time-domain observations. It should be noted that huge sample sizes are quite common when dealing with sphere cross time data, see, e.g., the NCEP/NCAR reanalysis datasets [21] for athmospheric research.
Again, we note as simulations track closely the theoretical predictions. More precisely, for the theoretical upper bounds we expect to decay as , leading to in the setting of Table 4, for Table 5, whereas estimates from the simulations give as worst rates and , respectively.
[TABLE]
[TABLE]
Clearly a full assessment of these procedures would require a much deeper numerical investigation; these preliminary results, however, seem rather encouraging for future developments.
t1DM acknowledges the MIUR Excellence Department Project awarded to the Department of Mathematics, University of Rome Tor Vergata, CUP E83C18000100006. We are also grateful to Pierpaolo Brutti for many insightful suggestions and conversations.
1 Appendix
Throught this Appendix, we assume that Conditions 8 and 13 hold. Under these assumptions the proof that Equation (7) admits a unique stationary and isotropic solution can be given along the same lines as in [5] and it is omitted for brevity’s sake; see [8] for more discussion and details. Note that, under these two Conditions, the variance can be written in terms of the coefficients , , the autocorrelations , , and the error variance ; namely
[TABLE]
Hence,
[TABLE]
and there exists a positive constant such that, uniformly over ,
[TABLE]
Recall that and are (in absolute value) bounded by positive constants since both converge to 1 as . Now, we denote with the correlation spectral density
[TABLE]
where is the autocorrelation function, and we recall that is the matrix of autocorrelations, with -th element . Since is a continuous symmetric function on , it follows that (see [34])
[TABLE]
where and are the minimum and maximum of in , respectively; and are the minimum and maximum eigenvalues of , respectively. Moreover, because we assumed , from (2) we conclude that the minimum eigenvalue is strictly positive (and hence bounded away from zero) and is positive definite (and then invertible). Since is a real symmetric positive definite matrix, then
[TABLE]
[TABLE]
where , and is the trace of . In addition,
[TABLE]
since
[TABLE]
Then, from Equation (1), we can conclude that, uniformly over ,
[TABLE]
The first result below will be exploited to prove convergence in probability of the denominator for our estimators, while the second part gives the fourth-cumulant bound which is crucial for Stein-Malliavin arguments. We recall here for convenience the equalities
[TABLE]
where
[TABLE]
and
[TABLE]
Lemma 1**.**
For any integers , , there exists such that
[TABLE]
and
[TABLE]
where is the -th element of the -dimensional vector and are the elements of the inverse matrix .
The following result shows that replacing by its expected value in the definition of the OLS-like estimator does not have any asymptotic effect, as .
Lemma 2**.**
For any integers and , there exists generic positive constants such that
[TABLE]
and
[TABLE]
The following results entail that ; actually the Propositions below give also a uniform rate of convergence.
Lemma 3**.**
If ,
[TABLE]
The next result is technical; given the huge amount of work which has taken place on Legendre polynomials, we expect that the statement could be known already, but we failed to locate a reference and therefore we report a full proof for the sake of completeness.
Lemma 4**.**
Let ,
[TABLE]
on the other hand, for as ,
[TABLE]
We can now start with the proof of these Lemmas.
Proof (Lemma 1).
Let us start by observing that the -th element of , denoted by , has expected value
[TABLE]
Now, we have
[TABLE]
[TABLE]
Now observe , the squared autocorrelation function of the process, is nonnegative and summable; that is, there exists so that and
[TABLE]
in view of the Cauchy-Schwartz inequality. Thus, it holds that
[TABLE]
On the other hand,
[TABLE]
and
[TABLE]
since
[TABLE]
and
[TABLE]
see also [8]. Then, , uniformly over .
In conclusion, uniformly over and ,
[TABLE]
.
Let us now focus on the elements of ; they are given by
[TABLE]
These elements can be shown to satisfy the following properties:
- (i)
= 0; 2. (ii)
, since
[TABLE]
and because
[TABLE] 3. (iii)
.
To compute we use once again the multilinearity property of cumulants, the real expansion and the diagram formula, so that we obtain:
[TABLE]
with given by
[TABLE]
Hence,
[TABLE]
as claimed.
Proof (Lemma 2).
First, rewrite
[TABLE]
Since
[TABLE]
we have
[TABLE]
where
[TABLE]
and, from (3),
[TABLE]
By definition,
[TABLE]
Since is a real symmetric matrix,
[TABLE]
can be seen as the sum of independent matrix, i.e.
[TABLE]
where is a matrix, defined by (recalling that )
[TABLE]
Then,
[TABLE]
Now recall that is the matrix of autocorrelations; similarly we define as the matrix of autocorrelations. Both are invertible since we assumed that the spectral density
[TABLE]
is a continuous positive function.
is a zero-mean Gaussian matrix with and , therefore it can be written as , where is a zero-mean Gaussian matrix with independent rows. If , where is an orthogonal matrix of eigenvectors and is the diagonal matrix of eigenvalues, then
[TABLE]
where is a Wishart random matrix with degrees of freedom. The same argument applies to all components of (1), so that
[TABLE]
The summation in (1) includes independent Wishart random matrix each with degrees of freedom and as scale matrix, then is a Wishart random matrix with degrees of freedom and as scale matrix, and its minimum eigenvalue. Furthermore, this result guarantees the invertibility of the matrix .
By the standard inequality on trace and operator norms for matrices, we obtain that
[TABLE]
For the fourth moment of the trace of an inverse Wishart matrix is given in [26]:
[TABLE]
where , and
[TABLE]
If are the eigenvalues of , we have
[TABLE]
. Then, for ,
[TABLE]
and
[TABLE]
In addition,
[TABLE]
for every and . Thus, (6) holds.
The second part of this Lemma follows easily, indeed
[TABLE]
in view of the bounds that we just established on the fourth-moments of the norms of and .
Proof (Lemma 3).
We first need to prove that , where we recall that is the matrix of autocorrelations . For , , for all ; on the other hand, for ,
[TABLE]
and
[TABLE]
For ,
[TABLE]
Moreover, since
[TABLE]
and
[TABLE]
we have
[TABLE]
as claimed.
The last proof is for the technical Lemma on summation of squared Legendre polynomials.
Proof (Lemma 4).
For , by Hilb’s asymptotics (see [33],[35]), it holds that
[TABLE]
with . Then,
[TABLE]
In view of the standard identities
[TABLE]
and
[TABLE]
we have
[TABLE]
hence,
[TABLE]
Also, it holds that if , , then . As a consequence,
[TABLE]
Likewise, for ,
[TABLE]
As before, we have
[TABLE]
hence,
[TABLE]
In addition, since , we can then conclude that
[TABLE]
as .
Remark 5**.**
Note that (8) does not converge pointwise if or for instance, for we have whereas for , (4) oscillates among given constants.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Aue, A., van Delft, A. (2017) Testing for stationarity of functional time series in the frequency domain, ar Xiv preprint: 1701.01741
- 2[2] Baldi, P., Kerkyacharian, G., Marinucci, D., Picard, D. (2009) Asymptotics for spherical needlets, Annals of Statistics , 37, no. 3, 1150–1171.
- 3[3] Billingsley, P. (1999) Convergence of Probability Measures , second edition, Wiley Series in Probability and Statistics.
- 4[4] Berg, C., Porcu, E. (2017) From Schoenberg coefficients to Schoenberg functions, Constructive Approximations , 45, no. 2, 217–241.
- 5[5] Bosq, D. (2000) Linear processes in function spaces. Theory and applications. Lecture Notes in Statistics, 149, Springer-Verlag, New York.
- 6[6] Cammarota, V., Marinucci, D. (2015) On the limiting behaviour of needlets polyspectra, Ann. Inst. Henri Poincaré Probab. Stat. , 51, no. 3, 1159–1189.
- 7[7] Cammarota, V., Marinucci, D. (2018) A quantitative central limit theorem for the Euler-Poincaré characteristic of random spherical eigenfunctions, Annals of Probability , 46, n.6, 3188–3228
- 8[8] Caponera, A. (2019) Statistical Inference for Spherical Functional Autoregressions , Ph D Thesis, Sapienza University of Rome.
