Local Correlation Tracking in Time Series Spiros Papadimitriou§ Jimeng Sun‡ Philip S

Total Page:16

File Type:pdf, Size:1020Kb

Local Correlation Tracking in Time Series Spiros Papadimitriou§ Jimeng Sun‡ Philip S Local Correlation Tracking in Time Series Spiros Papadimitriou§ Jimeng Sun‡ Philip S. Yu§ § IBM T.J. Watson Research Center ‡ Carnegie Mellon University Hawthorne, NY, USA Pittsburgh, PA, USA Abstract capture various trend or pattern types. Data with such features arise in several application do- We address the problem of capturing and tracking lo- mains, such as: cal correlations among time evolving time series. Our ap- • Monitoring of network traffic flows or of system per- proach is based on comparing the local auto-covariance formance metrics (e.g., CPU and memory utilization, matrices (via their spectral decompositions) of each series I/O throughput, etc), where changing workload char- and generalizes the notion of linear cross-correlation. In acteristics may introduce non-stationarity. this way, it is possible to concisely capture a wide variety of local patterns or trends. Our method produces a gen- • Financial applications, where prices may exhibit linear eral similarity score, which evolves over time, and accu- or seasonal trends, as well as time-varying volatility. rately reflects the changing relationships. Finally, it can • Medical applications, such as EEGs (electroen- also be estimated incrementally, in a streaming setting. We cephalograms) [4]. demonstrate its usefulness, robustness and efficiency on a Figure 1 shows the exchange rates for the French Franc wide range of real datasets. (blue) and the Spanish Peseta (red) versus the US Dollar, over a period of about 10 years. An approximate timeline of major events in the European Monetary Union (EMU) 1 Introduction is also included, which may help explain the behavior of each currency. The global cross-correlation coefficient of The notion of correlation (or, similarity) is important, the two series is 0.30, which is statistically significant (ex- since it allows us to discover groups of objects with sim- ceeding the 95% confidence interval of ±0.04). The next ilar behavior and, consequently, discover potential anoma- local extremum of the cross-correlation function is 0.34, at lies which may be revealed by a change in correlation. In a lag of 323 working days, meaning that the overall behav- this paper we consider correlation among time series which ior of the Franc is similar to that of the Peseta 15 months often exhibit two important properties. ago, when compared over the entire decade of daily data. First, their characteristics may change over time. In fact, Franc / Peseta this is a key property of semi-infinite streams, where data arrive continuously. The term time-evolving is often used in this context to imply the presence of non-stationarity. In this case, a single, static correlation score for the entire time se- ries is less useful. Instead, it is desirable to have a notion of correlation that also evolves with time and tracks the chang- 0 500 1000 1500 2000 2500 ing relationships. On the other hand, a time-evolving cor- LoCo relation score should not be overly sensitive to transients; if 1 the score changes wildly, then its usefulness is limited. The second property is that many time series exhibit 0.8 strong but fairly complex, non-linear correlations. Tradi- 0.6 tional measures, such as the widely used cross-correlation 0 500 1000 1500 2000 2500 Jun 88 Time coefficient (or, Pearson coefficient), are less effective in cap- Jan 94 Apr 89 Jul 93 Jun 89 turing these complex relationships. From a general point Delors report req. May 93 EMU Stage 2 Delors report publ. Jan 93 Bundesbank buys Francs of view, the estimation of a correlation score relies on an Peseta joins ERM Jul 90 Peseta devalued assumed joint model of the two sequences. For example, EMU Stage 1 Feb 92 Oct 92 "Single Market" begins Maastricht treaty Peseta devalued, Franc under siege the cross-correlation coefficient assumes that pairs of values from each series follow a simple linear relationship. Con- Figure 1. Illustration of tracking time-evolving sequently, we seek a concise but powerful model that can local correlations (see also Figure 6). 1 This information makes sense and is useful in its own as an indexed collection X of random variables Xt, t ∈ N, right. However, it is not particularly enlightening about the i.e., X = {X1,X2,...,Xt,...} ≡ {Xt}t∈N. Without loss relationship of the two currencies as they evolve over time. of generality, we will assume zero-mean time series, i.e., Similar techniques can be employed to characterize corre- E[Xt] = 0 for all t ∈ N. The values of a particular realiza- lations or similarities over a period of, say, a few years. tion of X are denoted by lower-case letters, xt ∈ R, at time But what if we wish to track the evolving relationships over t ∈ N. shorter periods, say a few weeks? The bottom part of Fig- Covariance and autocovariance. The covariance of two ure 1 shows our local correlation score computed over a random variables X, Y is defined as Cov[X, Y ] = E[(X − window of four weeks (or 20 values). It is worth noting E[X])(Y − E[Y ])]. If X1,X2,...,Xm is a group of m that most major EMU events are closely accompanied by random variables, their covariance matrix C ∈ Rm×m is a correlation drop, and vice versa. Also, events related to the symmetric matrix defined by cij := Cov[Xi,Xj], for anticipated regulatory changes are typically preceded, but 1 ≤ i, j ≤ m. If x1, x2,..., xn is a collection of n obser- not followed, by correlation breaks. Overall, our correla- T vations xi ≡ [xi,1, xi,2, . , xi,m] of all m variables, the tion score smoothly tracks the evolving correlations among sample covariance estimate1 is defined as the two currencies (cf. Figure 6). To summarize, our goal is to define a powerful and con- 1 Xn Cˆ := x ⊗ x . cise model that can capture complex correlations between n i i time series. Furthermore, the model should allow tracking i=1 the time-evolving nature of these correlations in a robust In the context of a time series process {Xt}t∈N, we way, which is not susceptible to transients. In other words, are interested in the relationship between values at differ- the score should accurately reflect the time-varying relation- ent times. To that end, the autocovariance is defined as ships among the series. γt,t0 := Cov[Xt,Xt0 ] = E[XtXt0 ], where the last equal- Contributions. Our main contributions are the following: ity follows from the zero-mean assumption. By definition, γt,t0 = γt0,t. • We introduce LoCo (LOcal COrrelation), a time- Spectral decomposition. Any real symmetric matrix is evolving, local similarity score for time series, by gen- always equivalent to a diagonal matrix, in the following eralizing the notion of cross-correlation coefficient. sense. • The model upon which our score is based can capture Theorem 1. If A ∈ Rn×n is a symmetric, real matrix, then fairly complex relationships and track their evolution. it is always possible to find a column-orthonormal matrix The linear cross-correlation coefficient is included as a U ∈ Rn×n and a diagonal matrix Λ ∈ Rn×n, such that special case. A = UΛUT. • Our approach is also amenable to robust streaming es- Thus, given any vector x, we can write UT(Ax) = timation. Λ(UTx), where pre-multiplication by UT amounts to a We illustrate our proposed method or real data, discussing change of coordinates. Intuitively, if we use the coordinate its qualitative interpretation, comparing it against natural al- system defined by U, then Ax can be calculated by simply ternatives and demonstrating its robustness and efficiency. scaling each coordinate independently of all the rest (i.e., multiplying by the diagonal matrix Λ). The rest of the paper is organized as follows: In Sec- Given any symmetric matrix A ∈ Rn×n, we will de- tion 2 we briefly describe some of the necessary background note its eigenvectors by ui(A) and the corresponding eigen- and notation. In Section 3 we define some basic notions. values by λi(A), in order of decreasing magnitude, where Section 4 describes our proposed approach and Section 5 1 ≤ i ≤ n. The matrix Uk(A) has the first k eigenvectors presents our experimental evaluation on real data. Finally, as its columns, where 1 ≤ k ≤ n. in Section 6 we describe some of the related work and Sec- The covariance matrix C of m variables is symmetric tion 7 concludes. by definition. Its spectral decomposition provides the di- rections in Rm that “explain” the most of the variance. If T 2 Background we project [X1,X2,...,Xm] onto the subspace spanned by Uk(C), we retain the largest fraction of variance among In the following, we use lowercase bold letters for col- any other k-dimensional subspace [11]. Finally, the auto- umn vectors (u, v,...) and uppercase bold for matrices covariance matrix of a finite-length time series is also sym- (U, V,...). The inner product of two vectors is denoted metric and its eigenvectors typically capture both the key T T by x y and the outer product by x⊗ y ≡ xy . The Eu- 1The unbiased estimator uses n−1 instead of n, but this constant factor clidean norm of x is kxk. We denote a time series process does not affect the eigen-decomposition. 2 oscillatory (e.g., sinusoidal) as well as aperiodic (e.g., in- Symbol Description creasing or decreasing) trends that are present [6, 7]. U, V Matrix (uppercase bold). u, v Column vector (lowercase bold). 3 Localizing correlation estimates xt Time series, t ∈ N. w Window size. w Our goal is to derive a time-evolving correlation scores xt,w Window starting at t, xt,w ∈ R .
Recommended publications
  • Autocovariance Function Estimation Via Penalized Regression
    Autocovariance Function Estimation via Penalized Regression Lina Liao, Cheolwoo Park Department of Statistics, University of Georgia, Athens, GA 30602, USA Jan Hannig Department of Statistics and Operations Research, University of North Carolina, Chapel Hill, NC 27599, USA Kee-Hoon Kang Department of Statistics, Hankuk University of Foreign Studies, Yongin, 449-791, Korea Abstract The work revisits the autocovariance function estimation, a fundamental problem in statistical inference for time series. We convert the function estimation problem into constrained penalized regression with a generalized penalty that provides us with flexible and accurate estimation, and study the asymptotic properties of the proposed estimator. In case of a nonzero mean time series, we apply a penalized regression technique to a differenced time series, which does not require a separate detrending procedure. In penalized regression, selection of tuning parameters is critical and we propose four different data-driven criteria to determine them. A simulation study shows effectiveness of the tuning parameter selection and that the proposed approach is superior to three existing methods. We also briefly discuss the extension of the proposed approach to interval-valued time series. Some key words: Autocovariance function; Differenced time series; Regularization; Time series; Tuning parameter selection. 1 1 Introduction Let fYt; t 2 T g be a stochastic process such that V ar(Yt) < 1, for all t 2 T . The autoco- variance function of fYtg is given as γ(s; t) = Cov(Ys;Yt) for all s; t 2 T . In this work, we consider a regularly sampled time series f(i; Yi); i = 1; ··· ; ng. Its model can be written as Yi = g(i) + i; i = 1; : : : ; n; (1.1) where g is a smooth deterministic function and the error is assumed to be a weakly stationary 2 process with E(i) = 0, V ar(i) = σ and Cov(i; j) = γ(ji − jj) for all i; j = 1; : : : ; n: The estimation of the autocovariance function γ (or autocorrelation function) is crucial to determine the degree of serial correlation in a time series.
    [Show full text]
  • LECTURES 2 - 3 : Stochastic Processes, Autocorrelation Function
    LECTURES 2 - 3 : Stochastic Processes, Autocorrelation function. Stationarity. Important points of Lecture 1: A time series fXtg is a series of observations taken sequentially over time: xt is an observation recorded at a specific time t. Characteristics of times series data: observations are dependent, become available at equally spaced time points and are time-ordered. This is a discrete time series. The purposes of time series analysis are to model and to predict or forecast future values of a series based on the history of that series. 2.2 Some descriptive techniques. (Based on [BD] x1.3 and x1.4) ......................................................................................... Take a step backwards: how do we describe a r.v. or a random vector? ² for a r.v. X: 2 d.f. FX (x) := P (X · x), mean ¹ = EX and variance σ = V ar(X). ² for a r.vector (X1;X2): joint d.f. FX1;X2 (x1; x2) := P (X1 · x1;X2 · x2), marginal d.f.FX1 (x1) := P (X1 · x1) ´ FX1;X2 (x1; 1) 2 2 mean vector (¹1; ¹2) = (EX1; EX2), variances σ1 = V ar(X1); σ2 = V ar(X2), and covariance Cov(X1;X2) = E(X1 ¡ ¹1)(X2 ¡ ¹2) ´ E(X1X2) ¡ ¹1¹2. Often we use correlation = normalized covariance: Cor(X1;X2) = Cov(X1;X2)=fσ1σ2g ......................................................................................... To describe a process X1;X2;::: we define (i) Def. Distribution function: (fi-di) d.f. Ft1:::tn (x1; : : : ; xn) = P (Xt1 · x1;:::;Xtn · xn); i.e. this is the joint d.f. for the vector (Xt1 ;:::;Xtn ). (ii) First- and Second-order moments. ² Mean: ¹X (t) = EXt 2 2 2 2 ² Variance: σX (t) = E(Xt ¡ ¹X (t)) ´ EXt ¡ ¹X (t) 1 ² Autocovariance function: γX (t; s) = Cov(Xt;Xs) = E[(Xt ¡ ¹X (t))(Xs ¡ ¹X (s))] ´ E(XtXs) ¡ ¹X (t)¹X (s) (Note: this is an infinite matrix).
    [Show full text]
  • Lecture 1: Stationary Time Series∗
    Lecture 1: Stationary Time Series∗ 1 Introduction If a random variable X is indexed to time, usually denoted by t, the observations {Xt, t ∈ T} is called a time series, where T is a time index set (for example, T = Z, the integer set). Time series data are very common in empirical economic studies. Figure 1 plots some frequently used variables. The upper left figure plots the quarterly GDP from 1947 to 2001; the upper right figure plots the the residuals after linear-detrending the logarithm of GDP; the lower left figure plots the monthly S&P 500 index data from 1990 to 2001; and the lower right figure plots the log difference of the monthly S&P. As you could see, these four series display quite different patterns over time. Investigating and modeling these different patterns is an important part of this course. In this course, you will find that many of the techniques (estimation methods, inference proce- dures, etc) you have learned in your general econometrics course are still applicable in time series analysis. However, there are something special of time series data compared to cross sectional data. For example, when working with cross-sectional data, it usually makes sense to assume that the observations are independent from each other, however, time series data are very likely to display some degree of dependence over time. More importantly, for time series data, we could observe only one history of the realizations of this variable. For example, suppose you obtain a series of US weekly stock index data for the last 50 years.
    [Show full text]
  • STA 6857---Autocorrelation and Cross-Correlation & Stationary Time Series
    Announcements Autocorrelation and Cross-Correlation Stationary Time Series Homework 1c STA 6857—Autocorrelation and Cross-Correlation & Outline Stationary Time Series (§1.4, 1.5) 1 Announcements 2 Autocorrelation and Cross-Correlation 3 Stationary Time Series 4 Homework 1c Arthur Berg STA 6857—Autocorrelation and Cross-Correlation & Stationary Time Series (§1.4, 1.5) 2/ 25 Announcements Autocorrelation and Cross-Correlation Stationary Time Series Homework 1c Announcements Autocorrelation and Cross-Correlation Stationary Time Series Homework 1c Homework Questions from Last Time We’ve seen the AR(p) and MA(q) models. Which one do we use? In scientific modeling we wish to choose the model that best Our TA, Aixin Tan, will have office hours on Thursdays from 1–2pm describes or explains the data. Later we will develop many in 218 Griffin-Floyd. techniques to help us choose and fit the best model for our data. Homework 1c will be assigned today and the last part of homework Is this white noise process in the models unique? 1, homework 1d, will be assigned on Friday. Homework 1 will be We will see later that any stationary time series can be described as collected on Friday, September 7. Don’t wait till the last minute to do a MA(1) + “deterministic part” by the Wold decomposition, where the homework, because more homework will follow next week. the white noise process in the MA(1) part is unique. So in short, the answer is yes. We will also see later how to estimate the white noise process which will aid in forecasting.
    [Show full text]
  • Statistics 153 (Time Series) : Lecture Five
    Statistics 153 (Time Series) : Lecture Five Aditya Guntuboyina 31 January 2012 1 Contents 1. Definitions of strong and weak stationary sequences. 2. Examples of stationary sequences. 2 Stationarity The concept of a stationary time series is the most important thing in this course. Stationary time series are typically used for the residuals after trend and seasonality have been removed. Stationarity allows a systematic study of time series forecasting. In order to avoid confusion, we shall, from now on, make a distinction be- tween the observed time series data x1; : : : ; xn and the sequence of random vari- ables X1;:::;Xn. The observed data x1; : : : ; xn is a realization of X1;:::;Xn. It is convenient of think of the random variables fXtg as forming a doubly infinite sequence: :::;X−2;X−1;X0;X1;X2;:::: The notion of stationarity will apply to the doubly infinite sequence of ran- dom variables fXtg. Strictly speaking, stationarity does not apply to the data x1; : : : ; xn. However, one frequently abuses terminology and uses stationary data to mean that the random variables of which the observed data are a real- ization have a stationary distribution. 1 Definition 2.1 (Strict or Strong Stationarity). A doubly infinite se- quence of random variables fXtg is strictly stationary if the joint dis- tribution of (Xt1 ;Xt2 ;:::;Xtk ) is the same as the joint distribution of (Xt1+h;Xt2+h;:::;Xtk+h) for every choice of times t1; : : : ; tk and h. Roughly speaking, stationarity means that the joint distribution of the ran- dom variables remains constant over time. For example, under stationarity, the joint distribution of today's and tomorrow's random variables is the same as the joint distribution of the variables from any two successive days (past or future).
    [Show full text]
  • Cos(X+Y) = Cos(X) Cos(Y) - Sin(X) Sin(Y)
    On 1.9, you will need to use the facts that, for any x and y, sin(x+y) = sin(x) cos(y) + cos(x) sin(y). cos(x+y) = cos(x) cos(y) - sin(x) sin(y). (sin(x))2 + (cos(x))2 = 1. 28 1 Characteristics of Time Series n/2 1/2 1 1 f(xxx )=(2⇡)− Γ − exp (xxx µµµ )0Γ − (xxx µµµ ) , (1.31) | | −2 − − ⇢ where denotes the determinant. This distribution forms the basis for solving problems|·| involving statistical inference for time series. If a Gaussian time series, xt , is weakly stationary, then µt = µ and γ(ti,tj)=γ( ti tj ), so that{ the} vector µµµ and the matrix Γ are independent of time. These| − facts| imply that all the finite distributions, (1.31), of the series xt depend only on time lag and not on the actual times, and hence the series{ must} be strictly stationary. 1.6 Estimation of Correlation Although the theoretical autocorrelation and cross-correlation functions are useful for describing the properties of certain hypothesized models, most of the analyses must be performed using sampled data. This limitation means the sampled points x1,x2,...,xn only are available for estimating the mean, autocovariance, and autocorrelation functions. From the point of view of clas- sical statistics, this poses a problem because we will typically not have iid copies of xt that are available for estimating the covariance and correlation functions. In the usual situation with only one realization, however, the as- sumption of stationarity becomes critical. Somehow, we must use averages over this single realization to estimate the population means and covariance functions.
    [Show full text]
  • 13 Stationary Processes
    13 Stationary Processes In time series analysis our goal is to predict a series that typically is not deterministic but contains a random component. If this random component is stationary, then we can develop powerful techniques to forecast its future values. These techniques will be developed and discussed in this chapter. 13.1 Basic Properties In Section 12.4 we introduced the concept of stationarity and defined the autocovariance function (ACVF) of a stationary time series Xt at lag h as f g γX (h) = Cov(Xt+h;Xt); h = 0; 1; 2 ::: ± ± and the autocorrelation function as γX (h) ρX (h) := : γX (0) The autocovariance function and autocorrelation function provide a useful measure of the degree of dependence among the values of a time series at different times and for this reason play an important role when we consider the prediction of future values of the series in terms of the past and present values. They can be estimated from observations of X1;:::;Xn by computing the sample autocovariance function and autocorrelation function as described in Definition 12.4.4. Proposition 13.1.1. Basic properties of the autocovariance function γ( ): · γ(0) 0; ≥ γ(h) γ(0) for all h; j j ≤ γ(h) = γ( h) for all h; i.e., γ( ) is even. − · Definition 13.1.2. A real-valued function κ defined on the integers is non-negative definite if n aiκ(i j)aj 0 i;j=1 − ≥ X 0 for all positive integers n and vectors a = (a1; : : : ; an) with real-valued components ai.
    [Show full text]
  • Cross Correlation Functions 332 D
    STATISTICAL ANALYSIS OF WIND LOADINGS AND RESPONSES OF A TRANSMISSION TOWER STRUCTURE by SIEW HOCK LIEW, B.S. A DISSERTATION IN CIVIL ENGINEERING Submitted to the Graduate Faculty of Texas Tech University in Partial Fulfillment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY Approved Accepted May, 1988 ©1989 SIEW HOCK LIEW All Rights Reserved ACKNOWLEDGMENTS I wish to express my deepest appreciation to my committee chairman. Dr. H. Scott Norville, for his confi­ dence in me during the entire course of this researcr. project. His encouragement and valuable advice as a committee chairman, as a major advisor, and as a friend, has instilled a value of perseverance in me. I also ^-'ish to express my sincere appreciation to Dr. K. C. M^?nt^^, for his expertise and advice in wind engineering, to Dr. T. 0. Lewis for his advice in statistics and in time series, to Dr. W. P. Vann and Dr. E. Blair for t-heir valuable suggestions and comments on this dissertation manuscript, and to Mr. M. L. Levitan for his permisf5ion to use some of the time histories plots. I am most grateful to my wife, Lily, for her patience and understanding throughout the course of my graduate work, and to my parents for their moral support -^nd instilling in me the value of education from the very beginning of my life. 11 TABLE OF CONTENTS PAGE ACKNOWLEDGMENTS i i LIST OF TABLES vi LIST OF FIGURES vii 1. INTRODUCTION 1 2. LITERATURE REVIEW 7 3. SITE DESCRIPTION, INSTRUMENTATION, AND DATA COLLECTION SYSTEM 20 3.1 Introduction 20 3.2 Location 20 3.3 Instrumentation 27 4.
    [Show full text]
  • The Autocorrelation and Autocovariance Functions - Helpful Tools in the Modelling Problem
    The autocorrelation and autocovariance functions - helpful tools in the modelling problem J. Nowicka-Zagrajek A. Wy lomanska´ Institute of Mathematics and Computer Science Wroc law University of Technology, Poland E-mail address: [email protected] One of the important steps towards constructing an appropriate mathematical model for the real-life data is to determine the structure of dependence. A conventional way of gaining information concerning the dependence structure (in the second-order case) of a given set of observations is estimating the autocovariance or the autocorrelation function (ACF) that can provide useful guidance in the choice of satisfactory model or family of models. As in some cases calculations of ACF for the real-life data may turn out to be insufficient to solve the model selection problem, we propose to consider the autocorrelation function of the squared series as well. Using this approach, in this paper we investigate the dependence structure for several cases of time series models. PACS: 05.45 Tp, 02.50 Cw, 89.65 Gh 1. Motivation One of the important steps towards constructing an appropriate mathematical model for the real-life data is to determine the structure of dependence. A conventional way of gaining information concerning the dependence structure (in the second-order case) of a given set of observations is estimating one of the most popular measure of dependence – the autocovariance (ACVF) or the autocorrelation (ACF) function – and this can provide useful guidance in the choice of satisfactory model or family of models. This traditional method is well-established in time series textbooks, see e.g.
    [Show full text]
  • Arxiv:1803.05048V2 [Q-Bio.NC] 7 Jun 2018 VII the Performance of the MTD Approach in Inferring the Underlying Network Connectivity Is Examined
    On the pros and cons of using temporal derivatives to assess brain functional connectivity Jeremi K. Ochab,∗ Wojciech Tarnowski,y Maciej A. Nowak,z and Dante R. Chialvox Marian Smoluchowski Institute of Physics and Mark Kac Complex Systems Research Center Jagiellonian University, ul. Łojasiewicza 11, PL30–348 Kraków, Poland and Center for Complex Systems & Brain Sciences (CEMSC3), Escuela de Ciencia y Tecnología, Universidad Nacional de San Martín, & Consejo Nacional de Investigaciones Científicas y Tecnológicas (CONICET), 25 de Mayo 1169, San Martín, (1650), Buenos Aires, Argentina (Dated: June 8, 2018) The study of correlations between brain regions is an important chapter of the analysis of large-scale brain spatiotemporal dynamics. In particular, novel methods suited to extract dynamic changes in mutual correlations are needed. Here we scrutinize a recently reported metric dubbed “Multiplication of Temporal Derivatives” (MTD) which is based on the temporal derivative of each time series. The formal comparison of the MTD for- mula with the Pearson correlation of the derivatives reveals only minor differences, which we find negligible in practice. A comparison with the sliding window Pearson correlation of the raw time series in several stationary and non-stationary set-ups, including a realistic stationary network detection, reveals lower sensitivity of deriva- tives to low frequency drifts and to autocorrelations but also lower signal-to-noise ratio. It does not indicate any evident mathematical advantages of the proposed metric over commonly used correlation methods. Keywords: fMRI, resting state networks, functional connectivity; I. INTRODUCTION An important challenge and a very active area of research in the neuroimaging community is the study of correlations between brain regions, as a central point in the analysis of large-scale brain spatiotemporal dynamics.
    [Show full text]
  • Stat 6550 (Spring 2016) – Peter F. Craigmile Introduction to Time Series Models and Stationarity Reading: Brockwell and Davis
    Stat 6550 (Spring 2016) – Peter F. Craigmile A time series model Introduction to time series models and stationarity Remember that a time series model is a specification of the Reading: Brockwell and Davis [2002, Chapter 1, Appendix A] • probabilistic distribution of a sequence of random variables (RVs) A time series model Xt : t T0 . • { ∈ } – Example: IID noise (The observed time series x is a realization of the RVs). { t} – Mean function The simplest time series model is IID noise: • – Autocovariance and autocorrelation functions – Here X is a sequence of independent and identically dis- { t} Strictly stationary processes • tributed (IID) RVs with (typically) zero mean. (Weakly) stationary processes – There is no dependence in this model • – Autocovariance (ACVF) and autocorrelation function (ACF). (but this model can be used as a building block for construct- ing more complicated models) – The white noise process – We cannot forecast future values from IID noise – First order moving average process, MA(1) (There are no dependencies between the random variables at – First order autoregressive process, AR(1) different time points). The random walk process • Gaussian processes • 1 2 Example realizations of IID noise Means and autocovariances 1. Gaussian (normal) IID noise with mean 0, variance σ2 > 0. A time series model could also be a specification of the means 2 1 xt • pdf is fXt(xt)= exp √ 2 −2σ2 and autocovariances of the RVs. 2πσ The mean function of X is • { t} µX(t) = E(Xt). Think of µX(t) are being the theoretical mean at time t, taken IID Normal(0, 0.25) noise −3 −2 −1 0 1 2 3 over the possible values that could have generated Xt.
    [Show full text]
  • Chapter 9 Autocorrelation
    Chapter 9 Autocorrelation One of the basic assumptions in the linear regression model is that the random error components or disturbances are identically and independently distributed. So in the model y Xu , it is assumed that 2 u ifs 0 Eu(,tts u ) 0 if0s i.e., the correlation between the successive disturbances is zero. 2 In this assumption, when Eu(,tts u ) u , s 0 is violated, i.e., the variance of disturbance term does not remain constant, then the problem of heteroskedasticity arises. When Eu(,tts u ) 0, s 0 is violated, i.e., the variance of disturbance term remains constant though the successive disturbance terms are correlated, then such problem is termed as the problem of autocorrelation. When autocorrelation is present, some or all off-diagonal elements in E(')uu are nonzero. Sometimes the study and explanatory variables have a natural sequence order over time, i.e., the data is collected with respect to time. Such data is termed as time-series data. The disturbance terms in time series data are serially correlated. The autocovariance at lag s is defined as sttsEu( , u ); s 0, 1, 2,... At zero lag, we have constant variance, i.e., 22 0 Eu()t . The autocorrelation coefficient at lag s is defined as Euu()tts s s ;s 0,1,2,... Var() utts Var ( u ) 0 Assume s and s are symmetrical in s , i.e., these coefficients are constant over time and depend only on the length of lag s . The autocorrelation between the successive terms (uu21 and ) (uuuu32 and ),...,(nn and 1 ) gives the autocorrelation of order one, i.e., 1 .
    [Show full text]