Home Estimations of Means and Variances in a Markov Linear Model
Article
Licensed
Unlicensed Requires Authentication

Estimations of Means and Variances in a Markov Linear Model

  • Abraham Gutierrez and Sebastian Müller EMAIL logo
Published/Copyright: March 12, 2022
Become an author with De Gruyter Brill

Abstract

Multivariate regression models and ANOVA are probably the most frequently applied methods of all statistical analyses. We study the case where the predictors are qualitative variables and the response variable is quantitative. In this case, we propose an alternative to the classic approaches that does not assume homoscedasticity but assumes that a Markov chain can describe the covariates’ correlations. This approach transforms the dependent covariates using a change of measure to independent covariates. The transformed estimates allow a pairwise comparison of the mean and variance of the contribution of different values of the covariates. We show that, under standard moment conditions, the estimators are asymptotically normally distributed. We test our method with data from simulations and apply it to several classic data sets.

MSC 2010: 62H12; 62J99; 62M05; 60F05; 60J20

Funding source: Austrian Science Fund

Award Identifier / Grant number: FWF P29355-N35

Funding statement: A. Gutierrez acknowledges financial support from the Austrian Science Fund (FWF P29355-N35).

A A Multidimensional Version of Anscombe’s Theorem

We give a multidimensional version of the classical Anscombe theorem. The proof follows with simple modification the argument given by Renyi in his proof of Anscombe’s theorem [6]; it is presented here for the sake of completeness.

Theorem 15

Theorem 15 (Multidimensional Anscombe)

Let Y ( i ) := ( Y 1 ( i ) , Y 2 ( i ) , , Y m ( i ) ) for i 1 be a sequence of i.i.d. real-valued random vectors with E [ Y ( i ) ] = 0 R m and covariance matrix Σ. Let N ( t ) be a random integer-valued random variable such that N ( t ) t t a.s. θ R + . Then

1 N ( t ) i = 1 N ( t ) Y ( i ) t distr. N ( 0 , Σ ) .

Proof

Let n ( t ) := θ t , S k := i = 1 k Y ( i ) , and S k ( j ) = i = 1 k Y j ( i ) . Then

(A.1) S N ( t ) N ( t ) = ( ( S n ( t ) ( 1 ) n ( t ) + S N ( t ) ( 1 ) - S n ( t ) ( 1 ) n ( t ) ) n ( t ) N ( t ) , , ( S n ( t ) ( m ) n ( t ) + S N ( t ) ( m ) - S n ( t ) ( m ) n ( t ) ) n ( t ) N ( t ) ) .

The first observation is that, since n ( t ) is deterministic, due to the multidimensional central limit theorem, we have that

( S n ( t ) ( 1 ) n ( t ) , , S n ( t ) ( m ) n ( t ) ) t distr. N ( 0 , Σ ) ,

where Σ is the covariance matrix of the random vector Y ( 1 ) . Next, let ε ( 0 , 1 3 ) be given and

n 1 ( t ) := n ( t ) ( 1 - ε 3 ) + 1 and n 2 ( t ) := n ( t ) ( 1 + ε 3 ) .

Then

(A.2) P [ i = 1 m { | S N ( t ) ( i ) - S n ( t ) ( i ) | > ε n } ] i = 1 m P [ | S N ( t ) ( i ) - S n ( t ) ( i ) | > ε n ]

by the union bound. Let σ i 2 := E [ ( Y i ( 1 ) ) 2 ] < . Then we also know that

P [ | S N ( t ) ( i ) - S n ( t ) ( i ) | > ε n ( t ) ] = P [ | S N ( t ) ( i ) - S n ( t ) ( i ) | > ε n ( t ) , N ( t ) [ n 1 ( t ) , n 2 ( t ) ] ] + P [ | S N ( t ) ( i ) - S n ( t ) ( i ) | > ε n ( t ) , N ( t ) [ n 1 ( t ) , n 2 ( t ) ] ] P [ max n 1 ( t ) n n ( t ) | S n ( i ) - S n ( t ) ( i ) | > ε n ( t ) ] + P [ max n ( t ) n n 2 ( t ) | S n ( i ) - S n ( t ) ( i ) | > ε n ( t ) ] + P [ N ( t ) [ n 1 ( t ) , n 2 ( t ) ] ] ( n ( t ) - n 1 ( t ) ) σ i 2 ε 2 n ( t ) + ( n 2 ( t ) - n ( t ) ) σ i 2 ε 2 n ( t ) (Kolmogorov’s inequality) + P [ N ( t ) [ n 1 ( t ) , n 2 ( t ) ] ] 3 ε

for all i = 1 , , m , where the last inequality is valid for 𝑡 sufficiently large. Plugging this last estimation in inequality (A.2) yields, for 𝑡 sufficiently large,

P [ i = i m { | S N ( t ) ( i ) - S n ( t ) ( i ) | > ε n } ] 3 m ε

for any ε ( 0 , 1 3 ) . Since 𝜀 can be chosen arbitrarily small, we deduce that

( S N ( t ) ( 1 ) - S n ( t ) ( 1 ) n ( t ) , , S N ( t ) ( m ) - S n ( t ) ( m ) n ( t ) ) t prob. ( 0 , 0 , , 0 ) .

By noticing that n ( t ) N ( t ) t prob. 1 and using the multidimensional version of Slutsky’s theorem [13, Lemma 2.8], we deduce that

n ( t ) N ( t ) ( S N ( t ) ( 1 ) - S n ( t ) ( 1 ) n ( t ) , , S N ( t ) ( m ) - S n ( t ) ( m ) n ( t ) ) t prob. ( 0 , 0 , , 0 ) ,

where the last convergence is indeed in probability since it is a convergence in distribution to a constant. Using this last equation, equation (A.1), and the multidimensional Slutsky theorem, we conclude that

S N ( t ) N ( t ) t distr. N ( 0 , Σ ) .

B An Anscombe Version of the Multivariate Delta Method

We present a modification of the multivariate delta method for the case when 𝑛 is replaced by a random variable. The proof is a simple modification of the proof of the standard delta method. We give it for the sake of completeness.

Theorem 16

Theorem 16 (Anscombe’s Multivariate Delta Method)

Let θ R k , and let { T n } n N be a sequence of 𝑘-dimensional random vectors and { X n } n N a sequence of natural-valued random variables such that

X n ( T X n - θ ) n distr. N k ( 0 , Σ ) , T X n n prob. θ

Furthermore, let h : R k R m be once differentiable at 𝜃 with the gradient matrix h ( θ ) . Then

X n ( h ( T X n ) - h ( θ ) ) n distr. N k ( 0 , h ( θ ) T Σ h ( θ ) ) .

Proof

By the definition of differentiability of a vector field, we have that

h ( x ) = h ( θ ) + ( x - θ ) h ( θ ) + | x - θ | R 2 ( x ) ,

where | R 2 ( x ) | x θ 0 . In particular, we have that

(B.1) X n ( h ( T X n ) - h ( θ ) ) = X n ( T X n - θ ) h ( θ ) + ( X n | T X n - θ | ) R 2 ( T X n ) .

On the other hand, it follows from the assumptions and the definition of R 2 that

X n ( T X n - θ ) = ( X n ( T X n - θ ) ) n distr. N k ( 0 , Σ ) , R 2 ( T X n ) n prob. 0 .

Therefore, using the multidimensional Slutsky theorem [13, Lemma 2.8], we get that

(B.2) ( X n | T X n - θ | ) R 2 ( T X n ) n prob. 0 ,

where the last convergence is in probability because it is towards a constant. Using once more the multidimensional Slutsky theorem together with equations (B.1), (B.2), we conclude that

X n ( h ( T X n ) - h ( θ ) ) n distr. N k ( 0 , h ( θ ) T Σ h ( θ ) ) .

Acknowledgements

The authors wish to thank Alessandro Chiancone, Herwig Friedl, Jérôme Depauw, and Marc Peigné for stimulating discussions during this project. Grateful acknowledgment is made for hospitality from TU-Graz where the research was carried out during visits of S. Müller.

References

[1] J. R. Bang-Jensen and G. Gutin, Digraphs. Theory, Algorithms and Applications, 2nd ed., Springer Monogr. Math., Springer, London, 2009. 10.1007/978-1-84800-998-1Search in Google Scholar

[2] D. Bohme, M. Geimer, F. Wolf and L. Arnold, Identifying the root causes of wait states in large-scale parallel applications, ACM Trans. Parallel Comput. 3 (2016), no. 2, 1–24. 10.1109/ICPP.2010.18Search in Google Scholar

[3] E. W. Crampton, The growth of the odontoblasts of the incisor tooth as a criterion of the vitamin c intake of the Guinea pig: Five figures, J. Nutrition 33 (1947), no. 5, 491–504. 10.1093/jn/33.5.491Search in Google Scholar PubMed

[4] N. R. Draper and F. Pukelsheim, An overview of design of experiments, Statist. Papers 37 (1996), no. 1, 1–32. 10.1007/BF02926157Search in Google Scholar

[5] M. C. Greenwood, Intermediate Statistics with R, Version 2.2, 2020. Search in Google Scholar

[6] A. Gut, Stopped Random Walks. Limit Theorems and Applications, 2nd ed., Springer Ser. Oper. Res. Financ. Eng., Springer, New York, 2009. 10.1007/978-0-387-87835-5Search in Google Scholar

[7] A. Gutierrez and S. Müller, Quality analysis in acyclic production networks, Stoch. Qual. Control 34 (2019), no. 2, 59–66. 10.1515/eqc-2019-0014Search in Google Scholar

[8] C. Li and H. Li, Variable selection and regression analysis for graph-structured covariates with an application to genomics, Ann. Appl. Stat. 4 (2010), no. 3, 1498–1516. 10.1214/10-AOAS332Search in Google Scholar PubMed PubMed Central

[9] P. J. Rosopa, M. M. Schaffer and A. N. Schroeder, Managing heteroscedasticity in general linear models, Psychol. Methods 18 (2013), no. 3, 335–351. 10.1037/a0032553Search in Google Scholar PubMed

[10] M. Schulz, Extracting critical path graphs from mpi applications, 2005 IEEE International Conference on Cluster Computing, IEEE Press, Piscataway (2005), 1–10. 10.1109/CLUSTR.2005.347035Search in Google Scholar

[11] D. Selvamuthu and D. Das, Introduction to Statistical Methods, Design of Experiments and Statistical Quality Control, Springer, Singapore, 2018. 10.1007/978-981-13-1736-1Search in Google Scholar

[12] M. Turzanska, K. Sokolowska and M. C. Nilsson, Symplasmic and apoplasmic transport inside feather moss stems of pleurozium schreberi and hylocomium splendens, Ann. Botany 120 (2017), no. 5, 1805–817. 10.1093/aob/mcx102Search in Google Scholar

[13] A. W. van der Vaart, Asymptotic Statistics, Camb. Ser. Stat. Probab. Math. 3, Cambridge University, Cambridge, 1998. 10.1017/CBO9780511802256Search in Google Scholar

[14] R Documentation, https://stat.ethz.ch/R-manual/R-patched/library/datasets/html/ToothGrowth.html. Search in Google Scholar

[15] R Documentation, https://www.rdocumentation.org/packages/aer/versions/1.2-9/topics/caschools. Search in Google Scholar

Received: 2022-01-11
Accepted: 2022-01-23
Published Online: 2022-03-12
Published in Print: 2022-06-01

© 2022 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 3.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/eqc-2022-0004/html
Scroll to top button