You are currently viewing a new version of our website. To view the old version click .
Computer Sciences & Mathematics Forum
  • Proceeding Paper
  • Open Access

31 July 2025

Modelling Crime Data Using the Non-Stationary Bivariate Integer-Valued Autoregressive (BINAR(1)) Models with Poisson-Lindley (PL) Innovations †

,
,
and
1
Department of Accounting Finance and Economics, University of Technology Mauritius, Port Louis 11318, Mauritius
2
Department of Economics and Statistics, University of Mauritius, Reduit 80832, Mauritius
3
Department of Statistics, Cochin University of Science and Technology, Cochin 682001, India
4
Department of Informatics, University of Pretoria, Pretoria 0025, South Africa
This article belongs to the Proceedings The 11th International Conference on Time Series and Forecasting

Abstract

This paper proposes a family of first order bivariate integer-valued autoregressive (BINAR(1)) with Poisson Lindley innovations (BINAR(1)PL). The model parameters are estimated using the conditional maximum likelihood (CML) estimation approach. The proposed models are applied on some real life crime data.

1. Introduction

New first-order autoregressive models (INAR(1)) with various innovation and marginal distributions are constantly being added to the literature on integer-valued time series. Inspired by McKenzie’s work [1] on discrete-valued ARIMA models, a number of INAR(1) models put out that are based on generalized thinning techniques, such as the binomial [2] for overdispersed series counting. Livio et al.’s introduced an INAR(1) with the Poisson–Lindley (PL) innovations (INAR(1)PL) [3] to model overdispersed series because INAR(1)PL produces better AICs than some of their peers, including PLINAR(1) in Mohammadpour et al. [4] and NGINAR(1) in Ristic et al. [5]. As for the bivariate INAR(1) (BINAR(1)) models, we have the work by Mamode Khan et al. [6] which introduce a class of BINAR(1)PL models under different cross-correlation functions and show that their models provide superior model fitness criteria than other competing INAR(1) models. However, all the above models have been developed under stationary assumptions, which is not applicable to real life situations.
The PL distribution is appropriate for unimodality, overdispersion, and infinite divisibility since it is a member of the compound Poisson distribution family (for further information, see Mohammadpour et al. [4]). The superiority of the AICs under the integer-valued bilinear time series model with the PL distribution under the binomial thinning and Pegram operations was recently observed by Mohammadpour et al. [7]. The INAR(1)PL is a promising model for analyzing bivariate integer-valued autoregressive series of order 1 (BINAR(1)) with PL innovations (BINAR(1)PL) because of these characteristics. Hence, this paper proposed a new class of constrained and unconstrained BINAR(1)PL models under non-stationary assumptions. The conditional maximum likelihood (CML) approach is used to estimate the model parameters.
The organisation of the paper is as follows: Section 2 provides the model construction of the proposed class of constrained and unconstrained BINAR(1) PL models. The moments are derived under non-stationary assumptions. In Section 3, the CML method is used to estimate the model parameters. A simulation experiment is presented in Section 4 and the conclusion in Section 5.

2. Model Development

2.1. INAR(1)PL Model

Consider
Y t = ρ Y t 1 + ϵ t
where ρ [0, 1] and ρ Y t 1 indicates the binomial thinning operation [8]. In the above INAR(1) model, ϵ t PL ( θ t ) , where E ( ϵ t ) = ( θ t + 2 ) θ t ( 1 + θ t ) and Var ( ϵ t ) = E ( ϵ t ) [ 1 + c t ] = θ t 3 + 4 θ t 2 + 6 θ t + 2 θ t ( θ t + 1 ) 2 , where c t = θ t 2 + 4 θ t + 2 θ t ( θ t + 1 ) ( θ t + 2 ) .
Based on the above assumptions, it is proved that
E ( Y t ) = ρ E ( Y t 1 ) + E ( ϵ t ) E ( Y t ) = ρ E ( Y t 1 ) + ( θ t + 2 ) θ t ( 1 + θ t )
For t = 1 , we assume E ( Y 0 ) = E ( Y 1 ) , we have
E ( Y 1 ) = ( θ 1 + 2 ) θ 1 ( 1 + θ 1 ) ( 1 ρ )
For t = 2 , , T , E ( Y t ) is computed iteratively using Equation (2).
V a r ( Y t ) = ρ ( 1 ρ ) E ( Y t 1 ) + ρ 2 V a r ( Y t 1 ) + V a r ( ϵ t ) V a r ( Y t ) = ρ ( 1 ρ ) E ( Y t 1 ) + ρ 2 V a r ( Y t 1 ) + θ t 3 + 4 θ t 2 + 6 θ t + 2 θ t ( θ t + 1 ) 2
For t = 1 , we assume V a r ( Y 0 ) = V a r ( Y 1 ) , we have
V a r ( Y 1 ) = E ( Y 1 ) 1 + θ 1 2 + 4 θ 1 + 2 θ 1 ( θ 1 + 1 ) ( θ 1 + 2 ) ( 1 + ρ )
For t = 2 , , T , V a r ( Y t ) is computed iteratively using Equation (4).

2.2. Constrained BINAR(1)PL Model

The constrained BINAR(1) model is specified as
Y t [ 1 ] = ρ 1 Y t 1 [ 1 ] + ϵ t [ 1 ] ,
Y t [ 2 ] = ρ 2 Y t 1 [ 2 ] + ϵ t [ 2 ]
where ρ k [0, 1], for k ∈ { 1 , 2 } . Once again, ρ k Y t 1 [ k ] indicates the binomial thinning operation such that { ρ k Y t 1 [ k ] | Y t 1 [ k ] } B i n o m i a l ( Y t 1 [ k ] , ρ k ) [8,9,10]. The distribution of the innovation terms are as follows: ϵ t [ k ] PL ( θ t [ k ] ) , where E ( ϵ t [ k ] ) = ( θ t [ k ] + 2 ) θ t [ k ] ( 1 + θ t [ k ] ) and Var ( ϵ t [ k ] ) = E ( ϵ t [ k ] ) [ 1 + c t [ k ] ] = ( θ t [ k ] ) 3 + 4 ( θ t [ k ] ) 2 + 6 θ t [ k ] + 2 θ t [ k ] ( θ t [ k ] + 1 ) 2 , where c t [ k ] = ( θ t [ k ] ) 2 + 4 θ t [ k ] + 2 θ t [ k ] ( θ t [ k ] + 1 ) ( θ t [ k ] + 2 ) .
Based on the above conditions, it can be shown that
E ( Y t [ k ] ) = ρ k E ( Y t 1 [ k ] ) + E ( ϵ t [ k ] ) E ( Y t [ k ] ) = ρ k E ( Y t 1 [ k ] ) + ( θ t [ k ] + 2 ) θ t [ k ] ( 1 + θ t [ k ] )
For t = 1 , we assume E ( Y 0 [ k ] ) = E ( Y 1 [ k ] ) , we have
E ( Y 1 [ k ] ) = ( θ 1 [ k ] + 2 ) θ 1 [ k ] ( 1 + θ 1 [ k ] ) ( 1 ρ k )
For t = 2 , , T , E ( Y t ) is computed iteratively using Equation (10).
V a r ( Y t [ k ] ) = ρ k ( 1 ρ k ) E ( Y t 1 [ k ] ) + ρ k 2 V a r ( Y t 1 [ k ] ) + V a r ( ϵ t [ k ] )
For t = 1 , we assume V a r ( Y 0 ) = V a r ( Y 1 ) , we have
V a r ( Y 1 ) = ρ k ( 1 ρ k ) E ( Y 1 [ k ] ) + V a r ( ϵ 1 [ k ] ) ( 1 ρ k 2 ) = ρ k ( 1 ρ k ) ( θ 1 [ k ] + 2 ) θ 1 [ k ] ( 1 + θ 1 [ k ] ) ( 1 ρ k ) + ( θ 1 [ k ] ) 3 + 4 ( θ 1 [ k ] ) 2 + 6 θ 1 [ k ] + 2 θ 1 [ k ] ( θ 1 [ k ] + 1 ) 2 1 ρ k 2
For t = 2 , , T , V a r ( Y t ) is computed iteratively using Equation (4).
Cov ( Y t [ 1 ] , Y t [ 2 ] ) = ρ 1 ρ 2 Cov ( Y t 1 [ 1 ] , Y t 1 [ 2 ] ) + Cov ( ϵ t [ 1 ] , ϵ t [ 2 ] )
where Cov ( ϵ t [ 1 ] , ϵ t [ 2 ] ) = ρ 12 ( R t , t [ 1 ] θ t [ 1 ] R t [ 1 ] ) ( R t , t [ 2 ] θ t [ 2 ] R t [ 2 ] ) , where R t [ k ] = ( θ t [ k ] ) 2 1 + θ t [ k ] θ t [ k ] + 2 exp ( 1 ) ( θ t [ k ] + 1 exp ( 1 ) ) 2 and R t , t [ k ] = ( θ t [ k ] ) 2 1 + θ t [ k ] θ t [ k ] exp ( 1 ) exp ( 2 ) + 3 exp ( 1 ) ( θ t [ k ] + 1 exp ( 1 ) ) 3 . For t = 1 , we assume Cov ( Y 0 [ 1 ] , Y 0 [ 2 ] ) = Cov ( Y 1 [ 1 ] , Y 1 [ 2 ] ) , we have
Cov ( Y 1 [ 1 ] , Y 1 [ 2 ] ) = Cov ( ϵ 1 [ 1 ] , ϵ 1 [ 2 ] ) ( 1 ρ 1 ρ 2 )
For t = 2 , , T , Cov ( Y t [ 1 ] , Y t [ 2 ] ) is computed iteratively using Equation (13).
The forecasting equation for the constrained BINAR(1)PL model is given by
E ( Y t [ k ] | Y t 1 [ k ] ) = ρ ^ k Y t 1 [ k ] + ( θ ^ t [ k ] + 2 ) θ ^ t [ k ] ( 1 + θ ^ t [ k ] )

2.3. The Unconstrained BINAR(1)PL Model

Consider the unconstrained BINAR(1)PL Model with full correlation structure:
Y t [ 1 ] = ρ 11 Y t 1 [ 1 ] + ρ 12 Y t 1 [ 2 ] + R t [ 1 ] ,
Y t [ 2 ] = ρ 21 Y t 1 [ 1 ] + ρ 22 Y t 1 [ 2 ] + R t [ 2 ] ,
with similar assumptions of the model paramters as the constrained BINAR(1)PL model in Section 2.2. ϵ t [ k ] PL ( θ t [ k ] ) , where E ( ϵ t [ k ] ) = ( θ t [ k ] + 2 ) θ t [ k ] ( 1 + θ t [ k ] ) and Var ( ϵ t [ k ] ) = E ( ϵ t [ k ] ) [ 1 + c t [ k ] ] = ( θ t [ k ] ) 3 + 4 ( θ t [ k ] ) 2 + 6 θ t [ k ] + 2 θ t [ k ] ( θ t [ k ] + 1 ) 2 , where c t [ k ] = ( θ t [ k ] ) 2 + 4 θ t [ k ] + 2 θ t [ k ] ( θ t [ k ] + 1 ) ( θ t [ k ] + 2 ) .
Based on the above conditions, the moments are derived as follows:
E ( Y t [ 1 ] ) = ρ 11 E ( Y t 1 [ 1 ] ) + ρ 12 E ( Y t 1 [ 2 ] ) + E ( R t [ 1 ] )
E ( Y t [ 2 ] ) = ρ 21 E ( Y t 1 [ 1 ] ) + ρ 22 E ( Y t 1 [ 2 ] ) + E ( R t [ 2 ] )
For t = 1 , we assume E ( Y 0 [ k ] ) = E ( Y 1 [ k ] ) , we have
E ( Y 1 [ 1 ] ) = ρ 12 E ( Y 1 [ 2 ] ) + ( θ 1 [ 1 ] + 2 ) θ 1 [ 1 ] ( 1 + θ 1 [ 1 ] ) 1 ρ 11
E ( Y 1 [ 2 ] ) = ρ 21 E ( Y 1 [ 1 ] ) + ( θ 1 [ 2 ] + 2 ) θ 1 [ 2 ] ( 1 + θ 1 [ 2 ] ) 1 ρ 22
By solving Equations (19) and (20), we obtain
E ( Y 1 [ 1 ] ) = ρ 12 ( θ 1 [ 2 ] + 2 ) θ 1 [ 2 ] ( θ 1 [ 2 ] + 1 ) + ( θ 1 [ 1 ] + 2 ) ( 1 ρ 22 ) θ 1 [ 1 ] ( 1 + θ 1 [ 1 ] ) ( 1 ρ 11 ) ( 1 ρ 22 ) ρ 12 ρ 21
E ( Y 1 [ 2 ] ) = ρ 21 ( θ 1 [ 1 ] + 2 ) θ 1 [ 1 ] ( θ 1 [ 1 ] + 1 ) + ( θ 1 [ 2 ] + 2 ) ( 1 ρ 22 ) θ 1 [ 2 ] ( 1 + θ 1 [ 2 ] ) ( 1 ρ 11 ) ( 1 ρ 22 ) ρ 12 ρ 21
For t = 2 , , T , E ( Y t [ k ] ) is computed iteratively using Equations (17) and (18).
V a r ( Y t [ 1 ] ) = ρ 11 ( 1 ρ 11 ) E ( Y t 1 [ 1 ] ) + ρ 11 2 V a r ( Y t 1 [ 1 ] ) + ρ 12 ( 1 ρ 12 ) E ( Y t 1 [ 2 ] ) + ρ 12 2 V a r ( Y t 1 [ 2 ] ) + V a r ( ϵ t [ 1 ] ) + 2 ρ 11 ρ 12 C o v ( Y t 1 [ 1 ] , Y t 1 [ 2 ] )
V a r ( Y t [ 2 ] ) = ρ 21 ( 1 ρ 21 ) E ( Y t 1 [ 1 ] ) + ρ 21 2 V a r ( Y t 1 [ 1 ] ) + ρ 22 ( 1 ρ 22 ) E ( Y t 1 [ 2 ] ) + ρ 22 2 V a r ( Y t 1 [ 2 ] ) + V a r ( ϵ t [ 2 ] ) + 2 ρ 21 ρ 22 C o v ( Y t 1 [ 1 ] , Y t 1 [ 2 ] )
For t = 1 , we assume V a r ( Y 0 [ k ] ) = V a r ( Y 1 [ k ] ) , E ( Y 0 [ k ] ) = E ( Y 1 [ k ] ) , C o v ( Y 0 [ 1 ] , Y 0 [ 2 ] ) = C o v ( Y 1 [ 1 ] , Y 1 [ 2 ] ) we have
V a r ( Y 1 [ 1 ] ) = ρ 11 ( 1 ρ 11 ) E ( Y 1 [ 1 ] ) + ρ 12 ( 1 ρ 12 ) E ( Y 1 [ 2 ] ) + ρ 12 2 V a r ( Y 1 [ 2 ] ) ( 1 ρ 11 2 ) + V a r ( ϵ 1 [ 1 ] ) + 2 ρ 11 ρ 12 C o v ( Y 1 [ 1 ] , Y 1 [ 2 ] ) ( 1 ρ 11 2 )
V a r ( Y 1 [ 2 ] ) = ρ 21 ( 1 ρ 21 ) E ( Y 1 [ 1 ] ) + ρ 21 2 V a r ( Y 1 [ 1 ] ) + ρ 22 ( 1 ρ 22 ) E ( Y 1 [ 2 ] ) ( 1 ρ 22 2 ) + V a r ( ϵ 1 [ 2 ] ) + 2 ρ 21 ρ 22 C o v ( Y 1 [ 1 ] , Y 1 [ 2 ] ) ( 1 ρ 22 2 )
Explicit expressions for V a r ( Y 1 [ 1 ] ) and V a r ( Y 1 [ 2 ] ) are obtained by solving Equations (25) and (26). For t = 2 , , T , V a r ( Y t [ k ] ) is computed iteratively using Equations (23) and (24).
Cov ( Y t [ 1 ] , Y t [ 2 ] ) = ρ 11 ρ 21 V a r ( Y t 1 [ 1 ] ) + ρ 12 ρ 22 V a r ( Y t 1 [ 2 ] ) + ( ρ 12 ρ 21 + ρ 11 ρ 22 ) Cov ( Y t 1 [ 1 ] , Y t 1 [ 2 ] )
For t = 1 , we assume Cov ( Y 0 [ 1 ] , Y 0 [ 2 ] ) = Cov ( Y 1 [ 1 ] , Y 1 [ 2 ] ) , V a r ( Y 0 [ k ] ) = V a r ( Y 1 [ k ] ) , we have
Cov ( Y 1 [ 1 ] , Y 1 [ 2 ] ) = ρ 11 ρ 21 V a r ( Y 1 [ 1 ] ) + ρ 12 ρ 22 V a r ( Y 1 [ 2 ] ) ( 1 ρ 12 ρ 21 ρ 11 ρ 22 )
For t = 2 , , T , Cov ( Y t [ 1 ] , Y t [ 2 ] ) is computed iteratively using Equation (27).
The forecasting equations for the unconstrained BINAR(1)PL model are given by
E ( Y t [ 1 ] | Y t 1 [ 1 ] , Y t 1 [ 2 ] ) = ρ ^ 11 Y t 1 [ 1 ] + ρ ^ 12 Y t 1 [ 2 ] + ( θ ^ t [ 1 ] + 2 ) θ ^ t [ 1 ] ( 1 + θ ^ t [ 1 ] )
E ( Y t [ 2 ] | Y t 1 [ 1 ] , Y t 1 [ 2 ] ) = ρ ^ 21 Y t 1 [ 1 ] + ρ ^ 22 Y t 1 [ 2 ] + ( θ ^ t [ 2 ] + 2 ) θ ^ t [ 2 ] ( 1 + θ ^ t [ 2 ] )

3. Estimation Method

This section proposes the CML approach to estimate the unknown parameters of the model. Using the convolution property [11], the conditional distribution function is given by
f ( y t [ 1 ] y t [ 2 ] | y t 1 [ 1 ] , y t 1 [ 2 ] ) = k = 0 u j = 0 v f 1 ( k ) f 2 ( s ) P ( R t [ 1 ] = y t [ 1 ] k ) P ( R t [ 2 ] = y t [ 2 ] s )
where u = m i n ( Y t [ 1 ] Y t 1 [ 1 ] ) and v = m i n ( Y t [ 2 ] Y t 1 [ 2 ] ) . Here, we define
f 1 ( k ) = j 1 = 0 k y t 1 [ 1 ] j 1 y t 1 [ 2 ] k j 1 ρ 11 j 1 ( 1 ρ 11 ) y t 1 [ 1 ] j 1 ρ 12 k j 1 ( 1 ρ 12 ) y t 1 [ 2 ] k + j 1
f 2 ( s ) = j 2 = 0 s y t 1 [ 2 ] j 2 y t 1 [ 1 ] s j 2 ρ 22 j 2 ( 1 ρ 22 ) y t 1 [ 2 ] j 2 ρ 21 s j 2 ( 1 ρ 21 ) y t 1 [ 1 ] s + j 2
Then, we can write the conditional likelihood function as L ( ϵ ) = t = 2 T f ( Y t [ 1 ] , Y t [ 2 ] | y t 1 [ 1 ] , Y t 1 [ 2 ] ) . The maximization of L ( ϵ ) is done using the standard o p t i m routine in R with quasi-Newton approaches (BFGS).

4. Data Application

In this section, the constrained and unconstrained BINAR(1)PL model is applied on a monthly series of theft and burglary for the period January 1990 to December 2001 (available at https://www.pittsburghpa.gov/Safety/Police/Police-Data-Portal/PBP-Annual-Reports), accessed on 1 February 2024. The count data consists of 144 observations for each type of offence. The descriptive statistics are provided in Table 1 and the time series plots in Figure 1 and Figure 2:
Table 1. Descriptive Statistics for the number of crimes from January 1990 to December 2001.
Figure 1. Time series, ACF and PACF plots of the monthly thefts from January 1990 to December 2001.
Figure 2. Time series, ACF and PACF plots of the monthly burglary from January 1990 to December 2001.
Table 2 clearly indicates that the bivariate time series data for theft and burglary are over-dispersed and the cross-correlation coefficient confirms the existence of cross-dependence between the two series. Hence, we fit both the constrained and unconstrained BINAR(1)PL models and the estimates are provided in Table 2:
Table 2. Thefts and Robbery: Estimates of the model parameters.
Using the forecasting Equations (14), (29) and (30), we compute the one-step ahead forecasts for the number of monthly theft and robbery, with corresponding root mean square errors (RMSEs) as shown in Table 3:
Table 3. RMSE values for number of theft and robbery.

5. Conclusions

This paper introduces two types of BINAR(1)PL model, namely the constrained and unconstrained BINAR(1)PL. The moments of the proposed models are derived and the CML approach is used to estimate the model parameters. Both models are applied on a real theft and burglary time series data and the two proposed BINAR are commendable models for the bivariate time series modelling.

Author Contributions

Conceptualization, N.M.K.; Methodology, Y.S.; Software, N.M.K.; Validation, M.R.I. and H.W.P.; Formal Analysis, N.M.K.; Investigation, Y.S.; Resources, N.M.K.; Data Curation, N.M.K.; Writing—Original Draft Preparation, M.R.I.; Writing—Review and Editing, N.M.K. and Y.S.; Visualization, Y.S.; Supervision, H.W.P.; Project Administration, Y.S. All authors have read and agreed to the published version of the manuscript.

Funding

The authors hereby declare that there is no funding statement to disclose for this research.

Institutional Review Board Statement

Not Applicable.

Data Availability Statement

Data are available in this manuscript.

Conflicts of Interest

On behalf of all authors, the corresponding author states that there is no conflict of interest.

References

  1. McKenzie, E. Some ARMA models for dependent sequences of Poisson counts. Adv. Appl. Probab. 1988, 20, 822–835. [Google Scholar] [CrossRef]
  2. Weiss, C. Thinning Operations for modelling time series of counts-a survey. AStA Adv. Stat. Anal. 2008, 92, 319–341. [Google Scholar] [CrossRef]
  3. Livio, T.; Mamode Khan, N.; Bourguignon, M. An inar(1) model with Poisson–Lindley innovations. Econ. Bull. 2018, 38, 1503–1513. [Google Scholar]
  4. Mohammadpour, M.; Bakouch, H.S.; Shirozhan, M. Poisson–Lindley INAR (1) model with applications. Braz. J. Probab. Stat. 2018, 32, 262–280. [Google Scholar] [CrossRef]
  5. Ristić, M.M.; Bakouch, H.S.; Nastić, A.S. A new geometric first-order integer-valued autoregressive (NGINAR (1)) process. J. Stat. Plan. Inference 2009, 139, 2218–2226. [Google Scholar] [CrossRef]
  6. Khan, N.M.; Oncel Cekim, H.; Ozel, G. The family of the bivariate integer-valued autoregressive process (BINAR (1)) with Poisson–Lindley (PL) innovations. J. Stat. Comput. Simul. 2020, 90, 624–637. [Google Scholar] [CrossRef]
  7. Mohammadpour, M.; Bakouch, H.S.; Ramzani, S. An integer-valued bilinear time series model via two random operators. Math. Comput. Model. Dyn. Syst. 2019, 25, 429–446. [Google Scholar] [CrossRef]
  8. Steutel, F.; van Harn, K. Discrete analogues of self-decomposability and statibility. Ann. Probab. 1979, 7, 3893–3899. [Google Scholar] [CrossRef]
  9. Yuvraj, S.; Naushad, M.K. A Novel Unconstrained Geometric BINAR (1) Model. Eng. Proc. 2023, 39, 52. [Google Scholar]
  10. Sunecher, Y.; Mamode Khan, N. Comparison of Inferential Methods for a Novel CMP Model. Eng. Proc. 2024, 68, 18. [Google Scholar]
  11. Pedeli, X.; Karlis, D. Some properties of multivariate INAR (1) processes. Comput. Stat. Data Anal. 2013, 67, 213–225. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.