Home Inference for the Analysis of Ordinal Data with Spatio-Temporal Models
Article
Licensed
Unlicensed Requires Authentication

Inference for the Analysis of Ordinal Data with Spatio-Temporal Models

  • F. Peraza-Garay , J. U. Márquez-Urbina and G. González-Farías EMAIL logo
Published/Copyright: April 3, 2020

Abstract

In this work, we propose a spatio-temporal Markovian-like model for ordinal observations to predict in time the spread of disease in a discrete rectangular grid of plants. This model is constructed from a logistic distribution and some simple assumptions that reflect the conditions present in a series of studies carried out to understand the dissemination of a particular infection in plants. After constructing the model, we establish conditions for the existence and uniqueness of the maximum likelihood estimator (MLE) of the model parameters. In addition, we show that, under further restrictions based on Partially Ordered Markov Models (POMMs), the MLE of the model is consistent and normally asymptotic. We then employ the MLE’s asymptotic normality to propose methods for testing spatio-temporal and spatial dependencies. The model is estimated from the real data on plants that inspired the model, and we used its results to construct prediction maps to better understand the transmission of plant illness in time and space.

Funding statement: This work was supported by the Consejo Nacional de Ciencia y Tecnología (Funder Id: http://dx.doi.org/10.13039/501100003141, Grant Number: CB-2015-01-252996).

A Appendix

In this appendix, we prove Theorem 4 and discuss some of its conditions.

Before starting, we need to introduce a definition. For each s m , k Δ m and m N such that t(k) > 0, let us define

(29) A ( m ) s m , k ; β A ( m ) s m , k ; β i , j 2 β 2 log p Z s m , k Z s m , l ( k ) , t ( k ) 1 , Z A s m , l ( k ) , t ( k ) 1 .

Recall we defined b ( m ) in eq. (18) in an analogous way. Equivalently, we can also define b ( m ) and A ( m ) for s m , l R m and t T { 0 } . Sometimes, when convenient, we might use this equivalent definition.

For m N and k = 1 , , ( τ + 1 ) | R m | , let F m , k σ ( Z ( s m , 1 ) , , Z ( s m , k ) ) be the σ-algebra generated by Z ( s m , 1 ) , , Z ( s m , k ) . Let s m , k Δ m and choose l = 1 , , | R m | and t T { 0 } such that s m , k = s m , l , t . From the Markov property in time and the assumptions (11)–(12), it follows that

(30) p ( z ( s m , k ) | F m , k 1 ) = p ( z ( s m , l , t ) | F m , k 1 ) = p ( z ( s m , l , t ) | z ( s m , l , t 1 ) , z ( A ( s m , l ) , t 1 ) ) = e = 1 E 1 G ( x s m , l , t 1 T β e ) 1 e + 1 ( z ( s m , l , t ) ) 1 G ( x s m , l , t 1 T β e ) 1 e ( z ( s m , l , t ) ) 1 e ( z ( s m , l , t 1 ) )

(31) = e = 1 E 1 1 e ( z ( s m , l , t 1 ) ) G ( x s m , l , t 1 T β e ) 1 e + 1 ( z ( s m , l , t ) ) 1 G ( x s m , l , t 1 T β e ) 1 e ( z ( s m , l , t ) ) .

Note that the support of the previous probability mass function is { min [ E , z ( s m , l , t 1 ) + 1 ] , z ( s m , l , t 1 ) } S = { 1 , , E } . Also, notice that the support of Z ( s m , k ) is S. Keeping in mind the first of these facts, we obtain the following regularity property.

Lemma 7.

Let s m , l R m and t ∈ T such that t  ≥ 1. Besides, let f ( ; β ) denote the conditional probability mass function of Z ( s m , l , t ) | Z ( s m , l , t 1 ) , Z ( A ( s m , l ) , t 1 ) . Then, for j = 1, 2, we see that

w = 1 E j β j f ( w ; β ) = j β j w = 1 E f ( w ; β ) = 0.

Proof.

Since the sums are over a finite support, the sum and the derivative commute. Also, since f ( ; β ) is a density with its support contained in S = {1,…, E}, the sum on the second expression is always 1. Therefore, as the derivative of a constant vanishes, we have concluded this proof.   ■

Lemma 7 implies that

E ( b ( m ) ( s m , k ; β ) F m , k 1 ) = 0 , E ( A ( m ) ( s m , k ; β ) F m , k 1 ) = v a r ( b ( m ) ( s m , k ; β ) F m , k 1 ) .

These equations imply the following result, as noted by Huang and Cressie [19].

Lemma 8.

Consider the log-likelihood given by (16) and suppose that the true value of the parameter β is β 0 . For each m N and k = 1 , 2 , , ( τ + 1 ) | R m | , let M m , k = i = 1 k b ( m ) ( s m , i ; β 0 ) and W m , k = i = 1 k A ( m ) ( s m , i ; β 0 ) E ( A ( m ) ( s m , i ; β ) F n , i 1 ) , where s m , i Δ m . Then, { M m , k , F m , k } and { W m , k , F m , k } are triangular martingale arrays

The following lemma is necessary to prove the consistency of the MLE of β .

Lemma 9.

Consider the log-likelihood function given by (16) and suppose the true value of the parameter β is β 0 . Assume that there exists ε0  > 0  such that

(32) lim m P λ m | Δ m | > ϵ 0 = 1 ,

and that X m , t 1 , e X m , t 1 , e T is positive definite for any m N , t = 1,…, τ and e = 1 , . . . E 1 . Then, the following holds:

  1. sup | Δ m | β β 0 1 1 | Δ m | i = 1 | Δ m | A ( m ) ( s m , i ; β ) A ( m ) ( s m , i ; β 0 ) P 0 , as m .

  2. sup m , i , j E b j ( m ) ( s m , i ; β 0 ) q < , for some q > 1.

  3. P 1 | Δ m | i = 1 | Δ m | c T A ( m ) ( s m , i ; β 0 ) c > ϵ 1 , as m , for any vector c R ( E 1 ) × ( E + 1 ) with c = 1 , and for some ε > 0.

  4. P 1 | Δ m | i = 1 | Δ m | A ( m ) ( s m , i ; β ) i s p o s i t i v e d e f i n i t e f o r a l l β 1 , as m .

Proof.

(i). For e = 1,…, n – 1, let A e ( m ) ( s m , i ; β ) be given by

A e ( m ) s m , i ; β = 2 β e 2 log p Z ( s m , i ) Z ( A ( s m , l ( i ) ) , t ( i ) 1 ) , Z ( s m , l ( i ) , t ( i ) 1 ) ;

that is, A e ( m ) ( s m , i ; β ) correspond to diagonal matrices on A ( m ) ( s m , i ; β ) . For e = 1, …, E – 1, direct computations imply that

A e ( m ) s m , i ; β = 1 e [ Z ( s m , l , t 1 ) ] 1 e [ Z ( s m , i ) ] + 1 e + 1 [ Z ( s m , i ) ] G ( u T β e ) u u T ,

where we assumed that s m , i s m , l , t and u x s m , l , t 1 . Observe that β 0 can be decomposed as β 0 = ( β 1 0 , β 2 0 , , β E 1 0 ) , where β i 0 is a vector of dimension E + 1; then, we can write

A e ( m ) s m , i ; β A e ( m ) s m , i ; β 0 = 1 e [ Z ( s m , l , t 1 ) ] 1 e [ Z ( s m , i ) ] + 1 e + 1 [ Z ( s m , i ) ] G ( u T β e ) G ( u T β e 0 ) u u T .

Since G is bounded, using the Mean Value Theorem and the Cauchy-Schwarz inequality, we deduce that there exists C > 0 such that

| G ( u T β e ) G ( u T β e 0 ) | C | u T ( β e β e 0 ) | C u T β e β e 0 C u T β β 0 .

Besides, since u x s m , l , t 1 counts the number of adjacent sites in the previous time that are in each state, there exists M > 0 with 0 < [ u ] j , [ u T u ] i j < M . Therefore, there exists a constant K > 0 such that

[ A e ( m ) s m , i ; β A e ( m ) s m , i ; β 0 ] i j C u T β β 0 1 e [ Z ( s m , l , t 1 ) ] 1 e [ Z ( s m , i ) ] + 1 e + 1 [ Z ( s m , i ) ] [ u u T ] i j K β β 0 ,

which implies

(33) lim m sup | Δ m | β β 0 ∥≤ 1 1 | Δ m | i = 1 | Δ m | A e ( m ) ( s m , i ; β ) A e ( m ) ( s m , i ; β 0 ) = 0 a . s .

For c, e = 1…, E – 1 such that e ≠ c, we see that

(34) 2 β e β c T log p Z ( s m , i ) Z ( A ( s m , l ( i ) ) , t ( i ) 1 ) , Z ( s m , l ( i ) , t ( i ) 1 ) = 0 ;

Therefore, from eq. (33) it follows that

lim m sup | Δ m | β β 0 1 1 | Δ m | i = 1 | Δ m | A ( m ) ( s m , i ; β ) A ( m ) ( s m , i ; β 0 ) = 0 a .s . ,

which implies the desired result (i).

(ii) Computing b j ( m ) ( s m , i ; β ) explicitly and repeating some arguments from above, it is easy to check that b j ( m ) ( s m , i ; β ) is bounded by a constant that is independent of the parameters m, i, j and β . This implies

sup m , i , j E b j ( m ) ( s m , i ; β 0 ) q < ,

for any q > 1.

(iii) From eq. (34), it follows that

A ( m ) ( s m , k ; β 0 ) = d i a g ( A 1 ( m ) ( s m , k ; β 0 ) , , A E 1 ( m ) ( s m , k ; β 0 ) ) .

Then, if c = ( c 1 , , c E 1 ) for c i R E + 1 , we obtain that

c T A ( m ) ( s m , k ; β 0 ) c = e = 1 E 1 c e T A e ( m ) ( s m , k ; β 0 ) c e = e = 1 E 1 1 e [ Z ( s m , l , t 1 ) ] 1 e [ Z ( s m , i ) ] + 1 e + 1 [ Z ( s m , i ) ] G ( u T β e 0 ) c e T u u T c e

where we assumed that s m , k s m , l , t and u x s m , l , t 1 .

If the random field Z is at state e at time t, in the following time it can only transition to the next state e + 1 or stay in the same state. Thus,

1 | Δ m | i = 1 | Δ m | c T A ( m ) ( s m , i ; β 0 ) c = 1 | Δ m | e = 1 E 1 t = 1 τ k { j : Z ( s m , j , t 1 ) = e } 1 e [ Z ( s m , k , t 1 ) ] + 1 e + 1 [ Z ( s m , k , t 1 ) ] × G ( x s m , k , t 1 T β e ) c e T x s m , k , t 1 x s m , k , t 1 T c e = 1 | Δ m | e = 1 E 1 t = 1 τ k { j : Z ( s m , j , t 1 ) = e } G ( x s m , k , t 1 T β e 0 ) c e T x s m , k , t 1 x s m , k , t 1 T c e a . s .

Since G’> 0 and [ x s m , i , t 1 ] i , j is bounded, there exists a constant g g ( β 0 ) > 0 , independent of m, such that

1 | Δ m | i = 1 | Δ m | c T A ( m ) ( s m , i ; β 0 ) c g | Δ m | e = 1 E 1 t = 1 τ k { j : Z ( s m , j , t 1 ) = e } c e T x s m , k , t 1 x s m , k , t 1 T c e = g | Δ m | e = 1 E 1 t = 1 τ c e T X m , t 1 , e X m , t 1 , e T c e a . s .

Besides, X m , t 1 , e X m , t 1 , e T is positive definite for m N , t = 1,…, τ and e = 1 , . . . E 1 ; which implies

g | Δ m | e = 1 E 1 t = 1 τ c e T X m , t 1 , e X m , t 1 , e T c e g | Δ m | e = 1 E 1 t = 1 τ λ m , t 1 , e c e 2 g τ | Δ m | λ m c 2 a . s .

Therefore, if c = 1 , we see that

1 | Δ m | i = 1 | Δ m | c T A ( m ) ( s m , i ; β 0 ) c g τ | Δ m | λ m a.s.

Thus, from eq. (32) it follows that

1 = lim m P λ m | Δ m | > ϵ 0 lim m P 1 | Δ m | i = 1 | Δ m | c T A ( m ) ( s m , i ; β 0 ) c ( g τ ) ϵ 0 ,

for any vector c R ( E 1 ) × ( E + 1 ) with c = 1 .

(iv) Let g ( β ) > 0 be a positive constant such that G ( x s m , i , t 1 T β ) > g ( β ) . Notice that the bounds we found in the proof of (iii) can be applied for any β , namely

c T 1 | Δ m | i = 1 | Δ m | A ( m ) ( s m , i ; β ) c = 1 | Δ m | i = 1 | Δ m | c T A ( m ) ( s m , i ; β ) c g ( β ) τ | Δ m | λ m c 2 > 0 a.s. ,

for any vector c R ( E 1 ) × ( E + 1 ) with c 0 . This implies the desired result.   ■

The following result is a direct consequence of Lemma 9 and Theorem 1 in Huang and Cressie [19].

Theorem 10.

Consider the log-likelihood function l m ( β ) given by (16) and suppose the true value of the parameter β is β 0 . Assume that there exists ε0 > 0 such that

(35) lim m P λ m | Δ m | > ϵ 0 = 1 ,

and that X m , t 1 , e X m , t 1 , e T is positive definite for any m N , t = 1,…, τ and e = 1 , . . . E 1 . Let β ˆ m be the MLE estimator of l m ( β ) . Then, β ˆ m exists and is consistent; that is, β ˆ m satisfies β ˆ m P β 0 .

Remark 11.

Under the conditions of Lemma 9, in the proof of such Lemma, we can observe that 1 | Δ m | i = 1 | Δ m | A ( m ) ( s m , i ; β ) is positive definite for all β and m N . Then, we can establish the existence of the MLE β ˆ m for any m. Under the conditions of Theorem 1 in Huang and Cressie [19], it is only possible to guarantee the existence of the MLE asymptotically.

Thus, according to Huang and Cressie [19], the MLE of our model will be a consistent and unique estimator of β 0 . The following theorem, also taken from Huang and Cressie [19], provides conditions for the MLE’s asymptotic normality.

Theorem 12.

Assume the conditions of Lemma 9 hold. Define

B m = v a r ( i = 1 | Δ m | b ( m ) ( s m , i ; β 0 ) ) ,

m N . Assume that, for all c = 1 ,

1 c T B m c i = 1 | Δ m | E c T b ( m ) ( s m , i ; β 0 ) 2 F m , i 1 P 1 ,

as m . Then, as m , B m 1 / 2 ( β ˆ m β 0 ) d N ( 0 , I ) .

Remark 13.

In Huang and Cressie [19], they ask that condition (ii) in Lemma 9 be valid for q > 2. In the proof of Lemma 9, we checked that, for our model, it is valid for any q > 1.

Using the bilinearity of the covariance and the properties of b ( m ) , it is possible to check that

E i = 1 | Δ m | E c T b ( m ) ( s m , i ; β 0 ) 2 F m , i 1 = c T B m c .

Verifying the convergence in probability is more difficult. However, simulation studies show that β ˆ m exhibits a normal behavior.

Huang and Cressie [19] establish conditions for the MLE’s normality assuming Dobrushin’s condition. This supposition imposes restrictions on β . This approach can be applied to our model.

References

[1] Besag J. Spatial interaction and the statistical analysis of lattice systems. J R Stat Soc: Ser B (Method). 1974;36:192–225.10.1111/j.2517-6161.1974.tb00999.xSearch in Google Scholar

[2] Besag J. Nearest-neighbour systems and the auto-logistic model for binary data. J R Stat Soc: Ser B (Method). 1972;34:75–83.10.1111/j.2517-6161.1972.tb00889.xSearch in Google Scholar

[3] Besag J. On the statistical analysis of dirty pictures. J R Stat Soc: Ser B (Method). 1986;48:259–79.10.1111/j.2517-6161.1986.tb01412.xSearch in Google Scholar

[4] Gumpertz ML, Graham JM, Ristaino JB. Autologistic model of spatial pattern of phytophthora epidemic in bell pepper: effects of soil variables on disease presence. J Agric, Biolo, Environ Stat. 1997;2:131–56.10.2307/1400400Search in Google Scholar

[5] Huffer FW, Wu H. Markov chain monte carlo for autologistic regression models with application to the distribution of plant species. Biometrics. 1998;54:509–24.10.2307/3109759Search in Google Scholar

[6] Heikkinen J, Högmander H. Fully bayesian approach to image restoration with an application in biogeography. J R Stat Socy: Ser C (Appl Stat). 1994;43:569–82.10.2307/2986258Search in Google Scholar

[7] Zhu W, Fan Y. A novel approach for markov random field with intractable normalizing constant on large lattices. J Comput Graphical Stat. 2018;27:59–70.10.1080/10618600.2017.1317263Search in Google Scholar

[8] Strauss D. Clustering on coloured lattices. J Appl Probab. 1977;14:135–43.10.2307/3213266Search in Google Scholar

[9] Kutsyy V, Nair VN. Modeling and inference for spatial processes with ordinal data. Ph.D. thesis, University of Michigan, 2001.Search in Google Scholar

[10] Linero AR, Bradley JR, Desai A. Multi-rubric models for ordinal spatial data with application to online ratings data. Ann Appl Stat. 2018;12:2054–74.10.1214/18-AOAS1143Search in Google Scholar

[11] Besag J. Some methods of statistical analysis for spatial data. Bull Int Statist Inst. 1978;47:77–92.Search in Google Scholar

[12] Zhu J, Huang H-C, Wu J.Modeling spatial-temporal binary data using markov random fields. J. Agric Biol Environ Stat. 2005;10:212.10.1198/108571105X46543Search in Google Scholar

[13] Zhu J, Zheng Y, Carroll AL, Aukema BH. Autologistic regression analysis of spatial-temporal binary data via monte carlo maximum likelihood. J Agric Biol Environ Stat. 2008;13:84–98.10.1198/108571108X273566Search in Google Scholar

[14] Wang Z, Zheng Y. Analysis of binary data via a centered spatial-temporal autologistic regression model. Environ Ecol Stat. 2013;20:37–57.10.1007/s10651-012-0206-3Search in Google Scholar

[15] Schliep EM, Lany NK, Zarnetske PL, Schaeffer RN, Orians CM, Orwig DA, et al. Joint species distribution modelling for spatio-temporal occurrence and ordinal abundance data. Global Ecol. Biogeogr. 2018;27:142–55.10.1111/geb.12666Search in Google Scholar

[16] Silvapulle MJ. On the existence of maximum likelihood estimators for the binomial response models. J R Stat Soc. Ser B (Method). 1981;43:310–3.10.1111/j.2517-6161.1981.tb01676.xSearch in Google Scholar

[17] Cressie N, Davidson JL. Image analysis with partially ordered markov models. Comput Stat Data Anal. 1998;29:1–26.10.1016/S0167-9473(98)00052-8Search in Google Scholar

[18] Davidson JL, Cressie N, Hua X. Texture synthesis and pattern recognition for partially ordered markov models. Pattern Recogn. 1999;32:1475–505.10.1016/S0031-3203(99)00016-3Search in Google Scholar

[19] Huang H-C, Cressie N. Asymptotic properties of maximum (composite) likelihood estimators for partially ordered Markov models. Statistica Sinica. 2000;10:1325–1344, http://www.jstor.org/stable/24306782.Search in Google Scholar

[20] Deveaux V. Partially oriented markov models. Geometrical approach of Probabilistic Cellular Automata, Ph.D. thesis, Université de Rouen, 2008.Search in Google Scholar

[21] Deveaux V, Fernández R. Partially ordered models. J Stat Phys. 2010;141:476–516.10.1007/s10955-010-0063-0Search in Google Scholar

[22] Hammersley JM, Clifford P. Markov fields on finite graphs and lattices. Unpublished, 1971.Search in Google Scholar

[23] Strauss D. The many faces of logistic regression. Am Stat. 1992;46:321–7.10.1080/00031305.1992.10475920Search in Google Scholar

[24] Severini TA. Likelihood methods in statistics. New York: Oxford University Press, 2000.10.1093/oso/9780198506508.001.0001Search in Google Scholar

[25] Gil-Vega K, González-Chavira M, Martínez-de la Vega O, Simpson J, Vandemark G. Analysis of genetic diversity in agave tequilana var. azul using rapd markers. Euphytica. 2001;119:335–41.10.1023/A:1017553107303Search in Google Scholar

[26] Alegria M, González V. Mientras el tequila repunta en el mundo, el agave padece enfermedades en su tierra. Gaceta Universitaria, Universidad de Guadalajara. 1998:10, http://148.202.105.20/dgmgac/Hemeroteca/paginas/86/10-86.pdf.Search in Google Scholar

[27] Jiménez-Hidalgo I, Virgen-Calleros G, Martinez-de La Vega O, Vandemark G, Olalde-Portugal V. Identification and characterisation of bacteria causing soft-rot in agave tequilana. Eur J Plant Pathol. 2004;110:317–31.10.1023/B:EJPP.0000019791.81935.6dSearch in Google Scholar

[28] Ramírez-Ramírez MJ, Mancilla-Margalli NA, Meza-Álvarez L, Turincio-Tadeo R, Guzmán-de Pena D, Avila-Miranda EM. Epidemiology of fusarium agave wilt in agave tequilana weber var. azul. Plant Prot Sci. 2017;53:144–52.10.17221/142/2016-PPSSearch in Google Scholar

Received: 2019-09-05
Revised: 2020-01-14
Accepted: 2020-02-21
Published Online: 2020-04-03

© 2020 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 22.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/ijb-2019-0101/html?lang=en
Scroll to top button