EconBase
← Back to paper

Cross-Sectional Dynamics Under Network Structure: Theory and Macroeconomic Applications

Extracted main text — title through conclusion, appendix excluded. This is what our citation measures are computed over, published so the extraction can be checked by eye.

243,961 characters · 20 sections · 84 citation commands

Rendered from LaTeX for readability, not typeset faithfully. Citation keys are highlighted; maths is left as source; figures, tables and equation environments are summarised rather than reproduced; unrecognised commands are greyed out so nothing is silently dropped. Email addresses are removed.

-0.5 in 1925Cross-Sectional Dynamics Under Network Structure: Theory and Macroeconomic Applications

abstractMany economic environments involve units linked by a network. I develop an econometric framework that derives the dynamics of cross-sectional variables from the lagged innovation transmission along bilateral links and that can accommodate general patterns of how higher-order network effects accumulate over time. The proposed NVAR rationalizes the Spatial Autoregression as the limit under an infinitely high frequency of lagged network interactions. The factor-representation of the NVAR suggests that at the cost of restricting factor dynamics, it naturally incorporates sparse factors as locally important nodes in the network. The NVAR can be used to estimate dynamic network effects. When the network is estimated as well, it also offers a dimensionality-reduction technique for modeling high-dimensional processes. In a first application, I show that sectoral output in a Real Business Cycle-economy with lagged input-output conversion follows an NVAR. In turn, I estimate that the dynamic transmission of productivity shocks along supply chains accounts for 61% of persistence in aggregate output growth, leaving minor roles for autocorrelation in exogenous productivity processes. In a second application, I forecast macroeconomic aggregates across OECD countries by estimating a network behind global business cycle dynamics. This reduces out-of-sample mean squared errors for one-step ahead forecasts relative to a dynamic factor model by -12% (quarterly real GDP growth) to -68% (monthly CPI inflation). \todo{go over all eqs; numbering required?} \todo{REMEMBER: DISABLE TODONOTES & DELETE ToC BEFORE SHARING}

{ {\bf JEL codes:} C32, E32, E37.}

{ {\bf Key words:} Vector Autoregression, Spatial Autoregression, Dynamic Network Effects, Input-Output Economy, Business Cycles, High-Dimensional Time Series, Local Factors}.

\thispagestyle{empty}

\setcounter{page}{1}

Introduction

In economics, we often encounter a cross-section of units linked by a network of bilateral ties, such as sectors connected through supply chains or individuals acquainted to each other. A large theoretical and empirical literature documents that networks amplify idiosyncratic shocks and generate comovement in cross-sectional variables at a given point in time.\footnote{ See work surveyed in Carvalho-TahbazSalehi2019,BramoulleGaleottiRogers2016 and the following literature review. }

How network-induced comovements unfold over time, however, is less well understood. The literature predominantly assumes contemporaneous network interactions (e.g. BramoulleDjebbariFortin2009, AcemogluEtAl2012, ElliottGolubJackson2014), embodied by the Spatial Autoregressive (SAR) model. This implies that an innovation contemporaneously transmits along network connections of all orders. The resulting static framework is useful for “{networked}" steady state comparisons. Among the few studies that consider lagged network interactions, most posit that network effects materialize exactly one link per period (e.g. LongPlosser1983, GolubJackson2010, Elhorst2012). While useful for analyzing the qualitative implications of the laggedness of network interactions, this assumption is of limited use for empirical work concerned with “{networked}" transition dynamics. ZhuPanLiLiuWang2017 generalize the lag length, but the generality of their empirical framework and its relation to structurally motivated models of contemporaneous or single-lagged network interactions remain unclear.

I construct an econometric framework that derives the dynamics of cross-sectional variables from the lagged innovation transmission along bilateral links between cross-sectional units: the Network-VAR (NVAR). Like existing studies, I assume uni-directional transmission\footnote{ i.e. either downstream or upstream, the distinction being relevant only for directed networks.} and time-invariant links. Unlike existing studies, the model can accommodate general patterns on how innovations travel along links over time and, consequently, how network connections of higher order accumulate as time progresses. To obtain this generality, I distinguish between the frequency of network interactions and the frequency of observation. As the former diverges to infinity, the impulse-response to contemporaneous high-frequency disturbances and the networked covariance among observations approach their counterparts from the SAR model. The same impulse-response is also obtained when considering long-term effects of permanent innovations. By taking a stance on the timing of network effects, the NVAR goes beyond such steady state comparisons and characterizes transition dynamics.

In the NVAR, the interdependence of observations $y_{it}$ and $y_{j,t-h}$ arises as the interplay of the temporal distance between periods $t$ and $t-h$ and the cross-sectional distance between units $i$ and $j$ encoded by the network. Under a sparse network, this dependence is modeled parsimoniously; the dynamic comovement among all series is rationalized by the dynamic innovation transmission along a few bilateral links among units. This is akin to the assumption that longer-term dynamics are driven by a set of shorter-term dynamics, upheld by the general class of VARMA($p,q$) models. The dynamics under the NVAR can be represented by a Dynamic Factor Model (DFM) whereby the number of factors equals the rank of the network adjacency matrix. At the cost of restricting their dynamics, the NVAR naturally incorporates sparse factors as locally important nodes in the network.

The NVAR is useful in two distinct kinds of work with cross-sectional time series. By conducting inference on the timing of innovation transmission along bilateral links, it can be used to estimate dynamic network effects. Thereby, the network can be taken as given or it can be inferred from dynamic cross-correlations in the data, possibly aided by shrinking towards observed links. When both the network and effect-timing are estimated, the NVAR is also applicable as a dimensionality-reduction technique for modeling high-dimensional processes. Conditional on a network, inference on the timing of network effects boils down to a linear regression with covariates that summarize lagged observations using bilateral links. Joint inference is implemented by iterating on analytically available conditional estimators, with Bayesian as well as frequentist interpretations. I illustrate each of these two model uses with a respective application.

In the first application, I show that the NVAR approximates the process of sectoral output in a Real Business Cycle (RBC) input-output economy with lagged input-output conversion (IOC). In turn, I evaluate the potential of lagged IOC to generate endogenous business cycles, as suggested theoretically by LongPlosser1983. I generalize their one period-lagged IOC by assuming that inputs from the past $p$ periods are imperfectly substitutable in the production at any time $t$ -- a stand-in for a range of frictions that prevent just-in-time input-sourcing -- and by allowing the model frequency to differ from the observational frequency. I characterize impulse-responses under a difference-stationary TFP process with persistent aggregate and sectoral shocks. The analysis illustrates the differing implications of lagged IOC and persistence in exogenous shocks for the dynamics of sectoral and aggregate output; the former formalizes the idea that idiosyncratic changes in, say, energy production take time to feed through the networked economy, while the latter merely prolongs the effects of each round of transmission. Using input-output tables and monthly output growth across 23 manufacturing sectors in the US economy, I estimate their respective contributions to persistence in aggregate output growth.\todo{to the autocorrelation function of ...?}

The results suggest that lagged IOC explain 61% of the autocorrelation in aggregate output growth. With persistence in aggregate TFP, this number grows to 93%, leaving little room for persistence in idiosyncratic sectoral TFP. My analysis reveals that shocks to more central sectors not only affect aggregate output more strongly in the long run -- as established by AcemogluEtAl2012\todo{CITE MORE?} --, but they also tend to materialize more sluggishly. This relationship, however, is far from clear-cut; for example, owing to its position at the top of supply chains, a TFP shock in the primary metals sector materializes more slowly than a shock to the food and beveredge sector, despite similar long-term effects.\todo{relate results to Foerster et al. and Krishna Kamepalli et al.?}

In the second application, I investigate the merits of the NVAR as a dimensionality-reduction technique for forecasting high-dimensional (cross-sectional) processes. I consider monthly industrial production growth, monthly CPI inflation and quarterly GDP growth across OECD countries. Under a sparse network, the NVAR models the dynamics parsimoniously; the dynamic comovement among all series is rationalized by the dynamic innovation transmission along a small set of bilateral links among countries. In line with that, I estimate the network by shrinking links to zero using a Lasso-penalty. I also consider alternative specifications that apply a Ridge-penalty and shrink to observable links.\todo{LEFT TO DO}

In my setting, the NVAR reduces out-of-sample mean squared errors by 13%-68% relative to the ex-post best-performing DFM. This corroborates my equivalence result: the NVAR better forecasts these series, whose cross-country dynamics seem to be driven by many micro links rather than a few influential countries. This corresponds to a setting with numerous sparse factors and differing sets of non-zero loadings across units or, equivalently, a sparse, yet high-rank network adjacency matrix. \todo{add sentence on sparseness and interpretability of network I estimate}

\paragraph*{Contribution}

There is a large econometric literature on spatial and network-interactions Manski1993,KelejianPrucha2010JoE,Anselin2003,Lee2007,BramoulleDjebbariFortin2009,ShaliziThomas2011,KuersteinerPrucha2020,DePaula-Rasul-Souza2024. It is concerned with identifying spatial/peer-effects and accounting for heterogeneity in cross-sectional and panel data-regressions.\footnote{ A separate strand devises methods for dyadic data, i.e. the case when edges rather than nodes in the network are observed Graham2020. } It predominantly assumes contemporaneous network interactions, as exemplified by the canonical SAR model. Among the few studies that consider lagged interactions Elhorst2012,KnightNunesNason2016, ZhuPanLiLiuWang2017 cast them in an an explicit time series model, generalizing the lag length and discussing stationarity and large $T$-inference. I characterize Granger causality in their environment as the cross-sectional innovation transmission along network connections of different order, formalizing the idea that network effects materialize dynamically over time. In turn, I generalize this mapping between network connections and dynamics, which allows me to derive the SAR model as the limit of an underlying process driven by high-frequency lagged network interactions.\footnote{ BarigozziCavaliereMoramarco2025,Maung2022,ArmillottaFokianos2023 extend ZhuPanLiLiuWang2017 along different dimensions than I do. } Like PinkseSladeBrett2002,LamSouza2020,QuLeeYang2021,DePaula-Rasul-Souza2024 do in the static environment, I discuss inference on the network itself -- not only the effect-timing --, which institutes the NVAR as a dimensionality-reduction technique -- not only a tool for estimating dynamic network effects -- and motivates my equivalence result to factor models.

Many studies incorporate networks in time series analyses. Following DieboldYilmaz2009,DieboldYilmaz2014, some researchers interpret quantities of a given time series model -- typically a VAR -- using network analysis BillioGetmanskyLoPelizzon2012,AnufrievPanchenko2015,ChenLiLiLinton2025. Other studies restrict time series models using networks CarvalhoWest2007,ChudikPesaran2011,DavisZangZheng2016,AhelegbeyBillioCasarin2016JAE,ZhuPanLiLiuWang2017,BarigozziBrownlees2018,BillioCasarinRossini2019,CaporinErdemliogluNasini2021,MartinPassinoCucuringuLuati2025.\footnote{ HollyPetrella2012,DahlhausSchaumburgSekhposyan2021,DeGraeve-Schneider2023,ChodorowReich-Gabaix-Viviano2025 exploit networks for shock-identification in VARs. Bykhovskaya2023 models the temporal evolution of a weighted network, which belongs to the realm of dyadic regressions Graham2020 and (dynamic) network-formation rather than -effects. } Among them, the Global VAR (GVAR) PesaranSchuermannWeiner2004,ChudikPesaran2014 restricts static and dynamic interdependencies across units in a panel-VAR using exogenous network-weights -- e.g. bilateral trade --, enabling the estimation of many interconnected VAR models under a weak exogeneity assumption.\footnote{ See CanovaCiccarelli2013 for an overview of panel-VAR approaches. } The NVAR also belongs to this second category; it restricts innovations in a (cross-sectional) VAR to transmit along bilateral links among variables (units), which leads to rich patterns of multi-step causality as in DufourRenault1998. In contrast to the GVAR and most “{networked}" time series approaches above, I focus on a single variable per cross-sectional unit and a single type of connections among them, and I entertain the assumption that innovations transmit along bilateral links. This allows me to characterize a range of theoretical properties -- including the relation to static SAR models and DFMs --, to structurally motivate the NVAR with an RBC production economy, and to efficiently conduct inference by relying on analytical conditional estimators.

When the network is estimated parsimoniously, the NVAR also addresses the literature on dimensionality-reduction methods for time-series modeling. By reducing the number of parameters and applying shrinkage priors, it leverages both approaches available for addressing the large parameter problem in the Wold representation Geweke1984. Compared to standard shrinkage methods Litterman1986,Tibshirani1996, it applies shrinkage to links -- which in turn summarize the information in predictors at all lags -- rather than to predictors themselves. Compared to reduced rank regression VeluReinselWichern1986 or factor models Geweke1977,StockWatson2002, it finds the linear combination to summarize the information in predictors by relying on network connections of different order and, ultimately, on bilateral links among units. While many of the network-restricted time series approaches mentioned above appear to have a reduced-rank representation -- consider the GVAR's construction of weighted averages of other countries' variables --, the simple setup of the NVAR allows me to characterize this representation explicitly. Owing to the equivalence result that compares the NVAR to the DFM -- corroborated by their relative performance forecasting the three processes I consider --, the NVAR contributes to the long-standing literature on sparse factors BoivinNg2006,Onatski2012,BaiNg2019,FanMasiniMedeiros2022,AnatolyevMikusheva2022,Freyaldenhoven2025. Interestingly, in my application, a sparse network is preferred to a dense one, suggesting the presence of sparse rather than weak factors and running counter to the results of GiannoneLenzaPrimiceri2021.

With the other application of the NVAR, I contribute to the series of efforts to microfound aggregate dynamics using production networks (see Horvath1998,Horvath2000,Dupor1999,Shea2002,Carvalho2010,FoersterSarteWatson2011,AcemogluEtAl2012,DiGiovanni-Levchenko-Mejean2014 and survey of Carvalho-TahbazSalehi2019). These studies rely on contemporaneous IOC -- mirroring the prevalence of contemporaneous interactions in econometrics and in the related study of spatial economies DesmetParro2025 -- and show that the production network greatly contributes to aggregate volatility. A notable exception is LongPlosser1983, who show that lagged IOC endogenizes business cycles -- i.e. persistence in aggregates --, without relying on autocorrelation in exogenous shocks, non-rational expectations, or other frictions. Their analysis points to a more prominent role for production networks than as mere amplification devices of existing dynamics; it formalizes (qualitatively) the notion that sectoral shocks take time to feed through the economy, an idea well-accepted in the trade literature AlessandriaKaboskiMidrigan2010,LiuTsyvinski2024,AntrasTubdenov2025. CarvalhoReischer2021 characterize persistence in the LongPlosser1983-economy and show that its implied evolution due to observed changes in the US input-output network accounts well for empirical measures of the changing persistence of aggregate output growth. Their analysis suggests that the endogenization of business cycles through lagged IOC is not only theoretically attractive, but has empirical merit as well. I quantify the empirical salience of LongPlosser1983's hypothesis by taking an RBC economy with general lags in IOC to the data. While lagged IOC leads to the same steady state as under contemporaneous IOC, it decomposes the long-term responses to granular TFP shocks, with distinct transition dynamics from those generated by autocorrelated TFP processes. By conducting inference on the timing of IOC along with the autocorrelations and variance of exogenous TFP processes, I quantify the contribution of lagged IOC to the entire autocorrelation function of aggregate output growth, supplementing and extending earlier decompositions of aggregate volatility FoersterSarteWatson2011,DiGiovanni-Levchenko-Mejean2014,DeGraeve-Schneider2023.

\paragraph*{Outline}

The rest of this paper is structured as follows. The model and its properties are discussed in (ref). (ref) treats inference. In (ref), I study how input-output connections affect output dynamics in the US economy. In (ref), I illustrate the merits of the NVAR as a dimensionality-reduction technique. (ref) concludes.

Dynamics via Lagged Network Effects: Theory

After providing some basic background on networks in (ref), I present the NVAR and its main properties in (ref), and I discuss further properties in (ref). Details and proofs are in (ref). The discussion of inference is deferred to (ref).

Bilateral Connections in Networks

A network is represented by an $n \times n$ adjacency matrix $A$ with elements $a_{ij}$. I consider a directed, weighted and possibly signed network; $a_{ij} \in [-1,1]$ shows the sign and strength of the link from unit $i$ to unit $j$, with $a_{ij} \neq a_{ji}$ possibly. If $a_{ij}=0$, I say unit $i$ is not connected to unit $j$. Self-links are permitted: $a_{ii} \neq 0$. The set of bilateral links $\{a_{ij}\}_{i,j=1:n}$ give rise to a myriad of higher-order (hyper-dyadic) links among units, referred to as walks.\footnote{Whenever convenient to simplify notation, I write $a:b$ for the set of integers $\{a,a+1,...,b\}$, $a\leq b$.}

definition[Walk] A walk from $i$ to $j$ of length $K \geq 2$ is \begin{align*} a_{u_1,u_2, ..., u_{K+1}} \equiv \prod_{k=1}^{K} a_{u_k,u_{k+1}} \; , \quad u_1 = i \; , \; \; u_2 = j \; . \end{align*}

A walk is a product of bilateral links that lead from unit $i$ to unit $j$ over intermediary units. It is non-zero if all of these units are sequentially connected. Simple matrix algebra reveals that $[A^K]_{ij}$ contains the sum of walks from $i$ to $j$ of length $K$. I refer to this quantity as the $K$th-order connection from $i$ to $j$. Consider the following example:

align*[align* omitted — 327 chars of source]

Even though unit $3$ is not directly connected to unit $1$ ($a_{31}=0$), there exists a second-order connection via unit $2$ ($a_{32}a_{21}\neq 0$). In a production network, unit $1$ could be a supplier to unit $2$, who in turn is a supplier to unit $3$.

Lagged Innovation Transmission via Bilateral Links

Consider a stationary cross-sectional time series $y_t = (y_{1t}, ..., y_{nt})'$ with mean zero. Under an NVAR, the dynamics of $y_t$ are driven by the lagged transmission of innovations $u_{it}$ along bilateral links $a_{ij}$ among cross-sectional units $i,j=1:n$. Throughout, I assume that links are fixed over time and that transmission is uni-directional: the direct link from $i$ to $j$, $a_{ij}$, transmits innovations from $j$ to $i$. Innovations $u_t$ may be cross-sectionally correlated.

Single Lag in Innovation Transmission: NVAR(1,1)

Consider a VAR(1) with an autoregressive matrix proportional to the adjacency matrix $A$:

align[align omitted — 65 chars of source]

for $\alpha \in \mathbb{R}$. Under this process, the one step-ahead expectation of $y_{it}$ is proportional to the weighted sum of one period-lagged values of $y_{jt}$ for all units $j$ to which $i$ is directly linked: $\mathbb{E}_{t-1}[y_{it}] = \alpha \sum_{j=1}^n a_{ij} y_{j,t-1}$. For example, in the RBC input-output economy of LongPlosser1983, the expected output in sector $i$ tomorrow is a weighted average of the production in its supplier-sectors $j$ today. In GolubJackson2010, individual $i$'s expected opinion tomorrow is a weighted average of their friends' opinions today. For reasons clarified below, I dub this process NVAR(1,1).

Under (ref), dynamics of $y_t$ at horizon $h \geq 1$ are driven by $h$th-order network connections. More precisely, assuming $\alpha \neq 0$, $y_j$ Granger-causes $y_i$ at horizon $h$ iff there exists an $h$th-order connection from $i$ to $j$:\footnote{ In other words, given all other variables $y_{kt}$ for $k \neq j$, $y_{jt}$ is useful in forecasting $y_{i,t+h}$ iff there exists an $h$th-order connection from $i$ to $j$. }

align*[align* omitted — 167 chars of source]

(ref) illustrates these Granger-causality dynamics -- also referred to as Generalized Impulse-Response Functions (GIRFs)\footnote{ The GIRF is “{generalized}" because it disregards shock identification, but considers the propagation of reduced form errors $u_t$ over future time periods $t+h$, $h\geq 1$.} -- for the network from (ref) under $\alpha=1$. It points to two insights. First, lagged network interactions generate persistence; even white noise-innovations $\{u_{jt}\}_{j=1}^n$ lead to persistent reactions of $y_t$ because each $u_{jt}$ affects connected units $i \neq j$ with a lag.\footnote{Furthermore, each individual $y_{jt}$ reacts persistently to its own white noise-innovation $u_{jt}$ as long as there is a cycle in the network, i.e. a walk from $j$ to $j$. Notably, this can hold even without a self-link -- $a_{jj} = 0$.} This result is behind the endogenous business cycles in LongPlosser1983's economy with lagged input-output conversion. Second, under this type of persistence, network-connections affect not only the strength of impulse-responses, but also their timing. For example, while unit 2 is directly linked to unit 1 and therefore experiences the latter's innovation with a lag of one period, unit 3 only has a second-order connection to unit 1 and therefore reacts only after two periods. This result relates to DufourRenault1998, who point out that Granger-causality can take the form of chains.\footnote{ Specifically, even if a series $x_t$ does not Granger-cause a series $y_t$ at horizon 1, under the presence of a third series $z_t$, $x_t$ might Granger-cause $y_t$ at higher horizons as the causality could run from $x_t$ to $z_t$ to $y_t$. } In the case of a (cross-sectional) time series driven by lagged innovation transmission along bilateral links, their insight emerges naturally and their generally non-trivial conditions for Granger-(non)causality boil down to the presence or absence of network connections of relevant order between the relevant variables (units). As I show in the following, this holds even under a more general transmission-timing than considered in (ref).

figure[figure omitted — 471 chars of source]

While the process in (ref) reveals useful theoretical insights in both macro- LongPlosser1983 and microeconomics GolubJackson2010, it is too restrictive for most empirical work. It assumes that innovations transmit at the speed of one link per period and that transmission materializes completely within a single period. This implies, for instance, that in response to news gathered by a friend of a friend, $j$, an individual $i$ adjusts their opinion in two periods, not earlier, not later. Similarly, an innovation to a sector $j$'s output affects the output of other sectors $i$ located two positions downstream (“{customers of customers}") in exactly two periods. In either case, earlier responses are ruled out altogether, and later adjustments only occur if $i$ has a third- or higher-order connection to $j$. In the following, I generalize the timing of lagged network effects by extending the simple process above along two dimensions.

Multiple Lags in Innovation Transmission: NVAR($p,1$)

Let the cross-sectional time series $y_t$ evolve according to a VAR($p$), where each autoregressive matrix is proportional to the same network adjacency matrix $A$:

align[align omitted — 94 chars of source]

with $\alpha = (\alpha_1, ..., \alpha_p)' \in \mathbb{R}^{p}$. I dub this process NVAR($p,1$). It simplifies the process presented in ZhuPanLiLiuWang2017 by not distinguishing self- and cross-links, by abstracting from restrictions on the rows of $A$, and by disregarding the intercept and covariates. These simplifications prove useful for characterizing a range of proprties in this section, for conducting inference in (ref), and for taking a macroeconomic model of lagged input-output conversion to the data in (ref).

Compared to (ref), under the NVAR($p,1$) with $p>1$, dynamics at horizon $h$ are affected by lower-order connections:

proposition[Granger-Causality in NVAR($p,1$)] \\[3pt] Let $y_t$ evolve as in (ref). Then, Granger-causality from $y_j$ to $y_i$ at horizon $h$ is a linear combination of connections from $i$ to $j$ of order $k \in \{\underline{k}, \underline{k}+1, ..., h\}$, where $\underline{k} = ceil(h/p)$.\footnotemark

\footnotetext{$ceil(x)$ rounds $x \in \mathbb{Q}$ up to the next integer.}

Under $\alpha_l > 0 \; \forall \; l$ and $a_{ij} \geq 0$, (ref) implies that $y_j$ Granger-causes $y_i$ at horizon $h$ iff there exists a connection from $i$ to $j$ of at least one order $k \in \{\underline{k}, \underline{k}+1, ..., h\}$. The proof of (ref) in (ref) establishes that the GIRF is of the form

align[align omitted — 214 chars of source]

Each coefficient $c^{h}_{k}$ for $k=\underline{k}:h$ is a polynomial of $\{\alpha_l\}_{l=1:p}$ and shows the importance of connection-order $k$ for the impulse-response at horizon $h$. If $i$ has a first- and no higher-order connections to $j$, then $\partial y_{i,t+h} / \partial u_{j,t} = \alpha_h a_{ij}$ for $h=1:p$ and zero otherwise. Hence, the NVAR($p,1$) specifies that dynamics are driven by the transmission of innovations along direct links lagged over $p$ periods. $\alpha$ determines how the transmission is spread out over these $p$ periods and, consequently, how transmission along higher-order connections accrues as time progresses. Note that the transmission is assumed to be the same for all unit pairs $(i,j)$ and invariant over time.

\todo{note that $\alpha \neq$ timing of network effects, as $q$ matters too!}

Multiple Rounds of Innovation Transmission: NVAR($p,q$)

To further generalize the timing of innovation transmission, suppose that we observe $\tilde{y}_\tau \sim$ NVAR($p,1$) every $q \in \mathbb{N}$ periods; let the observed series $y_t$ evolve according to the state space system

align[align omitted — 245 chars of source]

I dub this process NVAR($p,q$). $q$ indicates the relation between the frequency of network interactions, at which $\tilde{y}_\tau$ evolves, and the frequency at which data $\{y_t\}_{t=1:T}$ is observed. If $q=1$, the two coincide and, trivially, $y_t$ and $\tilde{y}_\tau$ are the same NVAR($p,1$) process. Instead, if $q>1$, then network interactions occur at higher frequency than data is observed. For example, under yearly observations, $q=4$ implies quarterly network interactions. As a result, multiple rounds of transmission occur in a single observational period and dynamics at horizon $h$ are affected by higher-order connections, $k>h$:

proposition[Granger-Causality in NVAR($p,q$)] \\[3pt] Let $y_t$ evolve as in (ref) for some $q \in \mathbb{N}$. Then, Granger-causality from $\tilde{y}_j$ to $\tilde{y}_i$ at horizon $h$ is a linear combination of connections from $i$ to $j$ of order $k \in \{\underline{k}, \underline{k}+1, ..., hq\}$, where $\underline{k} = ceil(hq/p)$.\footnotemark

\footnotetext{ Assuming again $\alpha_l > 0 \; \forall \; l$ and $a_{ij} \geq 0$, (ref) implies that $\tilde{y}_j$ Granger-causes $\tilde{y}_i$ at horizon $h$ iff there exists a connection from $i$ to $j$ of at least one order $k \in \{\underline{k}, \underline{k}+1, ..., hq\}$. }

(ref) implicitly assumes that $\tilde{y}_\tau$ is a stock variable; every $q$ periods we observe a snapshot of it. To accommodate a flow variable $\tilde{y}_\tau$, we can model $y_t$ as

align[align omitted — 276 chars of source]

with similar properties as under (ref).\footnote{ See (ref) and (ref). Analogous calculations apply if $y_t=\tilde{y}_\tau + ... + \tilde{y}_{\tau-q+1}$.}

By restricting the NVAR($p,q$) in (ref), we can accommodate more intricate relations between the frequencies of network interactions and observation; for any $q \in \mathbb{Q}_{++}$, we can write $q=q_1q_2$ with $q_2, q_1^{-1} \in \mathbb{N}$, and we can model $y_t$ as an NVAR($p^*,q_2)$ with $p^* = p/q_1 \in \mathbb{N}$ and with restricted parameters $\{\alpha_l\}_{l=1:p^*}$ to comply with the stated interpretations of $p$ and $q$. For example, under monthly observations, $q=4/3$ signifies that network interactions occur (roughly) every three weeks. This amounts to observing every $4$ periods a snapshot of a weekly process that depends on its value in the past $p$ $3$-week-periods, i.e. on its value three weeks ago, six weeks ago, and so forth, until $p^*=3p$ weeks ago. (ref) elaborates.

Further Properties of the NVAR

\paragraph*{Stationarity}

In the NVAR, the interdependence of $y_{it}$ and $y_{j,t-h}$ is an interplay of the cross-sectional distance between units $i$ and $j$ -- encoded by the network -- and the temporal distance between periods $t$ and $t-h$. Correspondingly, (ref) characterizes stationarity in terms of eigenvalues of the network adjacency matrix $A$ and roots of an AR process shaped by the timing of innovation transmission along a single link, $\alpha$.\footnote{ (ref) follows from (ref). Intuitively, the conditions ensure that $\lim_{k\rightarrow \infty}\; c(\alpha,k)A^k = 0$, for any polynomial in $\alpha$ of order $k$, $c(\alpha,k)$. By (ref), this ensures that the effects of disturbances vanish for higher horizons. } Under $p>1$, this simplifies checking for stationarity, especially for large $n$. Note that the second statement requires the AR($p$) process $(1 - \phi_1 L - ... - \phi_p L^p)x_t = v_t$ with $\phi_l = \alpha_l \lambda_i$ to be stationary for each eigenvalue $\lambda_i$ of $A$, though AR-coefficients are typically required to be real-valued.

corollary[NVAR($p,q$): Stationarity] \\[3pt] Let $y_t$ evolve as in (ref) or (ref) for some $q \in \mathbb{N}$. Let $\tilde{u}_\tau \sim WN(0,\Sigma)$, suppose $\alpha_l \neq 0$ for at least one $l$, and define $a = \sum_{l=1}^p |\alpha_l|$. If $|\lambda_i | < 1/a$ for all eigenvalues $\lambda_i$ of $A$, then $y_t$ is weakly stationary. Under $\alpha_l \geq 0 \; \forall \; l$, the implication is both-sided. Moreover, $y_t$ is weakly stationary iff for all eigenvalues $\lambda_i$ of $A$, the $p\times p$ matrix below has all eigenvalues inside the unit circle: $$ \begin{bmatrix} \alpha_1 \lambda_i & ... & \alpha_p \lambda_i \\ \multicolumn{2}{c}{I_{p-1}} & 0 \end{bmatrix} \; .$$

\paragraph*{Relation to SAR Model}

In all of economics, the literature overwhelmingly considers contemporaneous network interactions as embodied by the Spatial Autoregressive (SAR) model. If $x = (x_1, ..., x_n)'$ is the cross-sectional variable of interest, it posits

align[align omitted — 45 chars of source]

Provided that $|\lambda_i|<1$ for all eigenvalues $\lambda_i$ of $A$, we can write $x= (I-A)^{-1} v = (A + A^2 + A^3 + ...) v$. Hence, the implicit assumption is that connections of all order materialize in a single period. In line with that, (ref) establishes that the response of $x_i$ to an innovation $v_j$ in the SAR model from (ref) is equal to the long-run response of $y_{it}$ to a persistent innovation $\tilde{u}_{j\tau}$ in the NVAR($p,q$) from (ref) or (ref).\footnote{ (ref) follows from (ref). }

corollary[NVAR($p,q$): Long-Term Response to Persistent WN-Innovations] \\[3pt] Let $y_t$ evolve as in (ref) or (ref) for some $q \in \mathbb{N}$, and let $x = aA x + v$ with $a=\sum_{l=1}^p \alpha_l$. Assume $y_t$ is weakly stationary. Then, \begin{align*} \underset{H\rightarrow \infty}{\lim} \left[ { \frac{\partial y_{t+H}}{\partial \tilde{u}_{tq}} + \frac{\partial y_{t+H}}{\partial \tilde{u}_{tq+1}} + ... + \frac{\partial y_{t+H}}{\partial \tilde{u}_{(t+H)q}} } \right] = \frac{ \partial x }{ \partial v } = (I- a A)^{-1} \; . \end{align*}

Both responses are given by the Leontief inverse $(I- a A)^{-1}$, which is a sufficient statistic for the long-term cross-sectional comovement. By taking a stance on the timing and frequency of network interactions, the NVAR shows how any such long-term effects materialize over time; it goes beyond steady state comparisons and characterizes transitional dynamics.\footnote{ Note the correspondence between the timing of transitional dynamics and the timing of responses to temporary innovations; as for any VAR, the long-term response to a permanent innovation is equal to the cumulative response to temporary innovations. } $\alpha$ temporally decomposes the spatial autoregressive parameter $a$.

The long-run is defined in terms of the frequency of network interactions. To justify the use of the SAR at the expense of the NVAR, then, we need this frequency to be high enough and the data frequency to be low enough. (ref) formalizes this idea; if we define the observed process $y_t$ as the sum of an underlying process $\tilde{y}_\tau$ evolving at the higher frequency of network interactions, then, as this frequency diverges to infinity, $y_t$'s response to a high-frequency innovation that occurs within observational period $t$ converges to the response of $x_i$ to an innovation $v_j$ in the SAR model from (ref).\footnote{ (ref) follows from (ref), applied for $\rho_j=0$. }

corollary[NVAR($p,q$): Contemporaneous Response to Within-Period Innovation] \\[3pt] Let $y_t$ evolve as in (ref) for some $q \in \mathbb{N} \backslash\{1\}$, and consider $y_tq$. Then, for $g \in 0:(q-1)$, \begin{align*} \underset{g\rightarrow \infty}{\lim} q \frac{\partial y_{t}}{\partial \tilde{u}_{\tau-g}} = (I-aA)^{-1} \; . \end{align*}

\paragraph*{Difference to Exogenous Persistence}

Instead of relying on lagged network interactions, one can also introduce transitional dynamics to the SAR model from (ref) through autocorrelated innovations $v$. This approach is predominant in macroeconomic studies of input-output-economies; under fairly standard assumptions (see e.g. Carvalho-TahbazSalehi2019), sectoral production and prices evolve according to (ref), whereby $v$ is Total Factor Productivity (TFP), which -- across all areas of macroeconomics -- is typically assumed to follow an autoregressive process.\footnote{ It can be split into an idiosyncratic and an aggregate component; see (ref). } \todo{and in SAR some allow for autocorr. errors?} \todo{also, cite some others in footnote on idiosync. vs. agg. component}

Lagged network interactions and autocorrelated innovations lead to different kinds of dynamics. As first illustrated in (ref) for the NVAR(1,1), and as discussed throughout this section for the general NVAR($p,q$), lagged network interactions relate impulse-responses to network-connections of different order, whereby the precise mapping is determined by $\alpha$ and $q$. As a consequence, how strongly $y_i$ reacts to an impulse to $y_j$ depends on the strength of network-connections from $i$ to $j$ of relevant order, and how fast it reacts depends on how many lower- as opposed to higher-order connections the two units share. For instance, in the environment of GolubJackson2010 this implies that an individual adjusts their opinion faster after news shared by closer than more distant friends. Similarly, in the context of LongPlosser1983 it means that a sector contracts its production faster after a negative productivity shock to more immediate suppliers than to ones located further upstream.

In contrast, autocorrelated innovations lead to exponentially decaying impulse-responses. This shape is preserved when they are coupled with contemporaneous network interactions; if $x_t = aA x_t + v_t$ and $(1-\rho_jL)v_{jt} = \epsilon_{jt}$, then

align[align omitted — 144 chars of source]

The strength of connections from $i$ to $j$ merely scales the exponentially decaying impulse-response; network connections merely amplify exogenous dynamics.

When the two sources of dynamics are combined, their qualitatively distinct contributions remain. Consider an NVAR($p,1$), and let $(1-\rho_jL)u_{jt} = \varepsilon_{jt}$. Then, using (ref),

align[align omitted — 537 chars of source]

for $\underline{k}(l) = ceil(l/p)$. Under $\rho_j = 0$, this expression simplifies to (ref). Under $p=1$ and $\alpha_1 = 1$, it simplifies to $\sum_{l=0}^h \left[ {A^h} \right]_{ij} \rho_j^{h-l}$. While $\alpha$ determines the timing of innovation transmission along direct links and, therefore, also the timing of transmission along all higher-order connections from $i$ to $j$, $\rho_j$ determines the persistence of $y_i$'s response after each round of transmission.

(ref) illustrates for an NVAR($2,1$) and $\rho_j=.6$, once under $\alpha = (.8,.2)'$ (top row), once under $\alpha = (.2,.8)'$ (bottom row). The left panel depicts how connection-orders accumulate over horizons for these $\alpha$, while the middle and right panels show the resulting impulse-responses for two sectors that share only a first- or only a second-order connection, respectively. Under $\alpha=(.8,.2)'$, the innovation travels faster through the network than under $\alpha = (.2,.8)'$; in the former case, the transmission along a direct link (darkest blue dots and bars) is strongest after one period, in the latter after two periods. Consequently, under $\alpha=(.8,.2)'$, the transmission along second-order connections (lighter blue dots and bars) is strongest in the second period, under $\alpha = (.2,.8)'$ in the fourth period. The exogenous persistence ensures that the fraction $\rho_j$ of any transmission at horizon $h$ is carried over to horizon $h+1$, a fraction $\rho_j^2$ to horizon $h+2$, etc. (ever lighter gray bars).

figure[figure omitted — 2,395 chars of source]

Even under autocorrelated innovations, lagged and contemporaneous network interactions yield the same long-run responses. This is shown by (ref).\footnote{ (ref) follows from (ref). In contrast to (ref), it considers the long-run rather than contemporaneous response of $x$, since the implicit assumption in the SAR model with autocorrelated innovations is that they evolve at observational frequency. }

corollary[NVAR($p,q$): Long-Term Response to Persistent AR(1)-Innovations] \\[3pt] Let $y_t$ evolve as in (ref) or (ref) for some $q \in \mathbb{N}$, and let $x_t = a A x_t + v_t$, with $a =\sum_{l=1}^p \alpha_l$. Assume $y_t$ and $x_t$ are weakly stationary, and assume $(1-\rho_j L) u_{jt} = \varepsilon_{jt} \sim WN$ and $(1-\rho_j L) v_{jt} = \epsilon_{jt} \sim WN$, with $\rho_j \in [0,1)$. Then, \begin{align*} \underset{H\rightarrow \infty}{\lim} \left[ { \frac{\partial y_{i,t+H}}{\partial \tilde{u}_{j,tq}} + ... + \frac{\partial y_{i,t+H}}{\partial \tilde{u}_{j,(t+H)q}} } \right] = \underset{H\rightarrow \infty}{\lim} \left[ { \frac{\partial x_{i,t+H}}{\partial \epsilon_{j,t}} + ... + \frac{\partial x_{i,t+H}}{\partial \epsilon_{j,t+H}} } \right] = \frac{\left[ {(I- a A)^{-1}} \right]_{ij}}{1-\rho_j} \; . \end{align*}

\paragraph*{Networked Contemporaneous Correlation}

Trivially, contemporaneous network interactions lead to contemporaneous correlation among $\{x_i\}_{i=1:n}$; under (ref), we have $\mathbb{V}[x] = \mathbb{V}[(I-A)^{-1}v]$. In this case, $\text{Cov}(x_i,x_j)$ reflects the bilateral exposure between $i$ and $j$ and their mutual exposure to third units, whereby exposure is determined by network connections of all order.\footnote{ We have $\mathbb{V}[x]=\mathbb{V}[(I+A+A^2+...)v]$, provided that $|\lambda_i|<1$ for all eigenvalues $\lambda_i$ of $A$. Assuming that $\mathbb{V}[v] = \Sigma = diag(\sigma^2_1, ..., \sigma^2_n)$, we get $$ \text{Cov}(x_i,x_j) = \sigma^2_i \mathbf{1}\left\{ { i=j } \right\} + \sigma^2_j \sum_{h=1}^\infty \left[ {A^{h}} \right]_{ij} + \sigma^2_i \sum_{h=1}^\infty \left[ {A^{h}} \right]_{ji} + \sum_{o=1}^n \sigma^2_o \sum_{h_i=1}^\infty \sum_{h_j=1}^\infty \left[ {A^{h_i}} \right]_{io} \left[ {A^{h_j}} \right]_{jo} \; .$$ } DeGraeve-Schneider2023 exploit this insight for shock identification in the context of a production economy.

Networked contemporaneous correlation is obtained as soon as the network interaction-frequency exceeds the frequency of observation, even under finite values of the former. In an NVAR($p,q$), we can define the “{observable innovations}" $u_t = y_t - \mathbb{E}[y_t|\mathcal{F}_{t-1}]$, where $\mathcal{F}_{t-1} = \{\tilde{y}_{(t-1)q}, \tilde{y}_{(t-1)q-1}, ... \}$. Under $q=1$, $u_t = \tilde{u}_\tau$ inherits the variance of the exogenous innovations $\tilde{u}_\tau$. Under $q>1$, $u_t$ is a linear combination of past $\tilde{u}_\tau$, and its variance reflects units' bilateral exposure and mutual exposure to third units, whereby exposure is determined by network connections of orders $k \in 1:(q-1)$, along which the underlying innovations $\tilde{u}_\tau$ travel within a single period of observation. For example, if $y_t$ evolves as in (ref) for $q=2$, we have $u_t = \tilde{u}_\tau + (I+\alpha_1 A) \tilde{u}_{\tau-1}$. If $\tilde{u}_\tau \sim WN(0,\Sigma)$ with $\Sigma=diag(\sigma^2_1, ..., \sigma^2_n)$, then $$ \text{Cov}(u_{it},u_{jt}) = 2\sigma_i^2\mathbf{1}\left\{ { i=j } \right\} + \alpha_1 a_{ij}\sigma_j^2 + \alpha_1 a_{ji} \sigma_i^2+ \alpha_1^2 \sum_{k=1}^n a_{ik}a_{jk} \sigma^2_k \; . $$ Thus, $u_{it}$ and $u_{jt}$ comove based on $a_{ij}$, $a_{ji}$ and $\{a_{ik}a_{jk}\}_{k=1:n}$. (ref) state $\mathbb{V}[u_t]$ for the NVAR($p,q$) processes in (ref) and general $q>1$.

(ref) above establishes that an SAR for $x$ is obtained in the limit when writing $x$ as the sum of an underlying process driven by lagged network interactions that evolves at an ever higher frequency. In addition, by (ref), the Normality-assumption $v\sim N(0,\Sigma)$ in the SAR model can be justified by temporally independent high-frequency innovations $\tilde{u}_\tau$ with $\mathbb{V}[\tilde{u}_\tau] = q^{-1}\Sigma$. Concretely, for the NVAR($p,q$) from (ref) and for $a= \sum_{l=1}^p \alpha_l$, (ref) shows that $\sqrt{q}u_t \overset{d}{\rightarrow} N\left( { 0, \mathbb{V}[(I-aA)^{-1}\tilde{u}_\tau] } \right)$ as $q \rightarrow \infty$, provided the high-frequency innovations $\tilde{u}_\tau$ are strictly stationary.

proposition[NVAR($p,q$): Limit Distribution of “{Observable Innovations}"] \\[3pt] Let $y_t$ evolve as in (ref) for some $q \in \mathbb{N} \backslash\{1\}$. Assume $y_t$ is weakly stationary and $\tilde{u}_\tau \sim WN(0,\Sigma)$ is temporally independent. Define $u_t \equiv y_t - \mathbb{E}[y_t|\mathcal{F}_{t-1}]$, where $\mathcal{F}_{t-1} = \{\tilde{y}_{\tau-q}, \tilde{y}_{\tau-q-1}, ... \}$. Also, let $a = \sum_{l=1}^p \alpha_l$. Then, as $q \rightarrow \infty$, \begin{align*} \sqrt{q}u_t \overset{d}{\rightarrow} N(0,\Gamma_* \Sigma \Gamma_*') \; , \quad \Gamma_* = (I-aA)^{-1} \; . \end{align*}

\paragraph*{Relation to Dynamic Factor Model}

The NVAR is a restricted VAR in which innovations transmit across series along constant, bilateral links (in one direction). Relative to a VAR($p$) with $p>1$, the NVAR($p,1$) induces parsimony; e.g. for each $y_{it}$, the $n$ links $\{a_{ij}\}_{j=1:n}$ in $A_{i\cdot}$ summarize the information in the $np$-dimensional set $\{y_{j,t-l}\}_{j=1:n,l=1:p}$:

align[align omitted — 134 chars of source]

where $x_{it} = \sum_{j=1}^n a_{ij}y_{j,t-l}$ is the $i$th row of $X_t = [A y_{t-1}, ..., A y_{t-l}]$. If, in addition, the network $A$ is sparse -- as is the case across a wide range of applications\todo{cite some general ref.; Jackson-book? who else?} --, then the NVAR rationalizes the dynamic comovement among all $\{y_{it}\}_{i=1:n}$ by the dynamic innovation transmission along few bilateral links among $i=1:n$.

The Dynamic Factor Model (DFM) also reduces dimensionality by summarizing a large set of predictors by a few linear combinations.\todo{cite here; Ambrogio's paper, and look up original source?} (ref) shows that the NVAR($p,1$) can be written as a DFM, while a DFM with restricted factor dynamics can be written as an NVAR($p,1$) in the limit as $n \rightarrow \infty$.\footnote{ The second part of (ref) restricts $f_t \in \mathbb{R}^r$ to follow an NVAR($p,1$). This is less restrictive than it may seem; for $p=1$, it requires $f_t \sim VAR(p)$, while under $r=1$ it requires $f_t \sim AR(p)$. Also, note that, as usual, the factor representation is not unique, and we can re-scale $A$ and $\phi$ to ensure $a_{ij} \in [-1,1]$.} Together with (ref) above, it suggests that, at the cost of restricting factor dynamics, the NVAR allows the linear combinations of predictors to vary more flexibly across units, to the point that it naturally acommodates sparse factors as (linear combinations of) locally important units in the network.\footnote{ The DFM constructs $\{\mathbb{E}_{t-1}[y_{it}]\}_{i=1}^n$ as different ($\Lambda_{i\cdot}$) linear combinations of the same factors $f_t$, which in turn are linear combinations of observables. In contrast, the NVAR constructs $\{\mathbb{E}_{t-1}[y_{it}]\}_{i=1}^n$ as the same ($\alpha$) linear combination of different covariates $x_{it}$, which in turn are linear combinations of observables.}

proposition[NVAR($p,1$)-Factor Model Equivalence Result] \\[3pt] Let $y_t$ evolve as in (ref). Let $r$ be the rank of $A$. Then, we can write $$ y_t = \Lambda f_t + u_t \; , \quad \text{with} \; \; f_t \in \mathbb{R}^r \; .$$ Conversely, let $y_t = \Lambda f_t + \xi_t$, with $f_t \in \mathbb{R}^r$. Assume $f_t = \Phi_1 f_{t-1} + ... + \Phi_p f_{t-p} + \eta_t$, with $\Phi_l = \phi_l \Phi$ for each $l=1:p$ and some $\Phi$. Then, as $n\rightarrow \infty$, we can write $$ y_t = \phi_1 A y_{t-1} + ... + \phi_p A y_{t-p} + u_t \; , \quad u_t = \Lambda \eta_t + \xi_t \; ,$$ where $A = \Lambda \Phi (W \Lambda)^{-1} W$ and $W$ is any $r\times n$ matrix with distinct rows.

Dynamics via Lagged Network Effects: Inference

The NVAR can be used to estimate dynamic (lagged) network effects, as determined by $\alpha$, the time profile of network effects. When the network $A$ is estimated as well, it can also be used as a dimensionality-reduction technique useful for forecasting (cross-sectional) processes. In (ref), I discuss inference on $\alpha$, treating $A$ as given. In (ref), I discuss joint inference on $(\alpha,A)$. Details are in (ref).

Timing of Network Effects

\paragraph*{NVAR($p,1$)}

The NVAR($p,1$) from (ref) can be written as the linear regression in (ref). Defining $\Sigma = \mathbb{V}[u_t]$, we obtain the Least Squares (LS) estimator for $\alpha$:

align[align omitted — 178 chars of source]

As usual, under $u_t\sim N(0,\Sigma)$, it is also the (conditional) Maximum Likelihood (ML) estimator and the posterior-mean and -mode under a Uniform prior for $\alpha|\Sigma$. Under $\Sigma=I$, it yields the OLS estimator, which takes a “{pooled}" form:

align*[align* omitted — 251 chars of source]

(ref) establishes consistency and asymptotic Normality of $\hat{\alpha}_{OLS}$ under large $T$, large $n$ and large $(n,T)$ asymptotics. The derivations under large $n$ assume that the observed network adjacency matrix $A_n$ converges to some limit $A_*$ so that, for example, $\frac{1}{n} \sum_{i=1}^n \left( { A_{n,i\cdot} y_{t-l}} \right)' u_{it} \overset{p}{\rightarrow} \mathbb{E}\left[ { \left( { A_{*,i\cdot} y_{t-l}} \right)' u_{it} } \right]$. \todo{verify; at least notation could be better: $y_t$ also depends on $n$; it's not $A$ taht converges, but network-statistics}

We can estimate $\Sigma$ standardly by $\hat\Sigma|\alpha = \frac{1}{T}\sum_{t=1}^T u_t u_t'$. The joint ML estimator $(\hat\alpha,\hat\Sigma)$ is obtained by iterating on $\hat{\alpha}|\Sigma$ and $\hat\Sigma|\alpha$ until convergence (see MengRubin1993).

\paragraph*{NVAR($p,q$)}

In case of an NVAR($p,q$), as defined in (ref), an estimator for $\alpha$ can be obtained by data augmentation.\footnote{ The discussion holds likewise for the NVAR($p,q$) from (ref). } However, point identification is not guaranteed. For example, under $q=2$ and $p=1$, the observed process follows

align*[align* omitted — 137 chars of source]

which suggests that $\alpha_1$ is identified only up to sign. The identification problem is akin to estimating an AR($p$) observed every $q$ periods, discussed in PalmNijman1984.\footnote{ It is also similar to estimating continuous time models using discrete time data (see e.g. Phillips1973).}\todo{add DSGE citation?} It is due to the fact that the mapping between the parameters $\alpha$ in the high-frequency process $\tilde{y}_\tau$ and the parameters in the observed process $y_t$ is generally not bijective. For a general AR($p$) and $q=2$, the vector $(\alpha_1, \alpha_3, ...)$ is identified (jointly) up to sign (see (ref)).

In the application in (ref), the restrictions on $\alpha$ imposed by economic theory render $\alpha$ point-identified, as suggested by a unique posterior mode under Uniform priors. In other cases, one could follow the suggestion of PalmNijman1984 and inform the estimation of $\alpha$ with a prior. This is facilitated by the clear interpretation of $\{\alpha_l\}_{l=1:p}$; it is the GIRF for units $i$ and $j$ that only share a first-order connection (see (ref)) and indicates how innovations transmit along a single link over time.

Conditioning on $\tilde{\Sigma}$, the posterior $p(\alpha|Y_{1:T})$ can be obtained using the Gibbs sampler of CarterKohn1994. Treating the unobserved data in $\tilde{Y}_{1:T_\tau}$ as parameters, it iteratively draws from $p(\tilde{Y}_{1:T_\tau}|\alpha,Y_{1:T})$ and $p(\alpha | \tilde{Y}_{1:T_\tau})$ to obtain a sample from $p(\alpha, \tilde{Y}_{1:T_\tau}|Y_{1:T})$.\footnote{The particular state space model where in some periods $\tau$ no data is observed implies that in these periods the updating-step of the Kalman filter is skipped and the updated distribution of states equals their predicted distribution. See (ref), and see SchorfheideSong2015 for a discussion of the analogous case of a mixed-frequency VAR.} Under a Uniform prior for $\alpha$, the resulting posterior mode of $\alpha$ converges to the ML estimator obtained using the Expectation-Maximization (EM) algorithm.\todo{citation? or show in appendix?!} To estimate $\tilde{\Sigma}$ as well, an additional iteration step is added to the Gibbs sampler. Using a uniform prior, we get an Inverse-Wishart conditional posterior for $\Sigma |\tilde{Y}_{1:T_\tau}, \alpha$ with mode $\frac{1}{T_\tau}\sum_{\tau=1}^{T_\tau} \tilde{u}_\tau \tilde{u}_\tau'$.

Joint Inference: Network & Effect-Timing

When interest lies in dynamic network effects, joint estimation of $(\alpha,A)$ is useful because network data may be difficult to collect or it may appear restrictive to condition the analysis on available network data. In addition, estimating $(\alpha,A)$ jointly enables us to use the NVAR as a dimensionality-reduction technique.

\paragraph*{NVAR($p,1$)}

The NVAR($p,1$) from (ref) can also be written as the linear regression

align[align omitted — 106 chars of source]

where $z_t = \sum_{l=1}^p \alpha_l y_{t-l} = \big[ y_{t-1},y_{t-2},...,y_{t-p} \big] \alpha $, and the $T \times n$ matrices $Y$, $Z$ and $U$ stack $y_t$, $z_t$ and $u_t$ along rows, respectively. To simplifty notation, I suppress the dependence of $z_t$ on $\alpha$ and that of $X_t$ on $A$.

To render $(\alpha,A)$ jointly identified, I normalize $\alpha_1 = 1$, with appropriate redefinitions of $\alpha$ as well as $y_t$, $z_t$ and $X_t$. Relative to the alternative of restricting the norm of $\alpha$, this normalization facilitates analytical calculations and asymptotic analysis, but it requires $\alpha_1 \neq 0$ in the true data generating process.\footnote{ In case $a_{ij} \geq 0$ is restricted, it requires $\alpha_1 > 0$. }

Suppose data on a network $B$ with elements $b_{ij}$ is available. Under independent priors $a_{ij} \sim N(b_{ij},\lambda_a^{-1})$, we obtain a matrix-variate Normal conditional posterior for $A$:

align*[align* omitted — 261 chars of source]

Its mean and mode, $\bar{A}'$, is the conditional optimizer for $A$ under a LS objective function with a Ridge-penalty:

align[align omitted — 222 chars of source]

As $\lambda_a \rightarrow \infty$, we impose $A=B$. As $\lambda_a \rightarrow 0$, we ignore $B$ and infer $A$ from the data alone. No domain restrictions on $A$ are imposed because any parameter value $(\alpha,A)$ can be rescaled to yield $a_{ij}\in [-1,1] \; \forall \; i,j$, so that $A$ can be interpreted as a network.\footnote{To enforce $a_{ij} \in [0,1]$ even under low $\lambda_a$, $a_{ij} \geq 0$ must be imposed. This leads to the high-dimensional Normal posterior being truncated to $\mathbb{R}^{n^2}_{+}$ and considerably complicates the analysis, as both computing the mode and drawing from this distribution is computationally intensive.}

Under a Laplace prior, the conditional posterior of $A$ and its mode -- the Lasso estimator -- is available analytically when imposing $a_{ij}\geq 0$ and shrinking to $b_{ij}=0$. We get

align*[align* omitted — 250 chars of source]

truncated to $\mathbb{R}_+^{n^2}$. Drawing from this distribution or computing its mode is computationally feasible only for a diagonal $\Sigma$, which renders the distribution of each row $i$ of $A$ independent across $i$. Under $\Sigma=I$, we get $$ A_{i\cdot} \mid (Y, \alpha, \Sigma=I, \lambda_a) \sim N \left( { (\bar{A}')_{i,\cdot}, \bar{U}_A} \right) \; , \quad \text{truncated to} \; \mathbb{R}_+^{n} \; . $$ A draw from this distribution is obtained using Gibbs sampling by iteratively drawing from the Normal conditional densities $a_{ij} \mid (A_{i,-j}, Y, \alpha, \Sigma=I, \lambda_a)$ for $j=1:n$. Its mode is computed by iterating on the latters' modes.\footnote{Taken together, these two results mean that we can draw from the distribution of $A \mid (Y, \alpha, \Sigma, \lambda_a)$ or compute its mode by iterating on each column of $A$ given all other columns.}

Given $\Sigma$ and $\lambda_a$, the joint posterior $p(\alpha,A|Y)$ is obtained by Gibbs sampling, iteratively drawing from the conditional posteriors $p(A | Y, \alpha, B, \Sigma, \lambda_a)$ and $p(\alpha|Y,A, \Sigma)$. To estimate $\Sigma$ as well, an additional step is added to draw from $p(\Sigma | \alpha, A, Y)$. Under uniform priors for $\alpha$ and $\Sigma$, the posterior mode of $p(\alpha,A,\Sigma|Y)$ is equal to the GLS estimator ($\hat{\alpha},\hat{A},\hat{\Sigma})$ of the objective function in (ref), obtained by iterating until convergence on the three respective conditional estimators. Fixing $\Sigma=I$, we obtain the OLS estimator of $(\alpha, A)$, for which consistency and asymptotic Normality under $T \rightarrow \infty$ are established in (ref). The choice of $\lambda_a$ for predictive purposes as well as the possibility to construct $B$ as a combination of multiple link-types is discussed in (ref).\todo{yes, do that!}

\paragraph*{NVAR($p,q$)}

As in the estimation of $\alpha|A$, if the network interaction frequency is higher than the observation frequency, joint inference on $(\alpha,A)$ can be conducted by relying on data augmentation. As before, identification is not guaranteed. In fact, relative to the estimation of $\alpha|A$ the problem is likely worsened, even if $A$ may be tightly shrunk to a known (or sparsely parameterized) network $B$. However, the estimation of $(\alpha,A)$ in the application in (ref) of this paper is judged based on forecasting performance, not its ability to deliver point identification.

Business Cycles by Lagged Input-Output Conversion

LongPlosser1983 show that time lags between the production of goods and their subsequent use as intermediaries for producing other goods can generate endogenous business cycles. In this application, I empirically quantify the importance of their proposed channel. I generalize their RBC economy with one-period lagged IOC by assuming that firms' production requires inputs produced in the past $p$ periods. This leads to sectoral output growth evolving at some model-frequency as an NVAR($p,1$), which translates into an NVAR($p,q$) for some $q\in \mathbb{N}$ at my monthly frequency of observation. Thereby, $A$ is the input-output matrix, $u_t$ contains sectoral productivity processes, while $\{\alpha_l\}_{l=1:p}$ show how input-sourcing is spread out over the $p$ periods. By estimating $\alpha$, $q$ and the persistence in $u_t$, I use the NVAR to quantify the extent to which business cycles in this framework are due to lagged IOC as opposed to persistence in exogenous productivity processes.

After theoretically motivating the analysis in (ref), I discuss the setup, data and estimation in (ref). (ref) presents the results. Details are in (ref).

Theory

The following analysis is based on Carvalho-TahbazSalehi2019 -- who discuss a static economy -- and the Appendix to AcemogluAkcigitKerr2016. Derivations are in (ref).

Assume there are $n$ sectors, in each of which a representative firm produces a differentiated good $i$ by combining labor services $l_{i\tau}$ and goods produced by other sectors $j$, $\{x_{ij\tau}\}_{j=1}^n$, using a constant returns to scale (CRS) Cobb-Douglas production function. Firms maximize profits, taking prices as given. The profits of firm $i$ in period $\tau$ are

align*[align* omitted — 210 chars of source]

where $b_i > 0$, $a_{ij} \geq 0$ and $b_i + \sum_{j=1}^n a_{ij} = 1$. $z_{i\tau}$ denotes Total Factor Productivity (TFP) in sector $i$, $\{p_{i\tau}\}_{i=1}^n$ are the prices of the $n$ different goods, and $w_\tau$ is the price of labor. $x_{ij\tau}$ is the amount of good $j$ used in the production at time $\tau$. As discussed below, it can differ from the amount of good $j$ purchased in period $\tau$, $x^{ij}_\tau$.

In this environment, prices are entirely determined by supply. To characterize output, I assume the presence of a representative household who supplies one unit of labor inelastically and exhibits log-preferences over the $n$ goods:

align*[align* omitted — 178 chars of source]

where $\sum_{i=1}^n \gamma_i = 1$. The first-order condition (FOC) yields $c_{i\tau} = \gamma_i \frac{w_\tau}{p_{i\tau}}$.\footnote{Hence, $\gamma_i$ is the share of good $i$ in households' expenditures.} This result holds even if households have access to a storage technology, as market clearing under representative households in a closed economy implies that households spend their whole period $\tau$ income, $w_\tau$, on consumption. \todo{see P009diary3, p.152 for dynamic HH problem}

Different assumptions on the timing of IOC lead to different dynamics of sectoral prices and output in this economy. Typically, it is assumed that inputs are converted into outputs in the same period when they are purchased, i.e. $x_{ij\tau} = x^{ij}_\tau$. Dropping time subscripts in this static environment, define $\tilde{y} = ln(y)$, $y= (y_1, ..., y_n)$ and analogously for $\tilde{z}$. In equilibrium, sectoral output satisfies

align[align omitted — 88 chars of source]

where $k^y$ is a vector of constants, and $a_{ij} = p_j x^{ij} / (p_i y_i)$ is value of good $j$ purchases by sector $i$ as a fraction of the value of sector $i$'s output. In this environment, while the network $A$ amplifies idiosyncratic TFP shocks and therefore affects the variance of $\tilde{y}$, any autocorrelation in $\tilde{y}$ is inherited from that in $\tilde{z}$ (see e.g. Carvalho2010,AcemogluEtAl2012).

To analyze dynamics under lagged IOC, I assume perfect foresight.\footnote{ As discussed in FanHongParro2023, this assumption is standard for modeling dynamic spatial economies, which are closely related to dynamic network economies.} If, as in LongPlosser1983, it takes one period to convert purchased inputs into output, then $x_{ij\tau} = x^{ij}_{\tau-1}$ and sectoral output approximately follows an NVAR($1,1$):

align*[align* omitted — 88 chars of source]

where the time variation in $k^{y1}_\tau$ is due to time variation in the numéraire $w_\tau$. So long as $\beta < 1$, in steady state, prices are higher and output is lower than in the economy with contemporaneous IOC. Also, the meaning of $a_{ij} = \beta^{-1}p_j x^{ij} / (p_i y_i)$ changes slightly. These differences vanish as $\beta \rightarrow 1$. More importantly, while the former, static economy is always in steady state, the economy with one period-lagged IOC features transition dynamics; after a disturbance to $\tilde{z}_\tau$, $\tilde{y}_\tau$ only asymptotically converges to steady state.\footnote{ Relatedly, as discussed in (ref), the response of $\tilde{y}_{(\tau)}$ to a change in $\tilde{z}_{(\tau)}$ in the static economy corresponds to the long-term response of $\tilde{y}_{\tau}$ to a permanent change in $\tilde{z}_{\tau}$ in this dynamic economy (disregarding the slightly changed meaning of $a_{ij}$).} It is due to these transition dynamics that this framework can generate endogenous business cycles, i.e. autocorrelation in $\tilde{y}_\tau$ even in absence of autocorrelation in $\tilde{z}_\tau$.

To take the economy with lagged IOC to the data, I generalize the lag length by assuming that firms require inputs produced in the past $p$ periods for production. For ease of exposition, let $p=2$. Let $x_{ij\tau}$ aggregate quantities of input $j$ purchased at different periods in the past using a Constant Elasticity of Substitution-aggregator:

align*[align* omitted — 201 chars of source]

where $x^{ij}_{\tau,\tau-h}$ denotes the use of good $j$ purchased at time $\tau-h$ in the production of good $i$ at time $\tau$.\footnote{ This means that a good perishes after two periods (with regard to its suitability as an input in production). Therefore, the amount of good $j$ purchased at time $\tau$ can be used in production at periods $\tau+1$ and $\tau+2$: $x^{ij}_\tau = x^{ij}_{\tau+1,\tau} + x^{ij}_{\tau+2,\tau}$.} This shortcut stands for frictions like delivery costs and -lags and storage capacity constraints KhanThomas2007, AlessandriaKaboskiMidrigan2010, LiuTsyvinski2024, AntrasTubdenov2025.\footnote{ As in the LongPlosser1983-economy above, the presumption is that storage is done by the buyer.} In the Cobb-Douglas case $r\rightarrow 0$, sectoral output approximately follows an NVAR(2,1):

align[align omitted — 156 chars of source]

where once again $k^{y2}_\tau$ varies over time only to the extent that the numéraire $w_\tau$ changes in value. Under a more general elasticity of substitution $r \in [0,1)$,\footnote{ This notably excludes complementarity ($r<0$) and perfect substitutability ($r=1$). } the analogous result is obtained by log-linearizing around the steady state (see (ref)). This specification nests the one period-lagged economy, which is obtained under $\alpha_2 = 0$. Relative to that case, $\alpha_2 >0$ increases prices and decreases output in steady state, provided that $\beta < 1$. Also, we have $a_{ij} = \left[ { \beta \alpha_1 + \beta^2 \alpha_2 } \right]^{-1} (p_j x^{ij})/(p_i y_i)$. As $\beta \rightarrow 1$, the links $a_{ij}$ retain their interpretation as the output shares of different inputs $j$ in the production of good $i$. The parameters $(\alpha_1,\alpha_2)$ show the shares of an input $j$ purchased at different periods in the past in the overall usage of input $j$ in the production of good $i$. Their homogeneity means that the time profile of input-sourcing is assumed to be constant over time and across input-output pairs $(i,j)$. The restrictions $\alpha_1, \alpha_2 \geq 0$, $\alpha_1 + \alpha_2 = 1$ and $\sum_{j=1}^n a_{ij} < 1 \; \forall \; i$ imply that $\tilde{y}_\tau$ is stationary as long as $\tilde{z}_\tau$ is.\footnote{ BermanPlemmons1994 show that for an element-wise nonnegative matrix with row sums strictly smaller than 1, the absolute value of the largest eigenvalue is strictly less than 1. Stationarity then follows by (ref). }

The theory above does not restrict the process of (log) sectoral TFP $\tilde{z}_{i\tau}$. In general, it may display secular growth and persistent shocks of both aggregate and idioyncratic nature. Consider a difference-stationary specification with aggregate and idiosyncratic TFP processes $e^a_\tau$ and $e_{i\tau}$ evolving as AR(1) processes as in FoersterSarteWatson2011: $$ \Delta \tilde{z}_{i\tau} = \gamma_i + \delta_i e^a_\tau + e_{i\tau} \; , $$ $(1- \rho_a L) e^a_{\tau} = \varepsilon^a_{\tau} \sim WN$ and $(1-\rho_i L) e_{i\tau} = \varepsilon_{i\tau} \sim WN$. Under contemporaneous IOC ((ref)), this leads to

align[align omitted — 142 chars of source]

We obtain IRFs $\partial \Delta \tilde{y}_{i,\tau+h}/ \partial \varepsilon_{j,\tau}$ and $\partial \Delta \tilde{y}_{i,\tau+h}/\partial \varepsilon^a_\tau$ akin to those in (ref) in (ref). This points to two sources of persistence in output growth: persistence in the aggregate TFP process $e^a_\tau$ and persistence in idiosyncratic TFP processes $\{e_{i\tau}\}_{i=1}^n$. The role of input-output links is limited to amplification; the response of output growth in sector $i$ to a TFP shock in sector $j$ is scaled by element $(i,j)$ of the Leontief-inverse $(I-A)^{-1}$, as in Carvalho2010. By summing up connections of all order from $i$ to $j$, the latter shows the importance of sector $j$ in sector $i$'s supply chain.

Lagged IOC can be an additional source of persistence. Under (ref), we get

align[align omitted — 194 chars of source]

which leads to IRFs $\partial \Delta \tilde{y}_{i,\tau+h}/ \partial \varepsilon_{j,\tau}$ and $\partial \Delta \tilde{y}_{i,\tau+h}/\partial \varepsilon^a_\tau$ akin to those in (ref) in (ref). As discussed in (ref), lagged IOC and TFP shocks' autocorrelation imply distinct dynamics; $\alpha$ relates the timing at which a sector's output is first impacted by a TFP shock in another sector and the strength of the ensuing response to network connections of different order, whereas $\rho_a$ and $\{\rho_j\}_{j=1:n}$ induce an exponentially decaying response after every round of networked transmission.

Under a difference-stationary specification for log sectoral TFP $\tilde{z}_\tau$, TFP shocks have temporary effects on output growth, but persistent effects on output levels. By (ref), the long-term response of (log) output to a TFP shock -- equal to the cumulative response of output growth -- is the same under contemporaneous and lagged IOC, in line with the fact that any TFP level yields the same steady state in both economies (disregarding differences in $A$ between the two).

To take the processes in (ref) and (ref) to the data, one has to take a stance on what a period in the theoretical models above signifies. Let $\{\Delta y_t \}_{t=1}^T$ be observed output growth. As it is a flow variable, the model-frequency must be either equal to the observational frequency or an integer-multiple thereof (see (ref)):

align[align omitted — 162 chars of source]

and for $q \in \mathbb{N}$. Other things equal, under a higher $q$ the economy approaches faster the new steady state level of output following a TFP shock. Relatedly, under lagged IOC, it also means that the IRFs at any single horizon increasingly depend on higher-order connections, and it leads to network-induced cross-sectional correlation in innovations at observational frequency, whereas for $q=1$ the correlation is entirely due to aggregate TFP shocks.\footnote{ See (ref) as well as (ref) for more detailed discussions of these points. In the limit as $q \rightarrow \infty$, the long-term response referenced in (ref) -- a function of all connection-orders -- materializes after a single observational period. } As the meaning of $q$ depends on the frequency of observation, its choice is discussed in (ref).

Application-Setup, Data & Estimation

\todo{need to discuss aggregation weights} \todo{need to do a more careful decomposition analysis; see latex comment}

I quantify the relative contributions of these two (three) drivers of aggregate persistence as seen through the lens of the theory of real business cycles with contemporaneous and lagged IOC. To do so, I estimate the state space models characterized by (ref) and (ref), respectively, based on industrial production growth across US manufacturing sectors, while calibrating the links $a_{ij}$ using input-output data. The analysis first seeks to determine whether there is a role for lagged IOC at all by comparing the data fit of specifications with lagged IOC to that with contemporaneous IOC based on model selection criteria. Presuming that one of the former is preferred, the role of lagged IOC can be quantified by computing the change in the autocorrelation implied by the estimated model with lagged IOC when the persistence in TFP shocks is set to zero.

I compute log differences of monthly industrial production (IP) indices across 23 manufacturing and mining sectors in the US economy provided by the Federal Reserve Board. The indices are available from January 2005 through August 2022. \todo{sure? not later?} To eliminate seasonal patterns, I regress each series on month-dummies, take the residuals and add back the mean. To construct $A$, I use annual data on input-output (IO) matrices provided by the Bureau of Economic Analysis (BEA). I take the input-output matrix for 2010. Following the theory in (ref), links $a_{ij}$ are calibrated as

align*[align* omitted — 72 chars of source]

where $sales_{j \longrightarrow i}$ is the total value of goods and services purchased by sector $i$ from sector $j$ as determined by the corresponding entry in the BEA's “{use}" table.\footnote{This is in line with the literature. See AcemogluAkcigitKerr2016 for example. Carvalho-TahbazSalehi2019 discuss the IO data in more detail.} The value of $a_{ij}$ shows how many dollars worth of output of sector $j$ sector $i$ needs to purchase in order to produce one dollar's worth of its own output. I abstract from the differences in the calibration of $a_{ij}$ between contemporaneous and lagged IOC, which renders the analysis valid as $\beta \rightarrow 1$. More importantly, the calibration assumes that firms' input shares reported for the course of a year are equal to those at higher frequency intervals. Details on the matching of IP and IO data is provided in (ref).

For the specification with lagged IOC, I consider $p=\{1,2,3,4,5,6\}$ and $q \in \{1,2,3\}$, implying network interaction frequencies of a month, two weeks and 10 days. Under contemporaneous IOC, I take $q=1$, as it already refers to the limit case of an infinitely high frequency of network interactions. In both cases, I consider Normal AR(1) processes for idiosyncratic and aggregate TFP: $(1-\rho_a L) e^a_{\tau} = \varepsilon^a_{\tau} \sim N(0,\sigma^2_a)$ and $(1-\rho_iL) e_{i\tau} = \varepsilon_{i\tau} \sim N(0,\sigma^2_i)$. To separately identify both TFP processes, I normalize $\sigma^2_a = 1$ and $\delta_1 = 1$, re-defining $\delta$. To accommodate the restrictions $\alpha_l \geq 0 \; \forall \; l$ and $\sum_{l=1}^p \alpha_l = 1$, I drop $\alpha_p$ from $\alpha$ and impose the domain restrictions $\alpha_l \in [0,1]$ for $l=1:p-1$ and $\sum_{l=1}^{p-1} \alpha_l \leq 1$. Under lagged IOC, this yields $p-1 + 4n$ unknown parameters: $\theta = (\alpha',\gamma',\delta',\rho_a,\rho', \sigma^{2\prime})'$, where $\rho$ and $\sigma^2$ stack $\{\rho_i\}_{i=1}^n$ and $\{\sigma^2_i\}_{i=1}^n$, respectively. Under contemporaneous IOC, $\alpha$ is dropped from $\theta$, leading to $4n$ parameters.\footnote{ With $n=116$ sectors and $T=211-p$ periods available for estimation, this yields an observations-to-parameters ratio of 52.5 under $p=1$ and 50.7 under $p=6$. }

The inference from (ref) is not applicable because of the autocorrelation and factor structure of TFP processes and due to the restrictions on $\alpha$ under lagged IOC. The likelihood of both models can be evaluated with a Kalman filter, as stated in (ref). I consider Bayesian inference on $\theta$ under uniform priors on the respective domains.\footnote{ Specifically, $\rho_i, \rho_a \in [0,1)$ and $\sigma^2_i, \sigma^2_a \in \mathbb{R}_{++}$ for $i=1:n$, $\delta \in \mathbb{R}^n$ and $\alpha \in [0,1]^{p-1} \cap \{\alpha: ||\alpha||_1 \leq 1\}$. } As a result, the posterior mode equals the Maximum Likelihood estimator. The posterior is obtained numerically using a Sequential Monte Carlo algorithm, which -- as a by-product -- estimates the marginal likelihood and therefore enables model selection. \todo{mention also that SMC traces well whole posterior and is used under possible bi-modality, and in our case there is no such thing (unique MLE, identified params)?}

Results

(ref) reports the Marginal Data Density (MDD) for different specifications of the model with lagged IOC. For comparison, its value under contemporaneous IOC is -11,590. This number is beaten by all but a few lagged IOC specifications with $q=1$. The most preferred specification features $q=2$ and $p=5$, i.e. bi-weekly network interactions where innovations travel 2.5 months along single input-output links. The subsequent analysis is based on this preferred specification.

\todo{compare my alpha and q to Ramey(1989)}

table[table omitted — 921 chars of source]
figure[figure omitted — 1,676 chars of source]

\todo{put IRFs on RHS top of each other}

\todo{put in footnote: this is like mediation analysis in Dufour & Wang (2023); they do it by variable, I do it by connection order.}

(ref) illustrates the composition of impulse responses, analogously as (ref) does for two units that share only a first- or second-order connection. The top-left panel shows the estimated temporal propagation of TFP shocks along supply chain linkages of different order. Remarkably, within the first two months after the shock, the impact is mostly limited to direct customer-sectors. After that, the shock spreads somewhat more quickly to higher-order connections.

The top-right panel shows the strength of network connections of different order from the sector “{Fabricated Metal Products}" to the sectors “{Mining (except oil and gas)}" and “{Chemical Products}", respectively. Firms producing fabricated metals depend on chemical products directly as well as indirectly in their supply chain. In contrast, they rely on mining products only indirectly, though this higher-order dependence is of a similar magnitude.

The lower panels of (ref) illustrate the resulting impulse responses to a respective one standard deviation idiosyncratic TFP shock to Chemical Products and Mining. As a result of its stronger direct reliance on chemicals, the response of the growth in the production of fabricated metals to a TFP shock in the chemical sector materializes much faster than does the response to a TFP shock in mining. Yet, the two are of a similar magnitue at their peaks.

The responses refer to percentage point increases in sectoral output growth. To interpret the magnitudes, recall that the data is in monthly frequency and that the (persistent) response of the level of sectoral output is obtained by summing up the illustrated (transitory) response of output growth. Expectedly, the magnitudes are rather small, as they refer to responses of sectoral output to idioyncratic TFP shocks in a single other sector.

figure[figure omitted — 824 chars of source]

Larger responses are obtained when considering aggregate TFP shocks. On top of their direct effect on the output growth of all sectors, the latter have an indirect effect, as the supply chain network amplifies initial effects. (ref) shows the respones of output growth in the sectors “{Oil and Gas Extraction}" and “{Machinery}" to a one standard deviation shock to aggregate TFP. The oil and gas extraction sector is positioned rather at the top of supply chains. Due to its weak reliance on other sectors as suppliers, its response to aggregate TFP shocks is only weakly amplified by supply chain connections. In contrast, after a similar initial response, the machinery sector experiences a hump-shaped response due to second-order transmission operating via its supplier-sectors. The relevant network-quantity for these IRFs is a sector's weighted reliance on all other sectors as suppliers, with weights given by their exposures to the aggregate TFP shock, $\delta$ (see (ref)).

figure[figure omitted — 893 chars of source]

A similar reasoning explains the differing IRFs of aggregate output growth to sectoral TFP shocks. (ref) shows these responses to TFP shocks in “{Mining (except oil and gas)}" and “{Chemical Products}", respectively. As the chemical sector sits on the top of supply chains, it leads to a much more persistent increase in aggregate industrial production than does an increase in the TFP in the mining industry. The relevant network-quantity for these IRFs is all sectors' weighted reliance on the particular sector in question as a supplier, with weights given by sectors' contribution to aggregate output growth.

figure[figure omitted — 781 chars of source]

Existing studies use a static framework of contemporaneous input-output conversion to show that the effects of sectoral TFP shocks on aggregate output are stronger for sectors with more central positions in the supply chain network. By (ref), the present analysis leads to the same long-run effects, but it sheds light on the transition dynamics. The left panel of (ref) shows the time profiles of the response of aggregate industrial production to TFP shocks in different sectors. It illustrates that, due to different positions in the supply chain network, under lagged IOC sectors differ not only in terms of the strength of their impact on aggregate output, but also by its timing. Sectors at the bottom of supply chains, such as the food and beverage sector, have a much more immediate effect on aggregate output than sectors that act as important suppliers to other sectors in the economy.

Although stronger effects tend to take more time to realize, there is no clear relationship between the strength and timing of the response of aggregate output to sectoral TFP shocks. This is illustrated by the right panel of (ref). For example, a TFP shock in the food and beverage sector has a similar long-term effect on aggregate output as a shock to primary metals, yet the latter materializes much more sluggishly. One month after the TFP shock in the primary metals sector, a similar fraction of the long-term effect on aggregate output has materialized as in the case of a TFP shock to mining support activities, yet the latter are estimated to lead to a stronger long-term effect.

The autocorrelation of aggregate output growth at the posterior mean is estimated to be 0.389. In a hypothetical environment without persistence in exogenous shocks, this number drops to 0.237. As a result, lagged IOC can account for about two thirds of aggregate persistence. Together with persistence in the aggregate TFP process, this number increases to 0.365. In contrast, if only persistence in sectoral TFP processes is added, the autocorrelation increases only to 0.276. Overall, these results indicate that lagged IOC and a single, persistent aggregate TFP process can account wel for business cycles in this RBC environment.

Dimensionality-Reduction by Innovation Transmission through Parsimonious Networks

In (ref), a process $y_t$ is driven by an observed network, and we quantify how network effects materialize over time. In this section, I forecast a rather high-dimensional series $y_t$ and, for the most part, I assume that no network data is available.\todo{"for the most part"...} When $(\alpha,A)$ are jointly estimated and the estimation of $A$ is regularized, the NVAR becomes useful as a dimensionality-reduction technique. It rationalizes the dynamic comovement among all $\{y_{it}\}_{i=1:n}$ by the dynamic innovation transmission along a few bilateral links among units $i=1:n$.

In (ref), I discuss the potential of the NVAR to reduce dimensionality, building on (ref). (ref) then sets up the application to forecast macroeconomic aggregates across countries, and (ref) presents the results. Details are in (ref).

NVAR-Estimation for Dimensionality-Reduction

Even for intermediate $n$, an unrestricted VAR($p$) poorly forecasts $y_t \in \mathbb{R}^n$.\todo{cite..} Relative to it, under $p>1$, the NVAR($p,1$) reduces the number of parameters in the autoregressive matrices from $pn^2$ to $n^2 + p-1$, owing to the assumption that innovations transmit cross-sectionally only via bilateral links; rather than freely relating $y_{it}$ to $\{y_{j,t-l}\}_{j=1:n,l=1:p}$, it uses the $n$ links $\{a_{ij}\}_{i=1:n}$ to compress this information to $x_{i,t-l} = \sum_{j=1}^n a_{ij}y_{j,t-l}$, and in turn the $p-1$ free parameters in $\alpha$ determine the importance of different lags of $x_{it}$ for the dynamics of $y_{it}$.\footnote{ Even though $\mathbb{E}_{t-1}[y_{it}]$ contains the same linear combinations of $\{y_{j,t-l}\}_{j=1:n}$ at all lags $l=1:p$, dynamics at higher horizons $h$ are driven by different linear combinations, since higher-order network connections accumulate over time (see (ref)). } If, in addition, $A$ is estimated parsimoniously, then the NVAR leverages both approaches available to address the large parameter problem in the Wold representation Geweke1984: it reduces the number of parameters and applies shrinkage priors (regularization). Regularization of $A$ is motivated by the sparseness of real world-networks across a wide range of applications\todo{cite} and by the fact that the dynamic comovement of two series $y_{it}$ and $y_{jt}$ can be captured with higher-order connections between $i$ and $j$ without a direct link between them (see (ref)).

(ref) discussed the estimation of $A$ under a Normal prior (L2-penalty) and under an Exponential prior (L1-penalty and restricting $a_{ij}\geq 0$). In the following, these two approaches are labeled NVAR-R and NVAR-L. The joint posterior of $(\alpha,A)$ is obtained by iteratively drawing from the conditional posteriors of $\alpha|A$ and $A|\alpha$, the joint posterior mode -- the Ridge-/Lasso-regularized LS-/ML-estimator -- by iterating on the conditional posterior modes.

When the NVAR-R and NVAR-L are applied for predictive purposes, selecting the hyperparameter $\lambda_a$ -- i.e. the degree of shrinkage -- becomes particularly important. Following GiannoneLenzaPrimiceri2015, setting a hyperparameter to its marginal posterior mode (MPM) under a Uniform hyperprior maximizes the marginal data density (MDD) and, hence, the one-step ahead predictive ability.\todo{optimizes ... under a quadratic loss function?} Under NVAR-R and NVAR-L, respectively, we obtain the conditional posteriors

align*[align* omitted — 223 chars of source]

We get the joint posterior of $(\alpha, A, \lambda_a)$ by augmenting the Gibbs sampler from (ref) with a step to draw $\lambda_a$ from this conditional posterior. In turn, we arrive at the marginal posterior of $\lambda_a$ by simply considering its posterior draws in isolation.

While well-grounded in theory, the approach of GiannoneLenzaPrimiceri2015 is computationally expensive in the present environment, as it requires obtaining the full posterior.\footnote{ This is particularly disadvantageous if only the posterior mode estimator is of interest. Even if the full posterior of $(\alpha, A)$ evaluated at the optimal $\lambda_a$ is desired, however, it is a drawback, as it requires conducting posterior sampling twice. The disadvantage disappears only if one is interested in the marginal posterior of $(\alpha, A)$ under a Uniform prior for $\lambda_a$ (model-averaging rather than -selection). } For NVAR-L, a heuristic approach is to maximize the Bayesian Information Criterion (BIC) suggested by ZouHastieTibshirani2007 for other Lasso-applications. This involves counting the number of non-zero elements in $\hat{A}(\lambda_a)$. For NVAR-R, an analogous criterion is the conditional MDD $p(Y|\lambda_a,B,\alpha,\Sigma)$, which is derived in (ref) and can be maximized when evaluated at $\hat\alpha$ (and $\hat\Sigma$).

\todo{see commented-out text on interpretability and other}

Forecasting-Setup

To validate the NVAR's merit as a dimensionality-reduction technique, I forecast a range of macroeconomic time series across countries and compare its performance to that of the Dynamic Factor Model (DFM) of GewekeZhou1996:

align[align omitted — 132 chars of source]

where $u_t\sim N(0,I_n)$, $ \eta_t \sim N(0,I_r)$ and $\Lambda_{1:r,\cdot}$ is lower-triangular with positive diagonal elements. The equivalence result in (ref) suggests that, relative to the DFM, the NVAR restricts factor dynamics, but allows the linear combinations of predictors to vary more flexibly across units and acommodates sparse factors as (linear combinations of) locally important units in the network. Therefore, the NVAR is expected to capture cross-sectional dynamics in finite samples better than the factor model in the presence of many sparse factors or, equivalently, in case of a sparse, yet close-to-full-rank network adjacency matrix. Intuitively, this is the case of dynamics driven by many bilateral links rather than a few influential units. More generally, (ref) suggests the NVAR could improve upon the poor forecasting performance of factor models under a high dispersion of factor loadings across series (see BoivinNg2006).\footnote{ This notably includes the case of sparse factors, i.e. loading-vectors with zero and non-zero entries. As BoivinNg2006 point out, selecting the number of factors separately for each series is a poor remedy: series that depend on less dominant factors are still poorly forecasted, as including more estimated factors adds noise to the forecasts.}

\todo{Can we show that in results? note that it holds not unit-by unit, as I thoguht initially (see commented-out text here)}

To investigate these hypotheses, I use the NVAR and DFM to forecast monthly industrial production (IP) growth, monthly CPI inflation and quarterly real GDP growth across OECD-member countries, -applicants and -partners.\footnote{ As of August 2024, this includes 45 countries. On top of 34 OECD members, there are 8 applicants (Argentina, Brazil, Bulgaria, Croatia, Indonesia, Peru, Romania and Thailand) and 3 partners (China, India, South Africa).} The series are obtained from the IMF's IFS database, and YoY growth rates are used. I limit attention to the pre-COVID periods 2001:M1 - 2019:M12 and 2001:Q1 - 2019:Q4, respectively, and I delete countries with missings or more than two consecutive constants. This yields datasets with $n=42$, $n=34$ and $n=39$ observations. The series are de-seasonalized by subtracting fitted values from a regression on period-dummies, and the resulting series are standardized.

Comparison is based on mean squared errors (MSEs) at different forecasting horizons, whereby the mean is taken over countries as well as forecasting origins. I consider expanding windows with 24 and 16 origins, respectively, ranging from 2017:M12 to 2019:M11 and from 2015:Q4 to 2019:Q3. To reduce the computational burden, the models are fully estimated only at the first origin, after which parameters are fixed and, if required, hidden states are re-estimated by conditioning on these initially estimated parameters. At the first origin, we have $T=203$ and $T=60$ observations, respectively.

I limit the analysis to point forecasts obtained under the posterior mode of $(\alpha,A)$ in the NVAR-R and NVAR-L as presented in (ref) -- the Ridge-/Lasso-regularized ML-/LS-estimator --, and the posterior mode of $(\Lambda,\Phi)$, $\Phi = [\Phi_1, ..., \Phi_p]'$ under a Uniform prior in the DFM -- the ML-/LS-estimator (see (ref)).\todo{and orthogonal factors!} For the DFM, I consider $p=1:4$ lags and $r=10$ factors. In turn, I select the ex-post best-performing specification that minimizes the cumulative MSE over the first three horizons, and I compare all NVAR specifications against this benchmark. This renders the assessment of the NVAR's suitability for forecasting independent of methods to select the number of factors ex-ante. For the NVAR, I also consider $p=1:4$ lags, and I mostly focus on $q=1$ -- the case referred to by (ref) \todo{mostly...}. In both NVAR models, I set $\Sigma = I$, and, unless otherwise stated, I shrink $A$ to $B=0$. The degree of shrinkage, as embodied by $\lambda_a$, is chosen based on two methods. The first takes the MPM and, therefore, maximizes the MDD exactly, while the second approximates this choice by using grid-search to maximize the BIC (in case of the NVAR-L) or the conditional MDD (for the NVAR-R).

Results

(ref) illustrates the results for IP growth and NVARs with $q=1$. The ex-post best DFM features $r=4$ factors and $p=1$ lags. As shown by the black line, it reduces the MSE of one-step ahead forecasts by 13% relative to forecasting the unconditonal mean of zero. As expected, this improvement vanishes for higher horizons. The NVAR-R (blue lines) further reduces the MSE at the first horizon, amounting to -27% relative to the same benchmark (-16% relative to the DFM), whereby the noticeable improvement relative to the DFM persists for the first two horizons. Thereby, both methods to select $\lambda_a$ yield similar answers -- $\lambda_{a,MPM} = 160$ (solid line) and $\lambda_{a,MDD} = 141$ (dashed line) -- and indistinguishable forecasting performances. They both lead to $p=2$ as the ex-post best-performing model. For NVAR-L (red lines), smaller values and differing lag-lengths are selected: $\lambda_{a,MPM} = 31$ with $p=1$ (solid line) and $\lambda_{a,BIC} = 8$ with $p=3$ (dashed line). Nevertheless, the forecasting performances are again similar. For the first horizon, they yield MSE reductions of -42% and -40% relative to the unconditional mean (-33% and -30% relative to the DFM). The improvement is long-lasting, reverting to levels obtained under the DFM and NVAR-R only for six-period ahead forecasts.\footnote{The models' performances under different different choices of $p$ and $r$ are shown in (ref) and (ref).}

figure[figure omitted — 527 chars of source]

The results in (ref) are obtained using the respective posterior mode, i.e. frequentist point estimator. As shown in (ref), the factor models yield similar performances even for forecasts at the posterior mean or the posterior mean forecasts. Selecting the best DFM using these alternative forecasting-types does not change any of the above numbers by more than two percentage points. For NVAR-L, the normalization $\alpha_1=1$ is applied, whereas for NVAR-R, $||\alpha||_1 = 1$ is imposed.\footnote{ Under the former normalization, NVAR-R yields poor performance, as the free parameters in $\alpha$ are increased to extremely high values, while all elements in $A$ are shrunk accordingly. This is likely because, for highly correlated series with $\mathbb{E}[y_t y_{t-1}']\approx \mathbb{E}[y_t y_{t-2}']$, $\alpha_{-1}$ is weakly identified, as e.g. $A y_{t-1} + \alpha_2 A y_{t-2} \approx (1+\alpha_2)Ay_{t-1}$. This issue does not occur for NVAR-L, likely because it shrinks numerous elements of $A$ all the way to zero. The issue does not occur either when estimating the full posterior of NVAR-R or NVAR-L.} The computational time needed to obtain the posterior modes of the DFM and the NVAR for a given $\lambda_a$ are of a similar order of magnitude and amount to 5-10 seconds. However, this burden is considerably increased by the need to re-compute the posterior mode for many different $\lambda_a$ in the search for the value that maximizes MDD or BIC and the need to compute the full posterior distribution in the search for the MPM of $\lambda_a$.\footnote{For NVAR-R, this yields about 50-100s in the former case and about 10min in the latter case. These times are doubled for NVAR-L.}

Qualitatively, the same conclusions apply when forecasting monthly CPI inflation. The left panel of (ref) shows that, in this case, the DFM reduces the one-step ahead MSE by 54% relative to the unconditional mean forecast, with a noticeable improvement persisting throughout the first six months. The NVAR-R improves slightly upon this, yielding -67% and -64% (-27% and -22% relative to the DFM). The NVAR-L delivers again the best performance: -86% and -85% (-68% relative to DFM).

figure[figure omitted — 883 chars of source]

When forecasting quarterly GDP growth, the conclusions change. The performance of the best DFM (-30%) is beaten only slightly and only at the first horizon. The {NVAR-R} models yield -37% and -35% (-10% and -7% relative to DFM), and the NVAR-L with $\lambda_a$-selection according to BIC yields -38% (-12% relative to DFM). At longer horizons, the NVAR-R yields a similar performance as the DFM, beating the unconditional mean by about 10-15%, while the reduction by the mentioned NVAR-L model reverts faster to zero. The NVAR-L with $\lambda_a$ selected by MPM yields -22% and thereby underperforms the DFM by 12%.

\todo{see commented-out section on $B$-selection here and whole appendix-section}

\todo{see commented-out section on $q\neq 1$ here}

Conclusion

In this paper, I develop the Network-VAR (NVAR) -- an econometric framework that rationalizes the dynamics of a cross-sectional variable by the dynamic innovation transmission along bilateral links among cross-sectional units -- and I consider two applications. First, I estimate the contribution of lagged input-output conversion to business cycles through the lens of an RBC economy, thereby providing a structural underpinning of the NVAR. Second, I use the NVAR as a dimensionality-reduction technique for forecasting cross-country macroeconomic aggregates.

More work is needed to explore the extent to which the NVAR is useful to address sparse factor-issues and improve upon the forecasting performance of alternative dimensionality-reduction techniques. Its application for forecasting very high-dimensional processes would benefit from refinements of the crude shrinkage priors used in this paper.

Furthermore, rather than assuming time-invariant links, an important methodological step forward would be to jointly study dynamic network effects and -formation.\todo{cite Bykhovskaya, P007 and also KuersteinerPrucha2020} \todo{mention macro studies on growth via network changes?} Rather than assuming stationarity, an interesting avenue for further research would be to study networked cointegration. Finally, the NVAR could be augmented to accommodate heterogeneous propagation patterns across units or over time, which in the context of a production economy amounts to endogenizing firms' inventory management. I leave these directions for future research.

\todo{mention paper with Xin? Mention also papers with Wayne (ID as $q \rightarrow \infty$) and Frank/Mansi (nowcasting)? Mention them also/only in main text?}

\setcounter{page}{1}

appendix\markright{This Version: \today } \setcounter{equation}{0} \setcounter{table}{0} \setcounter{figure}{0} \addtocontents{toc}{\setcounter{tocdepth}{1}} \begin{center} {\fontsize{19}{25}\selectfont {\bf Online Appendix}}\\[5pt] {\fontsize{15}{20}\selectfont {\bf Cross-Sectional Dynamics Under Network Structure: \\[3pt] Theory and Macroeconomic Applications}}\\[10pt] { Marko Mlikota \\ Geneva Graduate Institute}\\[30pt] \end{center} \section{NVAR: Theory} \subsection{NVAR($p,1$): Granger-Causality/GIRFs} \begin{repproposition}{prop_GCGIRF_NVARp1}[NVAR($p,1$): Granger-Causality] \\[3pt] Let $y_t$ evolve as in (ref). Then, for $\underline{k} = ceil(h/p)$ and some coefficients $\{c^h_k\}_{k=\underline{k}:h}$, we have $$ \frac{\partial y_{i,t+h}}{\partial u_{j,t}} = c^{h}_{\underline{k}} \left[ {A^{\underline{k}}} \right]_{ij} + ... + c^{h}_{h} \left[ {A^{h}} \right]_{ij} \; .$$ \end{repproposition} {\bf Proof:} Write $y_t$ in companion form as $z_t = F z_{t-1} + e_t$, where $z_t = (y_t', y_{t-1}', ..., y_{t-p+1}')'$ and $e_t = (u_t', 0', ..., 0')'$ are $np \times 1$ vectors, and the $np \times np$ matrix $F$ is \begin{align*} F = \begin{bmatrix} \Phi_1 & ... & \Phi_{p-1} & \Phi_p \\ I_n & ... & 0_n & 0_n \\ \vdots & \ddots & & \vdots \\ 0_n & ... & I_n & 0_n \end{bmatrix} \; . \end{align*} We have $$ \frac{\partial y_{t+h}}{\partial y_t} = [I_n,0_{n \times n(p-1)}] F^h [I_n,0_{n \times n(p-1)}]' = (F^h)_{11}\; ,$$ where $(F^h)_{lm}$ is the $n\times n$ matrix in position $(l,m)$ of $F^h$. I prove the following claim by induction: $(F^h)_{1l}$ has powers of $A$ in the set $ceil((h+l-1)/p):h$. Note that the claim is true for $h=1$. Suppose it is true for $h$. For $h+1$ we have \begin{align*} F^{h+1} &= \begin{bmatrix} (F^h)_{11} & ... & (F^h)_{1p} \\ \vdots & \ddots & \vdots \\ (F^h)_{p1} & ... & (F^h)_{pp} \end{bmatrix} \begin{bmatrix} \Phi_1 & ... & \Phi_{p-1} & \Phi_p \\ I_n & ... & 0_n & 0_n \\ \vdots & \ddots & & \vdots \\ 0_n & ... & I_n & 0_n \end{bmatrix} \\ &= \begin{bmatrix} (F^h)_{11}\Phi_1 + (F^h)_{12} & (F^h)_{11}\Phi_2 + (F^h)_{13} & ... & (F^h)_{11}\Phi_{p-1} + (F^h)_{1p} & (F^h)_{11}\Phi_p \\ \vdots & \vdots & \ddots & \vdots & \vdots \end{bmatrix} \; . \end{align*} (Only the first row of blocks in $F^{h+1}$ are relevant to the argument.) Consider $m \in 1:(p-1)$ s.t $h+m$ is a multiple of $p$. Then $$ ceil\left( { \frac{h+l-1}{p} } \right)= \begin{cases} \frac{h+m}{p} \quad &\text{for} \; l=1:(m+1) \\ \frac{h+m}{p}+1 \quad &\text{for} \; l=(m+2):p \\ \end{cases} \; . $$ This means that for $l=1:(m+1)$, $(F^h)_{1l}$ has powers of $A$ in $\left( {\frac{h+m}{p}} \right):h$, while for $l=(m+2):p$ it has powers in $\left( {\frac{h+m}{p}+1} \right):h$. Then, by the equation above, for $l=1:m$, $(F^{h+1})_{1l}$ has powers of $A$ in $\left( {\frac{h+m}{p}} \right):(h+1)$, while for $l=1:m$ it has powers in $\left( {\frac{h+m}{p}+1} \right):(h+1)$. These sets are both equal to $ceil\left( {\frac{h+1+l-1}{p}} \right):(h+1)$ and independent of $m$. Therefore, the claim holds in all possible cases. $\blacksquare$ \begin{proposition}[NVAR($p,1$): Long-Term Response to Persistent WN-Innovations] \\[3pt] Let $y_t$ evolve as in (ref), and let $x = aA x + v$, with $a=\sum_{l=1}^p \alpha_l$. Assume $y_t$ is weakly stationary. Then, \begin{align*} \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^H \frac{\partial y_{i,t+H}}{\partial u_{j,t+h}} = \frac{ \partial x_i }{ \partial v_j } = \left[ { (I-aA)^{-1} } \right]_{ij}\; . \end{align*} \end{proposition} {\bf Proof:} First, note that $x = (I-aA)^{-1} v$ and therefore $\partial x / \partial v = (I-aA)^{-1}$. Turning to $y_t$, under weak stationarity, \begin{align*} R \equiv \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^{H} \frac{\partial y_{t+H}}{\partial u_{t+h}} = \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^{H} \frac{\partial y_{t+h}}{\partial u_{t}} = \sum_{h=0}^\infty \frac{\partial y_{t+h}}{\partial u_{t}} \; . \end{align*} To find $R$, write $y_t$ in companion form as $z_t = F z_{t-1} + e_t$. We have \begin{align*} \frac{\partial y_{t+h}}{\partial u_t} = \frac{\partial y_{t+h}}{\partial z_{t+h}} \frac{\partial z_{t+h}}{\partial e_t} \frac{\partial e_t}{\partial u_t} = [I_n,0_n, ..., 0_n] F^h [I_n,0_n, ..., 0_n]' \; . \end{align*} Since $\sum_{h=0}^\infty F^h = (I-F)^{-1}$, \begin{align*} R = \sum_{l=0}^\infty \frac{\partial y_{t+l}}{\partial u_{t}} = \left( { (I-F)^{-1} } \right)_{11} \end{align*} is given by the $n \times n$ matrix in position (1,1) in the $np \times np$ matrix $ (I-F)^{-1}$. Let $M = (I-F)^{-1}$ and partition it into $p^2$ blocks of dimension $n \times n$, denoted by $\{M_{lm}\}_{l,m=1:p}$. Then, $R = M_{11}$. We have \begin{align*} I &= M(I-F) \\ &= \begin{bmatrix} M_{11} & M_{12} & ... & M_{1p} \\ \vdots & \vdots & \ddots & \vdots \\ M_{p1} & M_{p2} & ... & M_{pp} \end{bmatrix} \begin{bmatrix} I-\alpha_1 A & -\alpha_2 A & -\alpha_3 A & ... & -\alpha_{p-1} A & -\alpha_p A \\ -I_n & I_n & 0_n & ... & 0_n & 0_n \\ 0_n & -I_n & I_n & ... & 0_n & 0_n \\ \vdots & & \ddots & \ddots & & \vdots \\ 0_n & 0_n & ... & -I_n & I_n & 0_n \\ 0_n & 0_n & ... & 0_n & -I_n & I_n \end{bmatrix} \end{align*} Comparing the left- and right-hand sides for block $(1,p)$, we get \begin{align*} 0_n = -M_{11}\alpha_p A + M_{1p} \; , \end{align*} which implies $M_{1p} = M_{11}\alpha_p A$. For block $(1,l)$, we get \begin{align*} 0_n = -M_{11} \alpha_l A + M_{1l} - M_{1,l+1} \; , \quad l \in 2:(p-1) \; , \end{align*} which implies \begin{align*} M_{12} = M_{11}\alpha_2 A + M_{13} = M_{11}\alpha_2 A + M_{11}\alpha_3 A + M_{14} = ... = M_{11}(\alpha_2 + ... + \alpha_p)A \; . \end{align*} The first element gives \begin{align*} I_n = M_{11}(I-\alpha_1 A) - M_{12} = M_{11}\left( { I - (\alpha_1 + \alpha_2 + ... + \alpha_p)A } \right) = M_{11}(I-aA) \; , \end{align*} which implies $M_{11} = \left( { (I-F)^{-1} } \right)_{11} = (I-aA)^{-1}$. $\blacksquare$ \begin{proposition}[NVAR($p,1$): Long-Term Response to Persistent AR($1$)-Innovations] \\[3pt] Let $y_t$ evolve as in (ref), and let $x_t = a A x_t + v_t$, with $a =\sum_{l=1}^p \alpha_l$. Assume $y_t$ and $x_t$ are weakly stationary, and assume $(1-\rho_j L) u_{jt} = \varepsilon_{jt} \sim WN$ and $(1-\rho_j L) v_{jt} = \epsilon_{jt} \sim WN$, with $\rho_j \in [0,1)$. Then, \begin{align*} \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^H \frac{\partial y_{i,t+H}}{\partial \varepsilon_{j,t+h}} = \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^H \frac{\partial x_{i,t+H}}{\partial \epsilon_{j,t+h}} = \frac{1}{1-\rho_j}\left[ {(I- a A)^{-1}} \right]_{ij} \; . \end{align*} \end{proposition} {\bf Proof:} It holds that \begin{align*} \frac{\partial x_{t+h}}{\partial \epsilon_{t}} = \sum_{l=0}^h \frac{\partial x_{t+h}}{\partial v_{t+h-l}} \frac{\partial v_{t+h-l}}{\partial \epsilon_{t}} \quad and \quad \frac{\partial y_{t+h}}{\partial \varepsilon_{t}} = \sum_{l=0}^h \frac{\partial y_{t+h}}{\partial u_{t+h-l}} \frac{\partial u_{t+h-l}}{\partial \varepsilon_{t}} \; . \end{align*} By (ref), under stationarity of $x_t$ and $y_t$, we also know that $$ \frac{\partial x_{t}}{\partial v_{t}} = \underset{H\rightarrow \infty}{\lim} \sum_{l=0}^H \frac{\partial y_{t+l}}{\partial u_{t}} = (I- a A)^{-1} \; . $$ For $x_t$, $\partial x_{t+h}/\partial v_{t+h-l} = 0$ for $l>1$. We then have \begin{align*} \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^{H} \frac{\partial x_{t+H}}{\partial \epsilon_{t+h}} = \sum_{h=0}^\infty \frac{\partial x_{i,t+h}}{\partial \epsilon_{j,t}} = \sum_{h=0}^\infty \frac{\partial x_{i,t+h}}{\partial v_{j,t+h}} \frac{\partial v_{j,t+h}}{\partial \epsilon_{j,t}} = \sum_{h=0}^\infty \left[ {(I-aA)^{-1}} \right]_{ij} \rho_j^h = \frac{\left[ {(I- a A)^{-1}} \right]_{ij}}{1-\rho_j} \; . \end{align*} For $y_t$, we have \begin{align*} \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^H \frac{\partial y_{i,t+h}}{\partial \varepsilon_{j,t}} &= \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^H \sum_{l=0}^h \frac{\partial y_{i,t+l}}{\partial u_{j,t}} \rho_j^{h-l} \\ &= \underset{H\rightarrow \infty}{\lim} \sum_{l=0}^H \frac{\partial y_{i,t+l}}{\partial u_{j,t}} \sum_{h=l}^{H} \rho_j^{h-l} \\ &= \underset{H\rightarrow \infty}{\lim} \sum_{l=0}^H \frac{\partial y_{i,t+l}}{\partial u_{j,t}} \frac{1-\rho_j^{H-l+1}}{1-\rho_j} \\ &=\frac{1}{1-\rho_j} \underset{H\rightarrow \infty}{\lim} \sum_{l=0}^H \frac{\partial y_{i,t+l}}{\partial u_{j,t}} - \underset{H\rightarrow \infty}{\lim} \sum_{l=0}^H \frac{\rho_j^{H-l+1}}{1-\rho_j} \frac{\partial y_{i,t+l}}{\partial u_{j,t}} \; . \end{align*} By (ref), the first term equals $(1-\rho_j)^{-1} \left[ {(I- a A)^{-1}} \right]_{ij}$. The second term equals zero. To see this, break it up as follows: $$ \underset{H\rightarrow \infty}{\lim} \sum_{l=0}^{H-1} \frac{\rho_j^{H-l+1}}{1-\rho_j} \frac{\partial y_{i,t+l}}{\partial u_{j,t}} + \underset{H\rightarrow \infty}{\lim} \frac{\rho_j}{1-\rho_j} \frac{\partial y_{i,t+H}}{\partial u_{j,t}} \; .$$ The latter term equals zero since $y_t$ is stationary. The former term can be written as $$ \frac{1}{1-\rho_j} \underset{H\rightarrow \infty}{\lim} \rho_j^{H+1-c} \sum_{l=0}^{H-1} \rho_j^{c-l} \frac{\partial y_{i,t+l}}{\partial u_{j,t}} \; \forall \; c > 0 \; .$$ Let $c = H(1-\delta)$ for $\delta > 0$ small. Since $\underset{H\rightarrow \infty}{\lim} \rho_j^{H+1-c} = 0$, it remains to be shown that the limt of the second term in this product is finite, in which case the limit of products is equal to the product of their limits, which is zero. Let $\tilde{\rho}_j = \rho_j^{c/(H-1)-1}$. For $\delta$ small enough, $\tilde{\rho}_j \in [0,1)$. We then have \begin{align*} \underset{H\rightarrow \infty}{\lim} \sum_{l=0}^{H-1} \rho_j^{c-l} \frac{\partial y_{i,t+l}}{\partial u_{j,t}} &= \underset{H\rightarrow \infty}{\lim} \sum_{l=0}^{H-1} \left( {\rho_j^{c/l-1}} \right)^l \frac{\partial y_{i,t+l}}{\partial u_{j,t}} \\ &\leq \underset{H\rightarrow \infty}{\lim} \sum_{l=0}^{H-1} \tilde{\rho}_j^l \frac{\partial y_{i,t+l}}{\partial u_{j,t}} \\ &\leq \underset{H\rightarrow \infty}{\lim} \sum_{l=0}^{H-1} \frac{\partial y_{i,t+l}}{\partial u_{j,t}} = \left[ {(I- a A)^{-1}} \right]_{ij} < \infty \quad \blacksquare \end{align*} \subsection{NVAR($p,1$): Stationarity} \begin{proposition}[NVAR($1,1$): Stationarity] \\[3pt] Let $y_t = aA y_{t-1} + u_t$. Assume $u_t \sim WN$ and $a\neq 0$. Then $y_t$ is weakly stationary iff $|\lambda_i | < 1/|a|$ for all eigenvalues $\lambda_i$ of $A$. \end{proposition} {\bf Proof:} Let $\mathcal{L}_A$ and $\mathcal{L}$ be the sets of eigenvalues of $A$ and $aA$, respectively: \begin{align*} \mathcal{L}_A &= \left\{ { \lambda_i : |\lambda_i I - A| = 0 } \right\} \; , \\ \mathcal{L} &= \left\{ { l_i : |l_i I - aA| = 0 } \right\} \; . \end{align*} The pairs of eigenvalues $l_i$ and $\lambda_i$ are related by the identity $\lambda_i = l_i/a$: \begin{align*} |l_i I - aA| = |a(l_i/a I - A)| = a^n |l_i/a I - A| = 0 \Leftrightarrow |l_i/a I - A| = 0 \; . \end{align*} We have \begin{align*} y_t \; is weakly stationary \quad \Leftrightarrow \quad &\forall \; l_i \in \mathcal{L} \; , \quad |l_i| < 1 \\ \Leftrightarrow \quad &\forall \; l_i \in \mathcal{L} \; , \quad |l_i/a| = |l_i|/|a| < 1/|a| \\ \Leftrightarrow \quad &\forall \; \lambda_i \in \mathcal{L}_A\; , \quad |\lambda_i| < 1/|a| \; . \quad \blacksquare \end{align*} \begin{proposition}[NVAR($p,1$): Stationarity I] \\[3pt] Let $y_t$ evolve as in (ref). Assume $u_t \sim WN$ and $\alpha_l \neq 0$ for at least one $l$, and define $a=\sum_{l=1}^p |\alpha_l|$. If $|\lambda_i | < 1/a$ for all eigenvalues $\lambda_i$ of $A$, then $y_t$ is weakly stationary. Under $\alpha_l \geq 0 \; \forall \; l$, the implication is both-sided. \end{proposition} {\bf Proof:} Consider the NVAR(1,1) $y^*_t = aA y^*_{t-1} + u^*_t$. By (ref), we know \begin{align*} y^*_t \; is weakly stationary \quad \Leftrightarrow \quad |\lambda_i| < 1/|a| \quad \forall \; \lambda_i \in \mathcal{L}_A = \left\{ { \lambda_i : |\lambda_i I - A| = 0 } \right\} \; . \end{align*} It also holds that \begin{align*} y^*_t \; is weakly stationary \quad \Leftrightarrow \quad |z^*_i| > 1 \quad \forall \; z^*_i \in \mathcal{Z}^* = \left\{ { z^*_i : |I- z^*_i a A | = 0 } \right\} \; . \end{align*} where $\mathcal{Z}^*$ is the set of roots $z^*_i$ of the lag polynomial $(1-aAL)$. Analogously, let $$ \mathcal{Z} = \left\{ { z_i : |I-\alpha_1A z_i - ... - \alpha_p A z_i^p | = |I-(\alpha_1 z_i + ... + \alpha_p z_i^p)A| = 0 } \right\} $$ be the set of roots $z_i$ of the lag polynomial $(1-\alpha_1AL-\alpha_2AL^2 - ... - \alpha_p A L^p)$. The proof shall show \begin{align*} \forall \; z^*_i \in \mathcal{Z}^*, \quad | z^*_i| > 1 \quad \Rightarrow \quad \forall \; z_i \in \mathcal{Z}, \quad |z_i| > 1 \; . \end{align*} We have \begin{align*} &\forall \; z^*_i \in \mathcal{Z}^* \; , \quad | z^*_i| > 1 \\ \Leftrightarrow \quad &\forall \; z^*_i \in \mathcal{Z}^*, \quad |a z^*_i| = a| z^*_i| > a \\ \Leftrightarrow \quad &\forall \; z_i \in \mathcal{Z} \; , \quad |\alpha_1 z_i + ... + \alpha_p z_i^p| > a \\ \Rightarrow \quad &\forall \; z_i \in \mathcal{Z} \; , \quad |z_i| > 1 \; . \end{align*} To show the last implication, suppose first that the statement on the second-last line is true, but the statement on the last line is not. Then $\exists z_i \in \mathcal{Z}$ s.t. $|z_i| \leq 1$. In turn, \begin{align*} |\alpha_1 z_i + ... + \alpha_p z_i^p| &\leq |\alpha_1 z_i| + ... + |\alpha_p z_i^p| \\ &\leq |\alpha_1 z_i| + ... + |\alpha_p z_i| \\ &\leq (|\alpha_1| + ... + |\alpha_p|)|z_i| = a |z_i| \leq a \; , \end{align*} a contradiction. If $\alpha_l \geq 0 \; \forall \; l$, the last implication is both-sided: \begin{align*} &\forall \; z_i \in \mathcal{Z} \; , \quad |z_i| > 1 \\ \Rightarrow \quad &\forall \; z_i \in \mathcal{Z} \; , \quad |\alpha_1 z_i + ... + \alpha_p z_i^p| > |(\alpha_1 + ... + \alpha_p)z_i| = |az_i| = a |z_i| > a \; . \quad \blacksquare \end{align*} \begin{proposition}[NVAR($p,1$): Stationarity II] \\[3pt] Let $y_t$ evolve as in (ref). Assume $u_t \sim WN$ and $\alpha_l \neq 0$ for at least one $l$. Then, $y_t$ is weakly stationary iff for all eigenvalues $\lambda_i$ of $A$ the $p\times p$ matrix $$ \begin{bmatrix} \alpha_1 \lambda_i & ... & \alpha_p \lambda_i \\ \multicolumn{2}{c}{I_{p-1}} & 0 \end{bmatrix} $$ has all eigenvalues inside the unit circle. \end{proposition} \todo{note: just taking largest $\lambda$ insufficient; numerically, largest eigval (in abs.v.) of AR(p) is not obtained for largest $\lambda$} {\bf Proof:} Stationarity of $y_t$ is equivalent to the statement that for all eigenvalues $l_i$ of \begin{align*} F &= \begin{bmatrix} \alpha_1 A & \alpha_2 A & ... & \alpha_{p-1}A & \alpha_pA \\ I_n & 0_n & ... & 0_n & 0_n \\ 0_n & I_n & ... & 0_n & 0_n \\ \vdots & & \ddots & & \vdots \\ 0_n & 0_n & ... & I_n & 0_n \end{bmatrix} \end{align*} it holds that $|l_i| < 1$. We have \begin{align*} & |l_i I - F| = 0 \\ \Leftrightarrow \quad & \bigg| l_i^p I - l_i^{p-1} \alpha_1 A - ... - l_i \alpha_{p-1}A - \alpha_p A \bigg| = 0 \\ \Leftrightarrow \quad & l_i^{n(p-1)} \bigg| l_i I - \left( {\alpha_1 + \alpha_2 / l_i + ... + \alpha_p /l_i^{p-1} } \right) A \bigg| = 0 \\ \Leftrightarrow \quad & \left( {l_i^{p-1} \left( {\alpha_1 + \alpha_2 / l_i + ... + \alpha_p /l_i^{p-1} } \right) } \right) } \right) }^n \bigg|\frac{l_i}{\alpha_1 + \alpha_2 / l_i + ... + \alpha_p /l_i^{p-1}} I - A \bigg| = 0 \\ \Leftrightarrow \quad & \bigg|\frac{l_i}{\alpha_1 + \alpha_2 / l_i + ... + \alpha_p /l_i^{p-1}} I - A \bigg| = 0 \; . \end{align*} This establishes a relation between the eigenvalues $l_i$ of $F$ and the eigenvalues $\lambda_i$ of $A$. Given an eigenvalue $l_i$ of $F$, we know $l_i / \left( {\alpha_1 + \alpha_2 / l_i + ... + \alpha_p /l_i^{p-1}} \right)$ is an eigenvalue of $A$. Conversely, given an eigenvalue $\lambda_i$ of $A$, all eigenvalues $l_i$ that solve \begin{align*} l_i^p - l_i^{p-1}\lambda_i \alpha_1 - ... -l_i\lambda_i \alpha_{p-1} - \lambda_i \alpha_p = 0 \end{align*} are eigenvalues of $F$. This equation is the characteristic polynomial for eigenvalues of the matrix \begin{align*} F_X &= \begin{bmatrix} \alpha_1 \lambda_i & ... & \alpha_p \lambda_i \\ \multicolumn{2}{c}{I_{p-1}} & 0 \end{bmatrix} \; . \quad \blacksquare \end{align*} \subsection{NVAR($p,1$): Relation to Dynamic Factor Model} \begin{repproposition}{prop_equivalence_NVAR_FM}[NVAR($p,1$)-Factor Model Equivalence Result] \\[3pt] Let $y_t$ evolve as in (ref). Then we can write $$ y_t = \Lambda f_t + u_t \; , $$ where $f_t = C [\alpha_1 y_{t-1} + ... + \alpha_p y_{t-p}] \in \mathbb{R}^r$, $r$ is the rank of $A$, and $\Lambda$ and $C$ are full-rank matrices that satisfy $A = \Lambda C$. Conversely, let $y_t = \Lambda f_t + \xi_t$, with $f_t \in \mathbb{R}^r$. Assume $f_t = \Phi_1 f_{t-1} + ... + \Phi_p f_{t-p} + \eta_t$ with $\Phi_l = \phi_l \Phi$ for all $l$ and some $\Phi$. Then, as $n\rightarrow \infty$, we can write $$ y_t = \phi_1 A y_{t-1} + ... + \phi_p A y_{t-p} + u_t \; , \quad u_t = \Lambda \eta_t + \xi_t \; ,$$ where $A = \Lambda \Phi (W \Lambda)^{-1} W$ and $W$ is any $r\times n$ matrix with distinct rows. \end{repproposition} {\bf Proof:} The argument works for any $p$. For expositional simplicity, let $p=2$. The NVAR($2,1$) can be written as \begin{align*} y_t = A [\alpha_1 y_{t-1} + \alpha_2 y_{t-2}] + u_t \; . \end{align*} Given $r=rank(A)$, we can find $n \times r$ and $r \times n$ matrices $B$ and $C$, both of full rank, such that $A = BC$. In turn, we can write \begin{align*} y_t = BC [\alpha_1 y_{t-1} + \alpha_2 y_{t-2}] + u_t = \Lambda f_t + u_t \; , \end{align*} where $\Lambda = B$ and $f_t = C [\alpha_1 y_{t-1} + ... + \alpha_p y_{t-p}]$. Conversely, let \begin{align*} y_t = \Lambda f_t + \xi_t \; , \quad f_t = \Phi_1 f_{t-1} + \Phi_2 f_{t-2} + \eta_t \; . \end{align*} Using an argument similar to the one in CesaBianchi-Ferrero2021, take $r$ distinct vectors of weights $w^k = (w_1^k, ..., w_n^k)$, $k=1:r$, and consider weighted averages of $\{y_{it}\}_{i=1}^n$ of the form \begin{align*} \sum_{i=1}^n w_i^k y_{it} = \sum_{i=1}^n w_i^k \Lambda_{i\cdot} f_t + \sum_{i=1}^n w^k_i \xi_{it} \; . \end{align*} For $n$ large enough, $\bar{\xi}^k_t \equiv \sum_{i=1}^n w^k_i \xi_{it} \sim O_p(n^{-1/2})$ is negligible and we can write \begin{align*} W y_t = W \Lambda f_t \; , \end{align*} where the $r \times n$ matrix $W$ stacks $w^{k\prime}$ along rows. In turn, we can solve for $f_t = (W \Lambda)^{-1} W y_t$. As this equation holds for all $t$, we can re-write the process for $y_t$ as \begin{align*} y_t &= \Lambda \left( { \Phi_1 f_{t-1} + \Phi_2 f_{t-2} + \eta_t } \right) + \xi_t \\ &= \Lambda \Phi_1 (W \Lambda)^{-1} W y_{t-1} + \Lambda \Phi_2 (W \Lambda)^{-1} W y_{t-2} + u_t \; , \end{align*} with $u_t = \Lambda \eta_t + \xi_t$. If $\Phi_1 = \phi_1 \Phi$ and $\Phi_2 = \phi_2 \Phi$ for some $\phi_1, \phi_2, \Phi$, this simplifies to \begin{align*} y_t&= \Lambda \Phi (W \Lambda)^{-1} W [\phi_1 y_{t-1} + \phi_2 y_{t-2}] + u_t \\ &= \phi_1 A y_{t-1} + ... + \phi_p A y_{t-p} + u_t \end{align*} for $A = \Lambda \Phi (W \Lambda)^{-1} W$ of rank $r$. $\blacksquare$ \subsection{NVAR($p,q$)} \subsubsection*{Generality of $q \in \mathbb{N}$} Throughout the paper and in the remainder of this section, I discuss the NVAR($p,q$) under $q=1$ and $q \in \mathbb{N}\backslash\{1\}$. In (ref), I mention that we can accommodate any $q\in \mathbb{Q}_{++}$ by constructing a restricted NVAR($p*,q^*$) with $q^* \in \mathbb{N}$, at least in the case of (ref), where $\tilde{y}_\tau$ is interpreted as a stock variable. Consider first $q^{-1} \in \mathbb{N} \backslash \{1\}$, i.e. observational frequency is an integer-multiple of the network interaction frequency. For example, under monthly observations, $q=1/3$ indicates quarterly network interactions, and $p$ signifies over how many past quarters transmission is spread out. In line with (ref), $\tilde{y}_\tau$ is observed in each period $\tau$, which means that $\tilde{y}_\tau$ must evolve at observational frequency. To make sense of $q^{-1}\in \mathbb{N}$ then, we can let the stock $\tilde{y}_\tau$ follow an NVAR($p^*,1$) with $p^*=p/q$ s.t. it depends on its value from $q$ until $p/q$ observational periods ago, which correspond to the last $p$ periods at network interaction frequency: \begin{align*} y_t = \gamma_1 A y_{t-1} + ... + \gamma_{p^*} A y_{t-p^*} + u_t \; , \quad \gamma_l = \begin{cases} \alpha_{lq} \; \quad &if $l$ is multiple of $q^{-1}$ \\ 0 \; \quad &\text{otherwise} \end{cases} \; . \end{align*} In the previous example, the observed monthly series depends on its value in the past $p$ quarters, i.e. on its value three months ago, six months ago, etc., up to $3p$ months ago.\footnote{ Note that this assumes that transmission happens instantaneously at the end of each (network interaction-) period. Alternative definitions of a smoother transmission inevitably lead towards abandoning the paradigm of discrete time. } Consider next the general case: $q \in \mathbb{Q}_{++}$. We can write $q=q_1q_2$ with $q_1^{-1} \in \mathbb{N}$ and $q_2 \in \mathbb{N}$.\footnote{ Note that $q_2$ is the least common multiple of $q$ and $1$, whereas $q_1$ is their greatest common denominator.} For example, under monthly observations, $q=4/3$ implies that network interactions occur every three weeks, $q=4/5$ that they occur every five weeks, and $q=30/4$ that they occur every four days. We can model this case as a combination of the $q \in \mathbb{N}$ and $q^{-1} \in \mathbb{N}$ cases: we observe every $q_2 \in \mathbb{N}$ periods a snapshot of an NVAR($p^*,1)$ process with $p^* = p/q_1 \in \mathbb{N}$ and with parameters restricted as in the preceding paragraph. For example, under monthly observations and $q=4/3$, this amounts to observing every fourth period a snapshot of a weekly process that depends on its value three weeks ago, six weeks ago, etc. If $y_t$ is observed for $T$ periods -- $t=1:T$ --, then $\tilde{y}_\tau$ evolves for $T_\tau$ (network interaction-)periods -- $\tau = 1:T_\tau$. Thereby, $T_\tau$ satisfies $T = |\{(1:T_\tau)/q\} \cap \mathbb{N}|$; the number of elements in the set $1:T_\tau$ that are integer-multiples of $q$ equals $T$. This yields $T_\tau = qT$ under $q \in \mathbb{N}$, and $T_\tau = T$ under $q^{-1} \in \mathbb{N}$. For other $q \in \mathbb{Q}_{++}$, we have $T_\tau = q_2 T$, where $q_2$ is least common multiple of $q$ and $1$. \subsubsection*{NVAR($p,q$): Granger-Causality/GIRFs and Stationarity} \begin{repproposition}{prop_GCGIRF_NVARpq_stock}[NVAR($p,q$): Granger-Causality I] \\[3pt] Let $y_t$ evolve as in (ref) for some $q \in \mathbb{N} \backslash\{1\}$. Then, for $\underline{k} = ceil(hq/p)$ and some coefficients $\{c^h_k\}_{k=\underline{k}:hq}$, we have $$ \frac{\partial y_{i,t+h}}{\partial u_{j,t}} = c^{h}_{\underline{k}} \left[ {A^{\underline{k}}} \right]_{ij} + ... + c^{h}_{hq} \left[ {A^{hq}} \right]_{ij} \; .$$ \end{repproposition} {\bf Proof:} By the definition of $y_t$, \begin{align*} \frac{\partial y_{i,t+h} } { \partial y_{j,t} } = \frac{ \partial \tilde{y}_{i,(t+h)q} }{\partial \tilde{y}_{j,tq}} = \frac{\partial \tilde{y}_{i,\tau+hq} }{ \partial \tilde{y}_{j,\tau} } = \frac{\partial \tilde{y}_{i,\tau+hq} }{ \partial \tilde{u}_{j,\tau} } \; . \end{align*} The statement follows then from (ref). $\blacksquare$ \begin{proposition}[NVAR($p,q$): Granger-Causality II] \\[3pt] Let $y_t$ evolve as in (ref) for some $q \in \mathbb{N} \backslash\{1\}$. Then, for $\underline{k} = ceil(hq/p)$ and some coefficients $\{c^h_k\}_{k=\underline{k}:hq}$, we have $$ \frac{\partial y_{i,t+h}}{\partial u_{j,t}} = c^{h}_{\underline{k}} \left[ {A^{\underline{k}}} \right]_{ij} + ... + c^{h}_{hq} \left[ {A^{hq}} \right]_{ij} + R \; ,$$ where $R$ is a linear combination of $A^k$ for some $k \notin \underline{k}:hq$. \end{proposition} {\bf Proof:} We have \begin{align*} y_{t+h} &= (\tilde{y}_{(t+h)q} + ... + \tilde{y}_{(t+h)q - q +1})/q \; , \\ y_t &= (\tilde{y}_{tq} + ... + \tilde{y}_{tq -q +1})/q \; . \end{align*} Suppose the first (latest) term, $\tilde{y}_{tq}$ is responsible for the change in $y_t$. We then have $$ \frac{ \partial y_{t+h} }{ \partial \tilde{y}_{tq} } = \frac{ \partial (\tilde{y}_{(t+h)q} + ... + \tilde{y}_{(t+h)q - q +1})/q }{ \partial \tilde{y}_{tq} } = \frac{ \partial \tilde{y}_{\tau+hq} }{ \partial \tilde{y}_{\tau} } + ... + \frac{ \partial \tilde{y}_{\tau+hq-q+1} }{ \partial \tilde{y}_{\tau} } \; ,$$ and, by (ref), connection-orders $k\in \{ceil ((q(h-1)+1)/p), ..., hq\}$ matter. Analogous calculations show that if the last (earliest) term, $\tilde{y}_{tq -q +1}$, is responsible for the change in $y_t$, connection-orders $k\in \{ceil (hq/p), ..., hq+q-1\}$ matter, while the cases in-between lead to sets contained in the union of these two sets. Therefore, regardless of which term is responsible for the change in $y_t$, $\partial y_{i,t+h} / \partial u_{j,t}$ is a linear combination of $A^k$ for connection-orders $k$ in the intersection of these two sets, $$ \{ceil (hq/p), ..., hq\} = \{ceil ((q(h-1)+1)/p), ..., hq\} \cap \{ceil (hq/p), ..., hq+q-1\} \; . \quad \blacksquare $$ \begin{proposition}[NVAR($p,q$): Preservaton of Long-Term Response to Persistent Innovations under Time-Aggregation] \\[3pt] Let $y_t$ evolve as in (ref) or (ref) for some $q \in \mathbb{N} \backslash\{1\}$. Assume $y_t$ is weakly stationary and $(1-\rho_jL)\tilde{u}_{j\tau} = \tilde{\varepsilon}_{j\tau} \sim WN$, with $\rho_j \in [0,1)$. Then, \begin{align*} \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^{Hq} \frac{\partial y_{t+H}}{\partial \tilde{\varepsilon}_{tq+h}} = \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^{H} \frac{\partial \tilde{y}_{\tau + H}}{\partial \tilde{\varepsilon}_{\tau+h}} \; . \end{align*} \end{proposition} {\bf Proof:} If $y_t$ evolves as in (ref), we have $y_{t+H} = \tilde{y}_{(t+H)q}$, and so \begin{align*} \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^{Hq} \frac{\partial y_{t+H}}{\partial \tilde{\varepsilon}_{tq+h}} = \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^{Hq} \frac{\partial \tilde{y}_{(t+H)q}}{\partial \tilde{\varepsilon}_{tq+h}} = \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^{Hq} \frac{\partial \tilde{y}_{\tau + Hq}}{\partial \tilde{\varepsilon}_{\tau+h}} = \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^{H} \frac{\partial \tilde{y}_{\tau + H}}{\partial \tilde{\varepsilon}_{\tau+h}} \; . \end{align*} If $y_t$ evolves as in (ref), we have $y_{t+H} = q^{-1}(\tilde{y}_{(t+H)q} + ... + \tilde{y}_{(t+H)q-q+1})$, and the same result is obtained: \begin{align*} \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^{Hq} \frac{\partial y_{t+H}}{\partial \tilde{\varepsilon}_{tq+h}} &= \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^{Hq} q^{-1} \sum_{k=0}^{q-1} \frac{\partial \tilde{y}_{(t+H)q-k}}{\partial \tilde{\varepsilon}_{tq+h}} \mathbf{1}\left\{ { h \leq Hq -k } \right\} \\ &= \underset{H\rightarrow \infty}{\lim} q^{-1} \sum_{k=0}^{q-1} \sum_{h=0}^{Hq-k} \frac{\partial \tilde{y}_{(t+H)q-k}}{\partial \tilde{\varepsilon}_{tq+h}} \\ &= \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^{Hq-k} \frac{\partial \tilde{y}_{(t+H)q-k}}{\partial \tilde{\varepsilon}_{tq+h}} \\ &= \underset{H\rightarrow \infty}{\lim} \sum_{h=0}^{H} \frac{\partial \tilde{y}_{\tau + H}}{\partial \tilde{\varepsilon}_{\tau+h}} \; .\footnotemark \quad \blacksquare \end{align*} \footnotetext{The indicator function ensures that only responses to contemporaneous or past impulses are summed-up.} \begin{proposition}[NVAR($p,q$): Contemporaneous Response to Within-Period Innovation] \\[3pt] Let $y_t$ evolve as in (ref) for some $q \in \mathbb{N} \backslash\{1\}$. Assume $y_t$ is weakly stationary and $(1-\rho_jL)\tilde{u}_{j\tau} = \tilde{\varepsilon}_{j\tau} \sim WN$, with $\rho_j \in [0,1)$. Let $\tilde{\varepsilon}_\tau = (\tilde{\varepsilon}_{1\tau}, ..., \tilde{\varepsilon}_{n\tau})'$. Then, for $g \in 0:(q-1)$, \begin{align*} \underset{g\rightarrow \infty}{\lim} q \frac{\partial y_{t}}{\partial \tilde{\varepsilon}_{\tau-g}} = \underset{g\rightarrow \infty}{\lim} \sum_{h=0}^{g} \frac{\partial \tilde{y}_{\tau + g}}{\partial \tilde{\varepsilon}_{\tau+h}} \; . \end{align*} \end{proposition} {\bf Proof:} We consider the response of $qy_{t} = \sum_{k=0}^{q-1} \tilde{y}_{tq-k}$ to a (high-frequency) innovation $\tilde{\varepsilon}_{tq-g}$, $g \in 0:(q-1)$ that occurs within observational period $t$. We have $$ q \frac{\partial y_{t}}{\partial \tilde{\varepsilon}_{tq-g}} = \sum_{k=0}^{q-1} \frac{\partial \tilde{y}_{tq-k}}{\partial \tilde{\varepsilon}_{tq-g}} \mathbf{1}\left\{ { k \leq g } \right\} = \sum_{k=0}^{q-1} \frac{\partial \tilde{y}_{\tau+g-k}}{\partial \tilde{\varepsilon}_{\tau}} \mathbf{1}\left\{ { k \leq g } \right\} = \sum_{k=0}^{g} \frac{\partial \tilde{y}_{\tau+g-k}}{\partial \tilde{\varepsilon}_{\tau}} = \sum_{h=0}^{g} \frac{\partial \tilde{y}_{\tau+h}}{\partial \tilde{\varepsilon}_{\tau}} \; . \quad \blacksquare $$ \begin{proposition}[NVAR($p,q$): Preservation of Stationarity under Time-Aggregation] \\[3pt] For some $q \in \mathbb{N} \backslash\{1\}$, let $y_t$ evolve as in (ref) and let $y^*_t$ evolve as in (ref). Assume $\tilde{u}_\tau \sim WN(0,\Sigma)$. Then, $y_t$ and $y^*_t$ are weakly stationary iff $\tilde{y}_\tau$ is weakly stationary. \end{proposition} {\bf Proof:} Weak stationarity of $\tilde{y}_\tau$ is defined by the conditions \begin{enumerate} • $\mathbb{E}[\tilde{y}_\tau] = \mathbb{E}[\tilde{y}_{\tau-l}] \; \forall \; l$; • $Cov(\tilde{y}_\tau,\tilde{y}_{\tau-h}) = Cov(\tilde{y}_{\tau-l},\tilde{y}_{\tau-l-h}) \; \forall \; l, h \; ,$$\mathbb{V}[\tilde{y}_{\tau}] = Cov(\tilde{y}_\tau,\tilde{y}_{\tau}) < \infty \; .$ \end{enumerate} They imply that \begin{enumerate} • $\mathbb{E}[y_t] = \mathbb{E}[\tilde{y}_{t q}] = \mathbb{E}[\tilde{y}_{(t-l)q}] = \mathbb{E}[y_{t-l}] \; \forall \; l \; ,$$Cov(y_t,y_{t-h}) = Cov(\tilde{y}_{t q},\tilde{y}_{(t-h)q}) = Cov(\tilde{y}_{(t -l)q},\tilde{y}_{(t-l-h)q}) = Cov(y_{t-l},y_{t-l-h})\; \forall \; l, h \; ,$$\mathbb{V}[y_{t}] = Cov(y_t,y_{t}) < \infty \; ,$ \end{enumerate} which in turn is the definition of weak stationarity for $y_t$. Similarly, they imply that \begin{enumerate} • $\mathbb{E}[y^*_t] = \mathbb{E}[\tilde{y}_{t q}+ ... + \tilde{y}_{(t-1)q+1}]/q = \mathbb{E}[\tilde{y}_{(t-l) q}+ ... + \tilde{y}_{(t-l-1)q+1}]/q = \mathbb{E}[y^*_{t-l}] \; \forall \; l \; ,$$Cov(y^*_t,y^*_{t-h}) = Cov(\tilde{y}_{t q}+ ... + \tilde{y}_{(t-1)q+1} \; , \; \tilde{y}_{(t-h) q}+ ... + \tilde{y}_{(t-h-1)q+1})/q^2 $\\ ${\color{white}{Cov(y^*_t,y^*_{t-h}) }} = Cov(\tilde{y}_{(t-l) q}+ ... + \tilde{y}_{(t-l-1)q+1} \; , \; \tilde{y}_{(t-l-h) q}+ ... + \tilde{y}_{(t-l-h-1)q+1})/q^2$ \\ ${\color{white}{Cov(y^*_t,y^*_{t-h}) }} = Cov(y^*_{t-l},y^*_{t-l-h})\; \forall \; l, h \; , $$\mathbb{V}[y^*_{t}] = Cov(y^*_t,y^*_{t}) < \infty \; ,$ \end{enumerate} which is the definition of weak stationarity for $y^*_t$. The other direction is proved in contrapositive form: if $\tilde{y}_\tau$ is not weakly stationary, than $y_t$ and $y^*_t$ are not, either. Write $\tilde{y}_\tau$ in companion form as $\check{y}_\tau = F \check{y}_{\tau-1} + \check{u}_\tau$. If $\tilde{y}_\tau$ is not weakly stationary, then $\lim_{h\rightarrow \infty}F^h = \infty$. Hence, $\mathbb{V}[\check{y}_\tau] = F \mathbb{V}[\check{y}_{\tau-1}] F' + \check{\Sigma}$ diverges to infinity as $\tau \rightarrow \infty$. (This holds if $\check{y}_\tau$ starts in the infinite past and also if it has been initialized at some $\check{y}_0 = (\tilde{y}_{0}', ..., \tilde{y}_{-p+1}')'$ with mean $\mathbb{E}[\check{y}_0]$ and variance $\mathbb{V}[\check{y}_0]<\infty$.) The same holds then for $\mathbb{V}[\tilde{y}_\tau]$, the upper-left $n\times n$ block in the $np\times np$ matrix $\mathbb{V}[\check{y}_\tau]$. In turn, the same holds for \begin{align*} \mathbb{V}[y_{t}] &= \mathbb{V}[\tilde{y}_{tq}] \; , \\ \mathbb{V}[y^*_{t}] &= \mathbb{V}[\tilde{y}_{t q}+ ... + \tilde{y}_{(t-1)q+1}]/q^2 = \sum_{l=0}^{q-1} \mathbb{V}[\tilde{y}_{tq}]/q^2 + \sum_{l,k=0, l\neq k}^{q-1} Cov(\tilde{y}_{tq-l}, \tilde{y}_{tq-k})/q^2 \quad \blacksquare \end{align*} \subsubsection*{NVAR($p,q$): Networked Correlation of “{Observable Innovations}"} \begin{proposition}[NVAR($p,q$): Correlated “{Observable Innovations}" I] \\[3pt] Let $y_t$ evolve as in (ref) for some $q \in \mathbb{N} \backslash\{1\}$. Assume $y_t$ is weakly stationary and $\tilde{u}_\tau \sim WN(0,\Sigma)$. Define $u_t \equiv y_t - \mathbb{E}[y_t|\mathcal{F}_{t-1}]$, where $\mathcal{F}_{t-1} = \{\tilde{y}_{\tau-q}, \tilde{y}_{\tau-q-1}, ... \}$. Then, $$ \mathbb{V}[u_t] = \Sigma + \sum_{h=1}^{q-1} \Theta_h \Sigma \Theta_h' \; , \quad \Theta_h = \partial \tilde{y}_{\tau+h}/ \partial \tilde{y}_{\tau} \; . $$ \end{proposition} {\bf Proof:} By sequentially inserting for $\tilde{y}_{\tau-1}, \tilde{y}_{\tau-2}$, etc. in the expression for $\tilde{y}_{\tau}$, we get its VMA($\infty$)-representation: $$ \tilde{y}_\tau = (I + \Theta_1 L + \Theta_2 L^2 + ... + \Theta_{q-1}L^{q-1} + \Theta_{q}L^{q} + ...)\tilde{u}_\tau \; , $$ where $\Theta_h = \partial \tilde{y}_\tau / \partial \tilde{y}_{\tau-h} = \partial \tilde{y}_{\tau+h}/ \partial \tilde{y}_{\tau}$. Combining this with the definition of $u_t \equiv y_t - \mathbb{E}[y_t|\mathcal{F}_{t-1}] = \tilde{y}_{\tau} - \mathbb{E}[\tilde{y}_{\tau}|\mathcal{F}_{t-1}]$, $y_t$ and $\mathcal{F}_{t-1}$, we get $$ u_t = (I + \Theta_1 L + ... + \Theta_{q-1}L^{q-1})\tilde{u}_\tau \; .$$ (Any $\tilde{u}_{\tau-h}$ is a function of $\tilde{y}_{\tau-h}$ and more distant lags of $\tilde{y}_\tau$, which means that $\tilde{u}_{\tau-q}$ and earlier terms are contained in $\mathcal{F}_{t-1}$.) Since $\tilde{u}_\tau \sim WN(0,\Sigma)$, $$ \mathbb{V}[u_t] = \Sigma + \sum_{h=1}^{q-1} \Theta_h \Sigma \Theta_h' \; . \quad \blacksquare $$ If $\Sigma =diag(\sigma^2_1, ..., \sigma^2_n)$, then, by (ref), for some constants $\{d^h_{h_i,h_j}\}_{h_i,h_j = \underline{k}(h):h}$, $$ \text{Cov}(u_{it},u_{jt}) = \sigma^2_i \mathbf{1}\left\{ { i=j } \right\} + \sum_{o=1}^n \sigma^2_o \sum_{h=1}^{q-1} \sum_{h_i,h_j =\underline{k}(h)}^h d^h_{h_i,h_j} \left[ {A^{h_i}} \right]_{io} \left[ {A^{h_j}} \right]_{jo} \; . $$ \begin{proposition}[NVAR($p,q$): Correlated “{Observable Innovations}" II] \\[3pt] Let $y_t$ evolve as in (ref) for some $q \in \mathbb{N} \backslash\{1\}$. Assume $y_t$ is weakly stationary and $\tilde{u}_\tau \sim WN(0,\Sigma)$. Define $u_t \equiv y_t - \mathbb{E}[y_t|\mathcal{F}_{t-1}]$, where $\mathcal{F}_{t-1} = \{\tilde{y}_{\tau-q}, \tilde{y}_{\tau-q-1}, ... \}$. Then, $$\mathbb{V}[u_t] = \frac{1}{q^2}\left( {\sum_{h=0}^{q-1} \Gamma_h \Sigma \Gamma_h'} \right) \; , \quad \Gamma_h = \sum_{m=0}^h \Theta_m \; , \quad \Theta_h = \partial \tilde{y}_{\tau+h}/ \partial \tilde{y}_{\tau} \; . $$ \end{proposition} {\bf Proof:} By sequentially inserting for $\tilde{y}_{\tau-1}, \tilde{y}_{\tau-2}$, etc. in the expression for $\tilde{y}_{\tau}$, we get its VMA($\infty$)-representation: $$ \tilde{y}_\tau = (I + \Theta_1 L + \Theta_2 L^2 + ... + \Theta_{q-1}L^{q-1} + \Theta_{q}L^{q} + ...)\tilde{u}_\tau \; , $$ where $\Theta_h = \partial \tilde{y}_\tau / \partial \tilde{y}_{\tau-h} = \partial \tilde{y}_{\tau+h}/ \partial \tilde{y}_{\tau}$. Therefore, $$ y_t = \frac{1}{q}(\tilde{y}_\tau + ... + \tilde{y}_{\tau-q+1}) = \frac{1}{q} (I + \Gamma_1 L + \Gamma_2 L^2 + ... + \Gamma_{q-1}L^{q-1} + \Gamma_{q}L^{q} + ...)\tilde{u}_\tau \; , $$ where $\Gamma_h = I + \sum_{m=1}^h \Theta_m$. Combining this with the definitions of $u_t \equiv y_t - \mathbb{E}[y_t|\mathcal{F}_{t-1}]$, $y_t$ and $\mathcal{F}_{t-1}$, we get $$ u_t = \frac{1}{q}(I + \Gamma_1 L + ... + \Gamma_{q-1}L^{q-1})\tilde{u}_\tau \; .$$ In turn, since $\tilde{u}_\tau \sim WN(0,\Sigma)$, $$ \mathbb{V}[u_t] = \frac{1}{q^2}\left( {\Sigma + \sum_{h=1}^{q-1} \Gamma_h \Sigma \Gamma_h'} \right) \; . \quad \blacksquare $$ If $\Sigma =diag(\sigma^2_1, ..., \sigma^2_n)$, then, by (ref), for some constants $\{d^h_{h_i,h_j}\}_{h_i,h_j = 1:h}$ and $\{d^h_{h_i}\}_{h_i = 1:h}$, \begin{alignat*}{2} \text{Cov}(u_{it},u_{jt}) &= \frac{1}{q} \sigma^2_i \mathbf{1}\left\{ { i=j } \right\} &+& \frac{1}{q^2}\sum_{o=1}^n \sigma^2_o \sum_{h=1}^{q-1} \sum_{h_i,h_j =1}^h d^h_{h_i,h_j} \left[ {A^{h_i}} \right]_{io} \left[ {A^{h_j}} \right]_{jo} \\ &\quad &+& \frac{1}{q^2}\sigma^2_j \sum_{h=1}^{q-1} \sum_{h_i =1}^h d^h_{h_i} \left[ {A^{h_i}} \right]_{io} \left[ {A^{h_i}} \right]_{ij}\\ &\quad &+& \frac{1}{q^2}\sigma^2_i \sum_{h=1}^{q-1} \sum_{h_j =1}^h d^h_{h_j} \left[ {A^{h_j}} \right]_{io} \left[ {A^{h_j}} \right]_{ji} \; . \end{alignat*} To illustrate (ref), consider an NVAR($p,q$) for $q=2$. If $y_t = \tilde{y}_\tau$ for $t=\tau/q \in \mathbb{N}$ (as in (ref)), then $u_t = \tilde{u}_\tau + \alpha_1 A \tilde{u}_{\tau-1}$, with $$ \mathbb{V}[u_t] = \Sigma + \alpha_1^2 A \Sigma A' \; . $$ This reveals that $\text{Cov}(u_{it},u_{jt}) = \mathbf{1}\left\{ { i=j } \right\}\sigma_i^2 + \alpha_1^2 \sum_{k=1}^n a_{ik}a_{jk} \sigma^2_k$. If instead $y_t = (\tilde{y}_\tau + ... + \tilde{y}_{\tau-q+1})/q$ for $t=\tau/q \in \mathbb{N}$ (as in (ref)), then $u_t = \frac{1}{2}\tilde{u}_\tau + \frac{1}{2}(I+\alpha_1 A) \tilde{u}_{\tau-1}$, with $$ \mathbb{V}[u_t] = \frac{1}{2}\Sigma + \frac{1}{4}\alpha_1^2 A \Sigma A' + \frac{1}{4}\alpha_1 \left( { \Sigma A + (\Sigma A)' } \right) \; , $$ which leads to $\text{Cov}(u_{it},u_{jt}) = \mathbf{1}\left\{ { i=j } \right\} \frac{1}{2} \sigma_i^2 + \frac{1}{4}\alpha_1 (a_{ij}\sigma_j^2 + a_{ji}\sigma_i^2) + \frac{1}{4} \alpha_1^2 \sum_{k=1}^n a_{ik}a_{jk} \sigma^2_k$. In the former case, $\text{Cov}(u_{it},u_{jt})$ is determined by common exposure to third units, while in the latter case bilateral exposure matters as well. In either case, exposure means first-order connections.\footnote{ To understand the different results for stock and flow variables, assume for simplicity that there are no self-links: $a_{ii}=0 \; \forall\; i$. For a stock variable, $y_{it}=\tilde{y}_{i,\tau}$, which implies that $u_{it}$ only depends on $\tilde{u}_{i,\tau}$, not on $\tilde{u}_{i,\tau-1}$: we have $u_{it} = \tilde{u}_{i,\tau} + \alpha_1 \sum_{j=1}^n a_{ij}\tilde{u}_{j,\tau-1}$. As a result, the only (possibly) common terms in $u_{it}$ and $u_{jt}$ are the one-period lagged high-frequency innovations of third units, $\tilde{u}_{k,\tau-1}$, and any comovement between $u_{it}$ and $u_{jt}$ is due to common exposure to these units: $\text{Cov}\left( {u_{it},u_{jt}} \right) \neq 0$ iff $\exists \; k$ s.t. $a_{ik},a_{jk} \neq 0$. In contrast, for a flow variable, $y_{it}=\tilde{y}_{i,\tau}+ \tilde{y}_{i,\tau-1}$, which implies that $u_{it}$ also depends on $\tilde{u}_{i,\tau-1}$: we have $u_{it} = \tilde{u}_{i,\tau} + \tilde{u}_{i,\tau-1} + \alpha_1 \sum_{j=1}^n a_{ij}\tilde{u}_{j,\tau-1}$. Besides common exposure to third units, comovement is also due to bilateral exposure: $a_{ij} \neq 0 \; | \; a_{ji}\neq 0 \; \Rightarrow \; \text{Cov}\left( {u_{it},u_{jt}} \right) \neq 0$. } Under $q=3$, exposure is determined by first- and second-order connections: e.g. for a stock variable, we have $u_t = \tilde{u}_\tau + \alpha_1 A \tilde{u}_{\tau-1} + (\alpha_2 A + \alpha_1^2A^2)\tilde{u}_{\tau-2}$, with $$ \mathbb{V}[u_t] = \Sigma + (\alpha_1^2 + \alpha_2) A \Sigma A' + \alpha_1^2 \alpha_2 \left( { A \Sigma (A^2)' + \left[ { A \Sigma (A^2)' } \right]' } \right) + \alpha_1^4 A^2 \Sigma (A^2)' \; . $$ \begin{repproposition}{prop_CSCorr_NVARpq_qInf}[NVAR($p,q$): Limit Distribution of “{Observable Innovations}"] \\[3pt] Let $y_t$ evolve as in (ref) for some $q \in \mathbb{N} \backslash\{1\}$. Assume $y_t$ is weakly stationary and $\tilde{u}_\tau \sim WN(0,\Sigma)$ is temporally independent. Define $u_t \equiv y_t - \mathbb{E}[y_t|\mathcal{F}_{t-1}]$, where $\mathcal{F}_{t-1} = \{\tilde{y}_{\tau-q}, \tilde{y}_{\tau-q-1}, ... \}$. Also, let $a = \sum_{l=1}^p \alpha_l$. Then, as $q \rightarrow \infty$, \begin{align*} \sqrt{q}u_t \overset{d}{\rightarrow} N(0,\Gamma_* \Sigma \Gamma_*') \; , \quad \Gamma_* = (I-aA)^{-1} \; . \end{align*} \end{repproposition} {\bf Proof:} By the proof of (ref), we know $$ u_t = \frac{1}{q}\Gamma_h\tilde{u}_{\tau-h} \; , \quad \Gamma_h = \sum_{m=0}^h \Theta_m \; , \quad \Theta_h = \partial \tilde{y}_{\tau+h}/ \partial \tilde{y}_{\tau} \; .$$ Define $\tilde{u}_h \equiv \Gamma_h \tilde{u}_{\tau-h}$ with $\mathbb{E}[\tilde{u}_h]=0$ and $V_h \equiv \mathbb{V}[\tilde{u}_h] = \Gamma_h \Sigma \Gamma_h'$. Consider $d'u_t = \frac{1}{q} \sum_{h=0}^{q-1} d'\tilde{u}_h$ for some $d \in \mathbb{R}^n$. By Lyapunov's Central Limit Theorem, $$ \frac{q}{s_q}d'u_t = \frac{1}{s_q} \sum_{h=0}^{q-1} d'\tilde{u}_h \overset{d}{\rightarrow} N(0,1) \; , $$ where $s^2_q = \sum_{h=0}^{q-1} d'V_hd$. We know $s^2_q / q \rightarrow d'V_*d$, $V_* = \Gamma_*\Sigma\Gamma_*'$ (shown below). Therefore, by the above and by Slutsky's theorem, $$ \sqrt{q}d'u_t = \frac{s_q}{\sqrt{q}}\frac{q}{s_q}d'u_t \overset{d}{\rightarrow} N(0,d'V_*d) \; . $$ As this argument applies for arbitrary $d$, by the Cramer-Wold theorem, $\sqrt{q}u_t \overset{d}{\rightarrow} N(0,V_*)$. It remains to show that $s^2_q / q = \frac{1}{q}\sum_{h=0}^{q-1} \sigma_h \rightarrow d'V_*d \equiv \sigma_*$, with $\sigma_h = d'V_hd$. By (ref), as $h\rightarrow \infty$, $\Gamma_h \rightarrow \Gamma_*$. Therefore, $V_h \rightarrow \Gamma_* \Sigma \Gamma_*$, and $\sigma_h \rightarrow \sigma_*$. In other words, $\forall \; \delta > 0$, $\exists \; H$ s.t. $|\sigma_h - \sigma_*|< \delta \; \forall \; h>H$. Also, for $H \leq q-1$, \begin{align*} |s^2_q/q - \sigma_*| &= \left| \frac{1}{q}\sum_{h=0}^{q-1} (\sigma_h - \sigma_*) \right| \\ &\leq \frac{1}{q} \sum_{h=0}^{H-1} |\sigma_h - \sigma_*| + \frac{1}{q} \sum_{h=H}^{q-1} |\sigma_h - \sigma_*| \\ &\leq \frac{1}{q} \sum_{h=0}^{H-1} |\sigma_h - \sigma_*| + \delta \; . \end{align*} The first term vanishes as $q \rightarrow \infty$. Hence, $\forall \; \delta > 0$, $\underset{q\rightarrow \infty}{\lim} |s^2_q/q - \sigma_*| \leq \delta$, i.e. $s^2_q/q \rightarrow \sigma_*$. $\blacksquare$ \section{NVAR: Inference} \subsection{Timing of Network Effects $\alpha|A$} In all of the derivations in this section, $A$ is taken as given, and the explicit conditioning on it is omitted for notational simplicity. \subsubsection*{NVAR($p,1$): Asymptotic Properties of $\hat{\alpha}_{OLS}$} The OLS estimator for $\alpha$ from (ref) is given by \begin{align*} \hat{\alpha}_{OLS} = \left[ { \sum_{t=1}^T X_{n,t}'X_{n,t} } \right]^{-1} \left[ { \sum_{t=1}^T X_{n,t}' y_t } \right] = \left[ { \sum_{i=1}^n \sum_{t=1}^T x_{n,it}x_{n,it}' } \right]^{-1} \left[ { \sum_{i=1}^n \sum_{t=1}^T x_{n,it}y_{it} } \right] \; . \end{align*} \begin{proposition}[Large $n$ Consistency & Asymptotic Normality of $\hat\alpha_{OLS}$] \\[3pt] Suppose \begin{enumerate} • Model is specified correctly: $y_{it} = x_{n,it}'\alpha_* + u_{it}$. • $\mathbb{E}_{t-1}[u_{it}] = 0$. • The observed network adjacency matrix $A_n$ converges to some limit $A_*$ in the sense that $ \forall \; t$ and $l,k=1:p$, as $n\rightarrow \infty$, \begin{enumerate} • $\frac{1}{n} \sum_{i=1}^n \left( { A_{n,i\cdot} y_{t-l}} \right)' \left( { A_{n,i\cdot} y_{t-k}} \right) \overset{p}{\rightarrow} \mathbb{E}\left[ { \left( { A_{*,i\cdot} y_{t-l}} \right)' \left( { A_{*,i\cdot} y_{t-k}} \right) } \right]$; and • $\frac{1}{n} \sum_{i=1}^n \left( { A_{n,i\cdot} y_{t-l}} \right)' u_{it} \overset{p}{\rightarrow} \mathbb{E}\left[ { \left( { A_{*,i\cdot} y_{t-l}} \right)' u_{it} } \right]$. \end{enumerate} • $\mathbb{E}_{t-1}[u_{it}u_{is}] = \sigma^2$ if $t=s$ and zero otherwise. • $\forall \; t$ and $l,k=1:p$, as $n\rightarrow \infty$, $$\frac{1}{\sqrt{n}} \sum_{i=1}^n \left( { A_{n,i\cdot} y_{t-l}} \right)' u_{it} \overset{d}{\rightarrow} N \left( { \mathbb{E}\left[ { \left( { A_{*,i\cdot} y_{t-l}} \right)' u_{it} } \right] , \mathbb{V}\left[ { \left( { A_{*,i\cdot} y_{t-l}} \right)' u_{it} } \right] } \right)ght)' u_{it} } \right] } \; . $$ \end{enumerate} Under conditions (ref) - (ref), $\hat{\alpha}_{OLS} \overset{p}{\rightarrow} \alpha_*$ as $n \rightarrow \infty$. Under conditions (ref) - (ref), $$ \sqrt{n}(\hat{\alpha}_{OLS}-\alpha_*) \overset{d}{\rightarrow} N \left( { 0 , \frac{\sigma^2}{T}\mathbb{E}[x_{*,it}x_{*,it}']^{-1}} \right) \; .$$ \end{proposition} By condition (ref), \begin{align*} \hat{\alpha}_{OLS} = \left[ { \frac{1}{n} \frac{1}{T} \sum_{i=1}^n \sum_{t=1}^T x_{n,it}x_{n,it}' } \right]^{-1} \left[ { \frac{1}{n} \frac{1}{T} \sum_{i=1}^n \sum_{t=1}^T x_{n,it}x_{n,it}'\alpha_* + \frac{1}{n} \frac{1}{T}\sum_{i=1}^n \sum_{t=1}^T x_{n,it} u_{it}} \right] \; . \end{align*} Condition (ref) ensures that \begin{align*} \frac{1}{n} \frac{1}{T} \sum_{i=1}^n \sum_{t=1}^T x_{n,it}x_{n,it}' &\overset{p}{\rightarrow} \frac{1}{T} \sum_{t=1}^T \mathbb{E}[x_{*,it}x_{*,it}'] \; , \\ \frac{1}{n} \frac{1}{T} \sum_{i=1}^n \sum_{t=1}^T x_{n,it}u_{it} &\overset{p}{\rightarrow} \frac{1}{T} \sum_{t=1}^T \mathbb{E}[x_{*,it}u_{it}] \end{align*} are defined. By condition (ref) and the Law of Iterated Expectations (LIE), $\mathbb{E}[x_{*,it}u_{it}]=0$. As usual, assembling these pieces by Slutsky's theorem yields consistency. To establish asymptotic Normality, write \begin{align*} \sqrt{n}(\hat{\alpha}_{OLS}-\alpha_*) = \left[ { \frac{1}{n} \frac{1}{T} \sum_{i=1}^n \sum_{t=1}^T x_{n,it}x_{n,it}' } \right]^{-1} \left[ { \frac{1}{\sqrt{n}} \frac{1}{T}\sum_{i=1}^n \sum_{t=1}^T x_{n,it} u_{it}} \right] \; . \end{align*} Condition (ref) and Slutsky's theorem ensure that $$ \frac{1}{\sqrt{n}} \frac{1}{T}\sum_{i=1}^n \sum_{t=1}^T x_{n,it} u_{it} \overset{d}{\rightarrow} N \left( { 0 , \mathbb{V} \left[ { \frac{1}{T} \sum_{t=1}^T x_{*,it} u_{it} } \right] } \right) \; , $$ as $\mathbb{E}\left[ { \frac{1}{T} \sum_{t=1}^T x_{*,it} u_{it} } \right] = 0$. By condition (ref) and LIE, $$\mathbb{V} \left[ { \frac{1}{T} \sum_{t=1}^T x_{*,it} u_{it} } \right] = \mathbb{E} \left[ { \left( {\frac{1}{T} \sum_{t=1}^T x_{*,it} u_{it} } \right) \left( {\frac{1}{T} \sum_{s=1}^T x_{*,is} u_{is} } \right)' } \right] = \frac{1}{T^2}\sum_{t=1}^T \sum_{s=1}^T \mathbb{E}[x_{*,it} x_{*,is}' u_{it}u_{is}] = \frac{\sigma^2}{T}\mathbb{E}[x_{*,it} x_{*,it}'] \; . $$ Slutsky's theorem then yields asymptotic Normality with mean zero and variance $\frac{\sigma^2}{T}\mathbb{E}[x_{it}x_{it}']^{-1}$. \begin{proposition}[Large $T$ Consistency & Asymptotic Normality of $\hat\alpha_{OLS}$] \\[3pt] Suppose \begin{enumerate} • Model is specified correctly: $y_{t} = X_{t}\alpha_* + u_{t}$. • $\mathbb{E}_{t-1}[u_t] = 0$. • $y_t$ is ergodic and strictly stationary (SS). • $\mathbb{E}_{t-1}[u_t u_t'] = \Sigma$. \end{enumerate} Under conditions (ref) - (ref), $\hat{\alpha}_{OLS} \overset{p}{\rightarrow} \alpha_*$ as $T \rightarrow \infty$. Under conditions (ref) - (ref), $$ \sqrt{T}(\hat{\alpha}_{OLS}-\alpha_*) \overset{d}{\rightarrow} N \left( { 0 \; , \; \mathbb{E}[X_t'X_t]^{-1} \mathbb{E}[X_t'\Sigma X_t] \mathbb{E}[X_t'X_t]^{-1'} } \right) \; .$$ \end{proposition} By condition (ref), \begin{align*} \hat{\alpha}_{OLS} = \left[ { \frac{1}{T} \sum_{t=1}^T X_t'X_t } \right]^{-1} \left[ { \frac{1}{T} \sum_{t=1}^T X_t'X_t \alpha + \frac{1}{T} \sum_{t=1}^T X_t' u_t } \right] \; . \end{align*} By the Weak Law of Large Numbers (WLLN) for ergodic and SS time series (condition (ref)), $$\frac{1}{T} \sum_{t=1}^T \left( { A_{n} y_{t-l}} \right)' \left( { A_{n} y_{t-k}} \right) \overset{p}{\rightarrow} \mathbb{E}\left[ { \left( { A_{n} y_{t-l}} \right)' \left( { A_{n} y_{t-k}} \right) } \right] $$ so that $\frac{1}{T} \sum_{t=1}^T X_t'X_t \overset{p}{\rightarrow} \mathbb{E}[X_t'X_t]$. By the same condition and condition (ref), $\frac{1}{T} \sum_{t=1}^T X_t' u_t \overset{p}{\rightarrow} 0$. This establishes consistency. To establish asymptotic Normality, write \begin{align*} \sqrt{T}(\hat{\alpha}_{OLS}-\alpha_*) = \left[ { \frac{1}{T} \sum_{t=1}^T X_t'X_t } \right]^{-1} \left[ {\frac{1}{\sqrt{T}} \sum_{t=1}^T X_t' u_t } \right] \; . \end{align*} By the Central Limit Theorem (CLT) for ergodic and SS time series, $\frac{1}{\sqrt{T}} \sum_{t=1}^T X_t' u_t \overset{d}{\rightarrow} N \left( { 0 , \mathbb{V}[X_t' u_t] } \right)$, as $\mathbb{E}[X_t' u_t] = 0$. Thereby, $\mathbb{V}[X_t' u_t] = \mathbb{E}[X_t' u_t u_t' X_t] = \mathbb{E}[X_t'\Sigma X_t]$ by LIE and conditions (ref) and (ref). Slutsky's theorem then yields asymptotic Normality with mean zero and variance $\mathbb{E}[X_t'X_t]^{-1} \mathbb{E}[X_t'\Sigma X_t] \mathbb{E}[X_t'X_t]^{-1'}$. If $\Sigma = \sigma^2 I$, the latter boils down to $\sigma^2 \mathbb{E}[\sum_{i=1}^n x_{it}x_{it}']^{-1}$. If in addition we can write $\mathbb{E}[\sum_{i=1}^n x_{it}x_{it}']= n \mathbb{E}[x_{it}x_{it}']$, it becomes $\frac{\sigma^2}{n}\mathbb{E}[x_{it}x_{it}']^{-1}$. \begin{proposition}[Large $(n,T)$ Consistency & Asymptotic Normality of $\hat\alpha_{OLS} $] \\[3pt] Suppose either i) the conditions in (ref) hold, or ii) the conditions in (ref) as well as the following two conditions hold: \begin{enumerate} • $\Sigma = \sigma^2 I$$\sum_{i=1}^n \mathbb{E}[x_{n,it}x_{n,it}'] = n \mathbb{E}[x_{*,it}x_{*,it}']$ \end{enumerate} Then, $\sqrt{nT}(\hat{\alpha}_{OLS}-\alpha_*) \overset{d}{\rightarrow} N \left( { 0 , \sigma^2 \mathbb{E}[x_{*,it}x_{*,it}']^{-1} } \right)$ as $(n,T) \rightarrow \infty$. \end{proposition} \subsubsection*{NVAR($p,q$), $q\in\mathbb{N}\backslash\{1\}$: Identification} With $A$ given, the problem of identifying $\alpha$ under $\tilde{y}_\tau \sim$ NVAR($p,1$) and $\{y_t\}_{t=1}^T = \{\tilde{y}_{tq}\}_{t=1}^T$ for $q\in\mathbb{N}\backslash\{1\}$ is akin to identifying $\alpha$ in the AR(p) $\tilde{x}_\tau = \alpha_1 \tilde{x}_{\tau-1} + ... + \alpha_p \tilde{x}_{\tau-p} + \check{u}_\tau$ when the univariate process $\tilde{x}_\tau$ is observed every $q$ periods: $\{x_t\}_{t=1}^T = \{\tilde{x}_{tq}\}_{t=1}^T$. For example, under $p=1$ and $q=2$, we have \begin{align*} y_t = \alpha_1^2 A^2 y_{t-1} + u_t \; , \quad \text{and} \quad x_t = \alpha_1^2 x_{t-1} + e_t \; , \end{align*} respectively, and in both cases $\alpha_1$ is identified only up to sign. While characterization of the identified set remains elusive for the former case for all but $(p=1, q=2)$, the latter case provides insights for $q=2$ and general $p$. For further discussion, see PalmNijman1984. Let $\gamma_h = \mathbb{E}[\tilde{x}_{t}\tilde{x}_{t-h}] = \gamma_{-h}$, which can be estimated by the analogy principle as $\hat{\gamma}_h = \frac{1}{T-h} \sum_{t=h+1}^T \tilde{x}_{t}\tilde{x}_{t-h}$. Under $q=2$, $\hat{\gamma}_h$ is observed only for $h$ even (and zero). The Yule-Walker equations for an AR($p$) lead to the system \begin{align*} \begin{bmatrix} \gamma_0 - \sigma^2 & \gamma_1 & ... & \gamma_m \end{bmatrix} = \begin{bmatrix} \alpha_1 & \alpha_2 & ... & \alpha_p \end{bmatrix} \begin{bmatrix} \gamma_1 & \gamma_0 & \hdots & & & & \gamma_{m-1} \\ \gamma_2 & \gamma_1 & \ddots & & & & \vdots \\ \vdots & \vdots & \ddots & & & & \\ \gamma_p & \gamma_{p-1} & \hdots & \gamma_1 & \gamma_0 & \hdots & \\ \end{bmatrix} \; , \end{align*} for $m \geq p-1$. In principle, this system of (nonlinear) equations could be solved for the unknowns $\{\alpha_l\}_{l=1:p}$ and $\{\gamma_h\}_{h=1,3,...}$. However, the following analysis suggests that $\{\alpha_l\}_{l=1,3,...}$ and $\{\gamma_h\}_{h=1,3,...}$ are (jointly) identified only up to sign, respectively. Let $\underline{m}$ be the largest odd number in $1:m$ and $\overline{m}$ the largest even one. For the non-observed $\{\gamma_h\}_{h=1,3,...}$, we have \begin{align*} \begin{bmatrix} \gamma_1 & \gamma_3 & ... & \gamma_{\underline{m}} \end{bmatrix} = \begin{bmatrix} \alpha_1 & \alpha_2 & ... & \alpha_p \end{bmatrix} \begin{bmatrix} \gamma_0 & \gamma_2 & \gamma_4 & \hdots & \gamma_{\underline{m}-1} \\ \gamma_1 & \gamma_1 & \gamma_3 & & \\ \vdots & \vdots & \vdots & & \\ \gamma_{p-1} & \gamma_{p-3} & & & \\ \end{bmatrix} \; , \end{align*} and therefore \begin{align} \begin{bmatrix} \gamma_1 \\ \gamma_3 \\ ... \\ \gamma_{\underline{m}} \end{bmatrix} = \overline{A} \begin{bmatrix} \gamma_1 \\ \gamma_3 \\ ... \\ \gamma_{\underline{m}} \end{bmatrix} + \underline{A} \begin{bmatrix} \gamma_0 \\ \gamma_2 \\ ... \\ \gamma_{\overline{m}} \end{bmatrix} = (I-\overline{A})^{-1} \underline{A} \begin{bmatrix} \gamma_0 \\ \gamma_2 \\ ... \\ \gamma_{\overline{m}} \end{bmatrix} \; , \end{align} where only $\alpha_l$ for $l$ even appear in $\overline{A}$ (and its elements are linear in $\alpha$), and only $\alpha_l$ for $l$ odd appear in $\underline{A}$. For the observed $\{\gamma_h\}_{h=0,2,...}$, we have \begin{align*} \begin{bmatrix} \gamma_0 - \sigma^2 & \gamma_2 & ... & \gamma_{\overline{m}} \end{bmatrix} = \begin{bmatrix} \alpha_1 & \alpha_2 & ... & \alpha_p \end{bmatrix} \begin{bmatrix} \gamma_1 & \gamma_1 & \gamma_3 & \hdots & \gamma_{\overline{m}-1} \\ \gamma_2 & \gamma_0 & \gamma_2 & & \\ \vdots & \vdots & \vdots & & \\ \gamma_{p} & \gamma_{p-2} & & & \\ \end{bmatrix} \; , \end{align*} and therefore \begin{align} \begin{bmatrix} \gamma_0-\sigma^2 \\ \gamma_2 \\ ... \\ \gamma_{\overline{m}} \end{bmatrix} = \underline{B} \begin{bmatrix} \gamma_1 \\ \gamma_3 \\ ... \\ \gamma_{\underline{m}} \end{bmatrix} + \overline{B} \begin{bmatrix} \gamma_0 \\ \gamma_2 \\ ... \\ \gamma_{\overline{m}} \end{bmatrix} \; , \end{align} where again only $\alpha_l$ for $l$ even appear in $\overline{B}$, and only $\alpha_l$ for $l$ odd appear in $\underline{B}$. (ref) and (ref) illustrate that multiplying $(\gamma_1, \gamma_3, ...)$ by $(-1)$ as well as $(\alpha_1, \alpha_3, ...)$ (i.e. $\underline{A}$ and $\underline{B}$) does not change the system of equations. \subsubsection*{Posterior Derivations: $(\alpha,\Sigma)$} This section derives the conditional (full-sample) posteriors $p(\alpha | \tilde{Y}_{1:T_\tau}, \tilde{\Sigma})$, $p(\tilde{\Sigma}| \tilde{Y}_{1:T_\tau}, \alpha)$, $p(\beta_\alpha | \alpha, \lambda_\alpha)$ and $p(\lambda_\alpha^{-1} | \alpha, \beta_\alpha)$ in an NVAR($p,1$). To simplify notation, I ignore the possibility that $\tilde{Y}_{1:T_\tau}$ has been obtained from a data augmentation step and write $Y_{1:T}$, $X_t$, $u_t$ and $\Sigma$ for $\tilde{Y}_{1:T_\tau}$ $\tilde{X}_\tau$, $\tilde{u}_\tau$ and $\tilde{\Sigma}$. Under $u_t \sim N(0,\Sigma)$, the (conditional) likelihood associated with the NVAR($p,1$) is \begin{align*} p(Y_{1:n,1:T}|\alpha,\Sigma,Y_{1:n,-p+1:0}) &= \prod_{t=1}^T p(y_t|\theta,y_{t-p:t-1}) \\ &= \prod_{t=1}^T (2\pi)^{-n/2} |\Sigma|^{-1/2} exp \left\{ { -\frac{1}{2} u_t'\Sigma^{-1} u_t } \right\} \\ &= (2\pi)^{-nT/2} |\Sigma|^{-T/2} exp \left\{ { -\frac{1}{2} \sum_{t=1}^T u_t'\Sigma^{-1} u_t } \right\} \; , \end{align*} where $u_t = y_t - \sum_{l=1}^p \alpha_l A y_{t-l} = y_t - X_t \alpha$. I write this likelihood in short as $p(Y|\alpha,\Sigma)$. Under a Uniform prior for $\alpha$, -- $p(\alpha) \propto c$ --, we get \begin{align*} p(\alpha | Y, \beta_\alpha, \lambda_\alpha, \Sigma) &\propto p(Y|\alpha,\Sigma)p(\alpha) \\ &\propto exp \left\{ { -\frac{1}{2}\left\{ { \alpha' \left[ { \sum_{t=1}^T X_t'\Sigma^{-1}X_t } \right]\alpha - 2 \alpha'\left[ {\sum_{t=1}^T X_t' \Sigma^{-1}y_t } \right] } \right\} } \right\} } \right\} } \; , \end{align*} which shows that \begin{align*} \alpha \mid (Y, \Sigma) \sim N \left( { \bar{\alpha}, \bar{V}_\alpha } \right) \; , \end{align*} with $$ \bar{V}_\alpha = \left[ {\sum_{t=1}^T X_t'\Sigma^{-1}X_t } \right]^{-1} \; , \quad \bar{\alpha} = \bar{V}_\alpha \left[ { \sum_{t=1}^T X_t' \Sigma^{-1} y_t } \right] \; .$$ Under a uniform prior for $\Sigma$, we get \begin{align*} p(\Sigma|Y,\alpha) &\propto p(Y|\alpha,\Sigma) \\ &\propto |\Sigma|^{-T/2} exp \left\{ { -\frac{1}{2} \sum_{t=1}^T u_t'\Sigma^{-1} u_t } \right\} \\ &= |\Sigma|^{-T/2} exp \left\{ { -\frac{1}{2} tr\left[ { \Sigma^{-1} U'U } \right] } \right\} \; , \end{align*} where $U$ is $T \times n$ and stacks $u_t$ along rows. This shows that \begin{align*} \Sigma\mid(Y,\alpha) \sim IW(\bar{S},\bar{v}) \; , \quad \bar{S} = U'U \; , \quad \bar{v} = T \; . \end{align*} The mode of $p(\alpha,\Sigma|Y)$ is equal to the Generalized LS estimator $(\hat{\alpha}, \hat{\Sigma})$, obtained by iterating on the conditional estimators $\hat{\alpha}|\Sigma = \left[ {\sum_{t=1}^T X_t'\Sigma^{-1}X_t } \right]^{-1} \left[ { \sum_{t=1}^T X_t' \Sigma^{-1} y_t } \right]$ and $\hat{\Sigma}|\alpha = \frac{1}{T}\sum_{t=1}^T u_tu_t'$ until convergence. \subsubsection*{NVAR($p,q$), $q \in \mathbb{N} \backslash\{1\}$: Data Augmentation} The usual formulas for the Kalman filter and Carter & Kohn simulation smoother simplify for the particular state space model characterizing the NVAR. This can be exploited for computational efficiency. Given an $np \times 1$ vector $x$, let $\left[ {x} \right]_1 = x_{1:n}$ contain the first $n$ elements, $\left[ {x} \right]_{-1}$ all but the first $n$ elements, and $\left[ {x} \right]_{-p}$ all but the last $n$ elements. Similarly, given an $np \times np$ matrix $X$, let $$ X = \begin{bmatrix} \left[ {X} \right]_{1,1} & \left[ {X} \right]_{1,-1} \\ \left[ {X} \right]_{-1,1} & \left[ {X} \right]_{-1,-1} \end{bmatrix} = \begin{bmatrix} \left[ {X} \right]_{-p,-p} & \left[ {X} \right]_{-p,p} \\ \left[ {X} \right]_{p,-p} & \left[ {X} \right]_{p,p} \end{bmatrix} = \begin{bmatrix} \left[ {X} \right]_{-p,\cdot} \\ \left[ {X} \right]_{p,\cdot} \end{bmatrix} = \begin{bmatrix} \left[ {X} \right]_{\cdot,-p} & \left[ {X} \right]_{\cdot,p} \end{bmatrix} \; , $$ where $\left[ {X} \right]_{1,1}$ and $\left[ {X} \right]_{p,p}$ are $n\times n$, $\left[ {X} \right]_{p,\cdot}$ is $n \times (np-p)$ and $\left[ {X} \right]_{\cdot,p}$ is $(np-p)\times rn$. For a stock variable $y_t$, the NVAR($p,q$) for $q \in \mathbb{N} \backslash\{1\}$ leads to the state space model \begin{align*} y_t &= [I_n, 0_{n\times np-n}]s_\tau \quad \text{if} \; t = \tau/q \in \mathbb{N} \; , \\ s_\tau &= R s_{\tau-1} + v_\tau \; , \quad v_\tau \sim N(0, \Sigma_v) \; , \quad \text{for} \; \tau = 1:T_\tau \; , \end{align*} where $s_t = (\tilde{y}_\tau', \tilde{y}_{\tau-1}', ..., \tilde{y}_{\tau-p+1}')'$ and $v_\tau = (u_\tau',0, ..., 0)'$ are $np \times 1$, and \begin{align*} R = \begin{bmatrix} \multicolumn{2}{c}{\alpha_1 A, \alpha_2 A, ..., \alpha_{p}A} \\ I_{np-n \times np-n} & 0_{np-n \times n} \end{bmatrix} \quad \text{and} \quad \Sigma_v = \begin{bmatrix} \Sigma_u & 0_{n \times np-n} \\ \multicolumn{2}{c}{0_{np-n \times np}} \end{bmatrix} \end{align*} are $np \times np$. For notational simplicity, write $\tilde{y}_\tau$ as $x_\tau$. \begin{algo}[Kalman Filter for NVAR($p,q$), $q \in \mathbb{N} \backslash\{1\}$, for Stock Variables] \\[-20pt] \begin{enumerate} • Initialize $s_{0|0} = 0$ and $P_{0|0} = \sum_{l=0}^h R^l \Sigma_v R^{l\prime}$ for $h$ large. • For $\tau=1:T_\tau$, given $s_{\tau-1|\tau-1}$ and $P_{\tau-1|\tau-1}$, \begin{enumerate} • Forecast $s_\tau$: compute $s_{\tau|\tau-1}$ and $P_{\tau|\tau-1}$ as \begin{align*} \bullet \quad &\left[ {s_{\tau|\tau-1}} \right]_{1} = R_{1,\cdot} s_{\tau-1|\tau-1} \quad , \quad &&\left[ {s_{\tau|\tau-1}} \right]_{-1} = \left[ {s_{\tau-1|\tau-1}} \right]_{-p} \; ,\\[3pt] \bullet \quad &\left[ {P_{\tau|\tau-1}} \right]_{11} = R_{1,\cdot} P_{\tau-1|\tau-1} R_{1,\cdot}' + \Sigma_u \quad , \quad &&\left[ {P_{\tau|\tau-1}} \right]_{1,-1} = \left[ {P_{\tau|\tau-1}} \right]_{-1,1}' \; ,\\ &\left[ {P_{\tau|\tau-1}} \right]_{-1,1} = \left[ {P_{\tau-1|\tau-1}} \right]_{-p,\cdot} R_{1,\cdot}' \quad , \quad &&\left[ {P_{\tau|\tau-1}} \right]_{-1,-1} = \left[ {P_{\tau-1|\tau-1}} \right]_{-p,-p} \; . \end{align*} • Forecast $x_\tau$: if $\tau/q \in \mathbb{N}$, compute $x_{\tau|\tau-1}$ and $F_{\tau|\tau-1}$ as \begin{align*} \bullet \quad &x_{\tau|\tau-1} = \left[ {s_{\tau|\tau-1}} \right]_{1} \; ,\\[3pt] \bullet \quad &F_{\tau|\tau-1} = \left[ {P_{\tau|\tau-1}} \right]_{11} \; . \end{align*} If $\tau/q \notin \mathbb{N}$, skip this step. • Given observation $x_\tau$, update forecast for $s_\tau$: if $\tau/q \in \mathbb{N}$, compute $s_{\tau|\tau}$ and $P_{\tau|\tau}$ as \begin{align*} \bullet \quad &s_{\tau|\tau} = s_{\tau|\tau-1} + \left[ {P_{\tau|\tau-1}} \right]_{\cdot,1} F_{\tau|\tau-1}^{-1} (x_\tau - x_{\tau|\tau-1}) \; ,\\[3pt] \bullet \quad &P_{\tau|\tau} = P_{\tau|\tau-1} - \left[ {P_{\tau|\tau-1}} \right]_{\cdot,1} F_{\tau|\tau-1}^{-1} \left[ {P_{\tau|\tau-1}} \right]_{1,\cdot} \; . \end{align*} If $\tau/q \notin \mathbb{N}$, let $s_{\tau|\tau}= s_{\tau|\tau-1}$ and $P_{\tau|\tau}=P_{\tau|\tau-1}$. \end{enumerate} \end{enumerate} \end{algo} Thereby, $R_{1,\cdot} = [\alpha_1A, \alpha_2A, ..., \alpha_{p}]A = (\alpha_1,...,\alpha_{p})\otimes A$, and $\left[ {P_{\tau|\tau-1}} \right]_{1,\cdot} = \left[ {P_{\tau|\tau-1}} \right]_{\cdot,1}'$. For a flow variable $y_t$, the NVAR($p,q$) for $q \in \mathbb{N} \backslash\{1\}$ leads to the state space model \begin{align*} y_t &= \Psi s_\tau \quad \text{if} \; t = \tau/q \in \mathbb{N} \; , \\ s_\tau &= R s_{\tau-1} + v_\tau \; , \quad v_\tau \sim N(0, \Sigma_v) \; , \quad \text{for} \; \tau = 1:T_\tau \; , \end{align*} where $s_\tau$, $v_\tau$, $R$ and $\Sigma_v$ are analogous to above, but with dimensions $np'$ instead of $np$, where $p' = \max\{p,q\}$. If $p'>p$, we set $\alpha_l = 0$ for $l = (p+1):p'$. Also, $\Psi = [I_n, ..., I_n, 0_{n\times n(p'-q)}]$ is $n \times np'$. Step (b) in the Kalman filter changes to \begin{align*} \bullet \quad &x_{\tau|\tau-1} = \Psi s_{\tau|\tau-1} = \sum_{l=1}^{q} \left[ {s_{\tau|\tau-1}} \right]_{l} \; ,\\[3pt] \bullet \quad &F_{\tau|\tau-1} = \Psi P_{\tau|\tau-1} \Psi' = \sum_{l=1}^{q}\sum_{k=1}^{q} \left[ {P_{\tau|\tau-1}} \right]_{lk} \; , \end{align*} and step (c) changes to \begin{align*} \bullet \quad &s_{\tau|\tau} = s_{\tau|\tau-1} + P_{\tau|\tau-1} \Psi' F_{\tau|\tau-1}^{-1} (x_\tau - x_{\tau|\tau-1}) \; ,\\[3pt] \bullet \quad &P_{\tau|\tau} = P_{\tau|\tau-1} - P_{\tau|\tau-1} \Psi' F_{\tau|\tau-1}^{-1} \Psi P_{\tau|\tau-1} \; , \end{align*} where $P_{\tau|\tau-1} \Psi' = \sum_{l=1}^{q} \left[ {P_{\tau|\tau-1}} \right]_{\cdot,l} = \left( {\Psi P_{\tau|\tau-1}} \right)'$. \begin{algo}[CarterKohn1994 Simulation Smoother for NVAR($p,q$), $q \in \mathbb{N} \backslash\{1\}$] \\[-20pt] \begin{enumerate} • Run the Kalman filter to get $\{s_{\tau|\tau},s_{\tau|\tau-1},P_{\tau|\tau},P_{\tau|\tau-1}\}_{\tau=1}^{T_\tau}$. • Draw $\left[ {s_{T_\tau}^m} \right]_1$ from $ N\left( {\left[ {s_{{T_\tau}|{T_\tau}}} \right]_1, \left[ {P_{{T_\tau}|{T_\tau}}} \right]_{11} } \right)$. • For $\tau={T_\tau}-1, ..., 0$, given draw $\left[ {s_{\tau+1}^m} \right]_1$ from $ N\left( {\left[ {s_{\tau+1|\tau+2}} \right]_1 , \left[ {P_{\tau+1|\tau+2}} \right]_{11} } \right)$, draw $\left[ {s_{\tau}^m} \right]_1$ from $ N\left( { \left[ {s_{\tau|\tau+1}} \right]_1,\left[ {P_{\tau|\tau+1}} \right]_{11} } \right)$ with \begin{align*} \bullet \quad &s_{\tau|\tau+1} = s_{\tau|\tau} + P_{\tau|\tau}R_{1\cdot}' \left( {R_{1\cdot}P_{\tau|\tau}R_{1\cdot}' + \Sigma} \right)^{-1}(\left[ {s_{\tau+1}^m} \right]_1 - \left[ {s_{\tau+1|\tau}} \right]_1) \; ,\\[3pt] \bullet \quad &P_{\tau|\tau+1} = P_{\tau|\tau} - P_{\tau|\tau}R_{1\cdot}' \left( {R_{1\cdot}P_{\tau|\tau}R_{1\cdot}' + \Sigma} \right)^{-1} R_{1\cdot} P_{\tau|\tau} \; . \end{align*} \end{enumerate} \end{algo} Relative to the notation used for the Kalman filter, this is with a slight abuse of notation, as $s_{\tau|\tau+1} \neq \mathbb{E}\left[ {s_\tau|X_{1:\tau},s_{\tau+1}} \right]$ but $s_{\tau|\tau+1}= \mathbb{E}\left[ {s_\tau|X_{1:\tau},\left[ {s_{\tau+1}} \right]_1} \right] \right]_1}$, and similarly $P_{\tau|\tau+1}= \mathbb{V}\left[ {s_\tau|X_{1:\tau},\left[ {s_{\tau+1}} \right]_1} \right] \right]_1}$. See KimNelsonSSBook for the adjustments of the CKSS required when $s_t$ is a companion form-VAR(1). \subsection{Joint Inference: Network & Timing $(\alpha,A)$} \subsubsection*{Posterior Derivations for $A$} \paragraph*{Normal Prior} Under independent priors $a_{ij} \sim N(b_{ij},\lambda_a^{-1})$, the conditional posterior of $A |(\alpha, \Sigma, B,\lambda_a)$ is \begin{align*} p(A|Y,\alpha,\Sigma,B,\lambda_a) &\propto p(Y|\alpha,A,\Sigma)p(A|B,\lambda_a) \\ &\propto exp \left\{ { -\frac{1}{2} \sum_{t=1}^T \left( { y_t - A z_t } \right)'\Sigma^{-1} \left( { y_t - A z_t } \right) } \right\} exp\left\{ { -\frac{1}{2}\lambda_a \sum_{i,j=1}^n (a_{ij}-b_{ij})^2 } \right\} \\ &= exp \left\{ { -\frac{1}{2} tr \left[ { \Sigma^{-1} \left( { Y - ZA' } \right)' \left( { Y - ZA' } \right) } \right] } \right\} exp\left\{ { -\frac{1}{2}\lambda_a tr[(A-B)'(A-B)] } \right\} \; , \\ &\propto exp \left\{ { -\frac{1}{2} tr \left[ { \Sigma^{-1} \left[ { A (Z'Z + \lambda_a \Sigma)A' - 2A(Z'Y + \lambda_a B'\Sigma) } \right] } \right]} \right] } } \right\} \; ,\footnotemark \end{align*} which lets us deduce that \begin{align*} A' \mid (Y, \alpha, \Sigma) \sim MN \left( { \bar{A}, \bar{U}_A , \bar{V}_A } \right) \; , \quad \text{with} \; \; \bar{U}_A = \left[ { Z'Z + \lambda_a \Sigma } \right]^{-1} \; , \; \; \bar{A} = \bar{U}_A \left[ { Z'Y + \lambda_a B'\Sigma } \right] \; , \; \; \bar{V}_A = \Sigma \; , \end{align*} and therefore \begin{align*} A \mid (Y, \alpha, \Sigma) \sim MN \left( { \bar{A}' , \bar{V}_A, \bar{U}_A } \right) \; . \end{align*} \footnotetext{Note that $ \sum_{i,j=1}^n (a_{ij}-b_{ij})^2 = vec(A-B)'vec(A-B) = tr[(A-B)'(A-B)]$. Also, I use the results that $tr[AB] = tr[BA]$, $tr[A]=tr[A']$ and $c \; tr[A] = tr[cA]$.} Note that $-\log \; p(A|Y,\alpha,\Sigma,B,\lambda_a)$ is proportional to the LS objective function with a Ridge-penalty in (ref). Therefore, its conditional minimizer is the mode of $p(A |Y, \alpha, \Sigma)$. The (joint) minimzer of the objective function in (ref) is the mode of $p(\alpha,A|Y,\Sigma,B,\lambda_a)$ under a uniform prior for $\alpha$. \paragraph*{Exponential Prior} Consider the alternative prior $a_{ij} \sim \text{Exponential}(\lambda_a)$. It leads to the conditional posterior \begin{align*} p(A|Y,\alpha,\Sigma,\lambda_a) &\propto p(Y|\alpha,A,\Sigma)p(A|\lambda_a) \\ &\propto exp \left\{ { -\frac{1}{2} \sum_{t=1}^T \left( { y_t - A z_t } \right)'\Sigma^{-1} \left( { y_t - A z_t } \right) } \right\} exp \left\{ { - \lambda_a \iota'A \iota} \right\} \\ &= exp \left\{ { -\frac{1}{2} tr \left[ { \Sigma^{-1} \left( {Y - Z A' } \right)' \left( { Y - Z A' } \right) } \right]} \right\} exp \left\{ { - \lambda_a \iota'A \iota} \right\} \\ &\propto exp \left\{ { - \frac{1}{2}tr\left[ { \Sigma^{-1} \left[ { AZ'ZA' - 2 A \left( { Z'Y - \lambda_a \iota \iota' \Sigma } \right) } \right] } \right]} \right] } } \right\} \; , \end{align*} where $\iota$ is an $n$-dimensional vector of ones.\footnote{Note that $\sum_{i,j=1}^n a_{ij} = \iota' A \iota$. On top of the rules referenced above, here I also used $a'Ba = tr[Baa']$.} This leads to \begin{align*} A' \mid (Y, \alpha, \Sigma, \lambda_a) \sim MN \left( { \bar{A}, \bar{U}_A , \bar{V}_A } \right) \; , \quad \text{truncated to } \; \mathbb{R}_+^{n^2} \; , \end{align*} with $\bar{U}_A = \left( { Z'Z } \right)^{-1} $, $\bar{A} = \bar{U}_A \left[ { Z'Y - \lambda_a \iota \iota' \Sigma } \right] $ and $ \bar{V}_A = \Sigma$. Alternatively, this can be written as \begin{align*} vec(A') \mid (Y, \alpha, \Sigma, \lambda_a) \sim N \left( { vec(\bar{A}), \bar{V}_A \otimes \bar{U}_A } \right) \; , \quad \text{truncated to} \; \mathbb{R}_+^{n^2} \; . \end{align*} Note that $-\log \; p(A|Y,\alpha,\Sigma,\lambda_a)$ is proportional to a LS objective function analogous to (ref), but imposing restrictions $a_{ij} \geq 0$ and using a Lasso-penalty $\lambda_a \sum_{i,j=1}^n |a_{ij}| = \lambda_a \sum_{i,j=1}^n a_{ij}$ to shrink $a_{ij}$ to zero. This expression simplifies under $\Sigma=I$: $$ A_{i\cdot} \mid (Y, \alpha, \Sigma=I, \lambda_a) \sim N \left( { (\bar{A}')_{i,\cdot}, \bar{U}_A} \right) \; , \quad \text{truncated to} \; \mathbb{R}_+^{n} \; , $$ independent across rows $i$. One can draw from this distribution using Gibbs sampling, iterating on the conditional densities \begin{align*} a_{ij} \mid (A_{i,-j}, Y, \alpha, \Sigma=I, \lambda_a) \sim N(\mu^{a_{ij}},\Sigma^{a_{ij}}) \; , \quad \text{truncated to} \; \mathbb{R}_+ \end{align*} for $j=1:n$, whereby \begin{align*} \mu^{a_{ij}} = (\bar{A}')_{ij} + (\bar{U}_A)_{j,-j} (\bar{U}_A)_{-j,-j}^{-1} (A_{i,-j} - (\bar{A}')_{i,-j})\quad \text{and}\quad \Sigma^{a_{ij}}= (\bar{U}_A)_{jj} - (\bar{U}_A)_{j,-j} (\bar{U}_A)_{-j,-j}^{-1} (\bar{U}_A)_{-j,j} \; . \end{align*} Analogously, the mode of this distribution is obtained by iterating on the conditional modes \begin{align*} \hat{a}_{ij} | (A_{i,-j}, \alpha,\Sigma=I,\lambda_a) &= max \{ 0, \check{a}_{ij} \} \; , \quad \check{a}_{ij} = \frac{\sum_{t=1}^T (y_{it} - A_{i,-j}z_{-j,t})z_{jt} - \lambda_a}{\sum_{t=1}^T z_{jt}^2 } \end{align*} (see MengRubin1993). Doing so for all rows $i$ yields the mode of $p(A | Y, \alpha, \Sigma=I,\lambda_a)$, which is the conditional OLS estimator of $A$. \subsubsection*{NVAR($p,1$): Asymptotic Properties of $(\hat{\alpha}_{OLS},\hat{A}_{OLS})$} Let $\theta = (\alpha,A)$. As elaborated on above, the OLS estimator solves \begin{align*} \hat{\theta} &= \arg \underset{\theta \in \Theta }{min} \; Q_{n,T}(\theta;Y) \; , \\ \text{with}\;\;Q(\theta;Y) &= \frac{1}{nT} \sum_{t=1}^T u_t(\theta) ' u_t(\theta) + \tilde{\lambda} \sum_{i,j=1}^n (a_{ij}-b_{ij})^2 \; , \end{align*} with $u_t(\theta) = y_t - A z_t = y_t - X_t \alpha $ and $\tilde{\lambda} = \frac{1}{nT}\lambda_a$. To render $(\alpha,A)$ identified, fix $\alpha_l$ for some $l$ and drop it from $\alpha$, with appropriate redefinitions of $y_t$, $z_t$ and $X_t$. Under the alternative normalization $||\alpha||_1 = 1$, the following consistency results would go through, but the interior-requirement for asymptotic Normality would be violated. \begin{proposition}[Large $T$ Consistency & Asymptotic Normality of $\hat{\theta} = (\hat\alpha,\hat{A})$] \\[3pt] Take $\Theta = [-c,c]^{p-1+n^2}$ for $c>0$ large such that $\Theta \subset \mathbb{R}^{p-1+n^2}$ is compact, and suppose \begin{enumerate} • $\tilde{\lambda}_{n,T}=o(T^{-\frac{1}{2}})$. • $y_t$ is ergodic and strictly stationary (SS). • $\mathbb{E}[X_t'X_t]$ and $\mathbb{E}[z_tz_t']$ are of full rank. • Model is specified correctly: $y_{t} = A\tilde{X}_{t}\alpha + u_{t}$. • $\mathbb{E}_{t-1}[u_t] = 0$. • $\mathbb{E}_{t-1}[u_t u_t'] = \Sigma$. \end{enumerate} Under conditions (ref) - (ref), $\hat{\theta} = (\hat\alpha,\hat{A}) \overset{p}{\rightarrow} \theta_0$ as $T \rightarrow \infty$. Under conditions (ref) - (ref), $$ \sqrt{T}(\hat{\theta}_{LS}-\theta_0) \overset{d}{\rightarrow} N ( 0, H^{-1} M H^{-1}) \; , $$ with $H$ and $M$ defined below. \end{proposition} By conditions (ref) and (ref), $Q_{n,T}(\theta;Y)$ converges uniformly in probability to the limit objective function $Q(\theta) = \frac{1}{n} \mathbb{E}\left[ { u_t(\theta)'u_t(\theta) } \right]$, which is continuous on $\Theta$: \begin{align*} &\underset{\theta \in \Theta}{sup} \; \big| \frac{1}{nT} \sum_{t=1}^T u_t(\theta) ' u_t(\theta) - \frac{1}{n} \mathbb{E}\left[ { u_t(\theta)'u_t(\theta) } \right] + \tilde{\lambda}_{n,T} \sum_{i,j=1}^n (a_{ij}-b_{ij})^2 \big| \\ \leq &\frac{1}{n} \underset{\theta \in \Theta}{sup} \; \big| \frac{1}{T} \sum_{t=1}^T u_t(\theta) ' u_t(\theta) - \mathbb{E}\left[ { u_t(\theta)'u_t(\theta) } \right] \big| + \underset{\theta \in \Theta}{sup} \; \big|\tilde{\lambda}_{n,T} \sum_{i,j=1}^n (a_{ij}-b_{ij})^2 \big| \end{align*} converges in probability to zero because, under condition (ref), \begin{align*} \underset{\theta \in \Theta}{sup} \; \big|\tilde{\lambda}_{n,T} \sum_{i,j=1}^n (a_{ij}-b_{ij})^2 \big| = \tilde{\lambda}_{n,T} \sum_{i,j=1}^n (c+b_{ij})^2 \leq \tilde{\lambda}_{n,T} \sum_{i,j=1}^n \tilde{c} = \tilde{\lambda}_{n,T} n^2 \tilde{c} \rightarrow 0 \; , \end{align*} where $\tilde{c} = \max_{i,j} (c+b_{ij})^2$, while under condition (ref), $\frac{1}{T} \sum_{t=1}^T u_t(\theta) ' u_t(\theta) \overset{p}{\rightarrow} \mathbb{E}\left[ { u_t(\theta)'u_t(\theta)} \right]$ by WLLN for ergodic and SS time series. Finally, under condition (ref), $Q(\theta)$ is uniquely minimized by $\theta_0 = (\alpha_*,A_*)$ defined by the first-order conditions (FOC) \begin{align*} \alpha_*|A_* = \mathbb{E}[X_t(A_*)'X_t(A_*)]^{-1} \mathbb{E}[X_t(A_*)'y_t] \; , \quad A_*|\alpha_* = \mathbb{E}[y_tz_t(\alpha_*)'] \mathbb{E}[z_t(\alpha_*)z_t(\alpha_*)']^{-1} \; . \end{align*} Note that for $c$ large enough, we necessarily get a solution $\theta_0 \in int(\Theta)$. Without the imposed normalization, $\theta_0$ would not be unique, as for any $(\alpha_*,A_*)$ that solves the above, $(k\alpha_*,k^{-1}A_*)$ for any $k\in \mathbb{R}$ does, too, because $X_t(k^{-1}A_*)=k^{-1}X_t(A_*)$ and $z_t(k\alpha_*)=kz_t(\alpha_*)$.\footnote{With $\alpha_l$ dropped, it still holds that $X_t(k^{-1}A_*)=k^{-1}X_t(A_*)$ and $z_t(k\alpha_*)=kz_t(\alpha_*)$, but the $y_t$ in the expression for $\alpha_*|A_*$ is in fact $y_t - A y_{t-l}$, while it is unchanged in the expression for $A_*|\alpha_*$. This renders the solution unique.} Write $\overset{\longrightarrow}{A}$ for $vec\;(A)$. Note that $\sqrt{T}\tilde{\lambda} \rightarrow 0 $ by condition (ref). By condition (ref) and the CLT for ergodic and SS time series, \begin{align*} \sqrt{T} Q^{(1)}_{n,T}(\theta_0;Y) &= \sqrt{T}\begin{bmatrix} \frac{\partial Q_{n,T}(\theta;Y)}{\partial \alpha} \\ \frac{\partial Q_{n,T}(\theta;Y)}{\partial \overset{\longrightarrow}{A}} \\ \end{bmatrix} \Bigg|_{\theta=\theta_0} \\ &= -2 \begin{bmatrix} \frac{1}{n} \frac{1}{\sqrt{T}} \sum_{t=1}^T X_t'(y_t-X_t\alpha_*) \\ \frac{1}{n} \frac{1}{\sqrt{T}} \sum_{t=1}^T \overset{\longrightarrow}{ \left[ {(y_t - A_* z_t)z_t'} \right] } - \sqrt{T}\tilde{\lambda} \overset{\longrightarrow}{\left[ {A_* -B} \right]} \\ \end{bmatrix} \overset{d}{\rightarrow} N (0, M) \; , \end{align*} because \begin{align*} -\frac{2}{n} \begin{bmatrix} \mathbb{E} \left[ {X_t' (y_t - X_t \alpha_*)} \right] \\ \mathbb{E} \overset{\longrightarrow}{\left[ { (y_t - A_* z_t)z_t' } \right]} \end{bmatrix} = -\frac{2}{n} \begin{bmatrix} \mathbb{E} \left[ {X_t' u_t} \right] \\ \mathbb{E} \overset{\longrightarrow}{\left[ { u_t z_t' } \right]} \end{bmatrix} = 0 \end{align*} by conditions (ref) and (ref). Using conditions (ref), (ref) and (ref) as well as LIE, \begin{align*} M = \frac{4}{n^2} \begin{bmatrix} \mathbb{E} \left[ {X_t' u_t u_t' X_t} \right] & \cdot \\ \mathbb{E} \left[ { \overset{\longrightarrow}{\left[ { u_t z_t' } \right]} u_t' X_t} \right]} u_t' X_t} & \mathbb{E} \left[ { \overset{\longrightarrow}{\left[ { u_t z_t' } \right]} \overset{\longrightarrow}{\left[ { u_t z_t' } \right]}' } \right]u_t z_t' } \right]}' } \\ \end{bmatrix} = \frac{4}{n^2} \begin{bmatrix} \mathbb{E} \left[ {X_t' \Sigma X_t} \right] & \cdot \\ \mathbb{E} \left[ { z_t \otimes \Sigma X_t} \right] & \mathbb{E} \left[ { z_tz_t' } \right] \otimes \Sigma \\ \end{bmatrix} \; . \end{align*} Furthermore, using again the WLLN for ergodic and SS time series as well as conditions (ref) and (ref), \begin{align*} Q_{n,t}^{(2)}(\theta_0;Y) = \begin{bmatrix} \frac{\partial Q_{n,T}(\theta;Y)}{\partial \alpha \partial \alpha'} & \frac{\partial Q_{n,T}(\theta;Y)}{\partial \alpha \partial \overset{\longrightarrow}{A}'} \\ \frac{\partial Q_{n,T}(\theta;Y)}{\partial \overset{\longrightarrow}{A} \partial \alpha'} & \frac{\partial Q_{n,T}(\theta;Y)}{\partial \overset{\longrightarrow}{A} \partial \overset{\longrightarrow}{A}'} \\ \end{bmatrix} \overset{p}{\rightarrow} \begin{bmatrix} H_{11} & H_{21}' \\ H_{21} & H_{22} \\ \end{bmatrix} \equiv H \quad \forall \; \theta \overset{p}{\rightarrow} \theta_0 \; , \end{align*} with \begin{align*} \frac{\partial Q_{n,T}(\theta;Y)}{\partial \alpha \partial \alpha'} &= \frac{2}{nT}\sum_{t=1}^T X_t'X_t \overset{p}{\rightarrow} \frac{2}{n} \mathbb{E}[X_t'X_t] \equiv H_{11} \; , \\ \frac{\partial Q_{n,T}(\theta;Y)}{\partial \overset{\longrightarrow}{A} \partial \alpha'} &= - \frac{2}{nT}\sum_{t=1}^T \begin{bmatrix} (y_t - X \tilde{X}_t \alpha)\tilde{X}_{t,1\cdot} - z_{1t}A \tilde{X}_t \\ \vdots \\ (y_t - X \tilde{X}_t \alpha)\tilde{X}_{t,n\cdot} - z_{nt}A \tilde{X}_t \\ \end{bmatrix} \overset{p}{\rightarrow} \frac{2}{n} \begin{bmatrix} A \mathbb{E}[z_{1t}\tilde{X}_t] \\ \vdots\\ A \mathbb{E}[z_{nt}\tilde{X}_t] \\ \end{bmatrix} \equiv H_{21} \; , \\ \frac{\partial Q_{n,T}(\theta;Y)}{\partial \overset{\longrightarrow}{A} \partial \overset{\longrightarrow}{A}'} &= \frac{2}{nT}\sum_{t=1}^T \begin{bmatrix} z_t' \otimes z_{1t}I_n \\ \vdots \\ z_t' \otimes z_{nt}I_n \\ \end{bmatrix} \overset{p}{\rightarrow} \frac{2}{n} \begin{bmatrix} \mathbb{E}[ z_t' \otimes z_{1t}I_n ] \\ \vdots \\ \mathbb{E}[ z_t' \otimes z_{nt}I_n ] \\ \end{bmatrix} \equiv H_{22} \; .\footnotemark \end{align*} \footnotetext{To see this, note that $\overset{\longrightarrow}{\left[ { (y_t - A z_t)z_t' } \right]}$ consists of $n$ stacked vectors with the one in position $l$ given by $(y_t - A z_t)z_{lt} = (y_t - A \tilde{X}_t \alpha )\tilde{X}_{t,l\cdot}\alpha$, whose derivativate w.r.t $\alpha'$ is $(y_t - A \tilde{X}_t \alpha )\tilde{X}_{t,l\cdot} + z_{1t}A \tilde{X}_t$. Moreover, note that $\overset{\longrightarrow}{\left[ { A z_tz_t' } \right]}$ consists of vectors of the form $A z_t z_{lt} = [A_{1\cdot}z_t z_{lt}, ..., A_{n\cdot}z_t z_{lt}]'$ whose derivative w.r.t. $A$ gives $z_t' \otimes z_{lt}I_n$.} Consistency and asymptotic Normality also apply under a Lasso-penalty for $A$, although no analytical expression for the conditional estimator can be found in that case. Under $a_{ij} \geq 0$, only consistency goes through as $A_*$ is (likely) not interior. \section{Business Cycles by Lagged IOC} \subsection{Theory} \subsubsection*{RBC Model with Contemporaneous Input-Output Conversion} In this case, the amount of good $j$ purchased at $t$ and used in the production at $t$ coincide: $x_{ijt} = x_t^{ij} \equiv x^{ij} $. Because the environment is static, I drop time subscripts for notational simplicity. Firm $i$ solves the problem \begin{align*} \underset{l_i,\{x^{ij}\}_{j=1}^n }{max} \; p_i z_i l_i^{b_i} \prod_{j=1}^n \left( {x^{ij}} \right)^{a_{ij}} - w l_i - \sum_{j=1}^n p_j x^{ij} \; . \end{align*} The first-order conditions (FOCs) w.r.t. $l_i$ and $x^{ij}$ give \begin{align*} l_i = b_i \frac{p_i y_i}{w} \; , \quad x^{ij} = a_{ij} \frac{p_i y_i}{p_j} \; . \end{align*} The latter FOC provides an interpretation of $a_{ij} = (p_j x^{ij})/(p_i y_i)$ as the value of good $j$ purchased by sector $i$ divided by the value of sector $i$'s output. Plugging these expressions into the production function and taking logs yields \begin{align*} \tilde{p}_{i} = k^p_i + \sum_{j=1}^n a_{ij} \tilde{p}_{j}- \tilde{z}_i \quad \Leftrightarrow \quad \tilde{p} = k^{p} + A \tilde{p} - \tilde{z} \; , \end{align*} where $\tilde{p}_{i} = ln(p_i/w)$ and $\tilde{z}_i = ln(z_i)$. The constant $k^p_i = - \left[ { b_i ln(b_i) + \sum_{j=1}^n a_{ij}ln(a_{ij}) } \right]$ reflects differences in the reliance on different production factors across sectors $i$. The representative household's problem is \begin{align*} \underset{\{c_i\}_{i=1}^n }{max} \; \sum_{i=1}^n \gamma_i \; ln (c_{i}/\gamma_i) \; , \quad \text{s.t.} \; \sum_{i=1}^n p_i c_i = w \; . \end{align*} The FOC yields $c_i = \gamma_i \frac{w}{p_i}$. Hence, $\gamma_i$ is the share of good $i$ in households' expenditures. Market clearing for good $j$ requires $y_j = c_j + \sum_{i=1}^n x^{ij}$. Plugging in the expressions for $c_j$ and $x^{ij}$ and multiplying by $p_j/w$ yields the following expression for the Domar weight of sector $j$, $\lambda_j$: \begin{align*} \lambda_j \equiv \frac{y_j p_j}{w} = \gamma_j + \sum_{i=1}^n a_{ij} \lambda_i \quad \Leftrightarrow \quad \lambda = \gamma + A' \lambda \; . \end{align*} As a result, $\lambda = (I-A')^{-1} \gamma$. The Domar weight of sector $i$ reflects its importance as a supplier to relevant sectors in the economy, where relevance is defined by households' expenditure shares $\{\gamma_j\}_{j=1}^n$: $\lambda_i = \sum_{j=1}^n \gamma_j l_{ji}$. $l_{ji}$ is element $(j,i)$ of the Leontief-inverse $(I-A)^{-1}$. It sums up connections of all order from a sector $j$ to a sector $i$ and therefore shows how important sector $i$ is in $j$'s supply chain. Using the definition of $\lambda_i$, we have $\tilde{y} = \tilde{\lambda} - \tilde{p}$, where $\tilde{y} = ln(y)$ and $\tilde{\lambda} = ln\left( {\lambda} \right)$. Combining this with the equation for $\tilde{p}$ yields \begin{align*} \tilde{y} = k^y + A \tilde{y} + \tilde{z} \; , \end{align*} with $k^y = (I-A)\tilde{\lambda} - k^p$. For the sake of completeness, labor market clearing requires $\sum_{i=1}^n l_{i} = 1$ and gives $w = \sum_{i=1}^n b_i p_{i} y_{i}$. \subsubsection*{RBC Model with Single-Lag Input-Output Conversion} Assume good $j$ used in production at time $t$ is purchased at time $t-1$: $x_{ijt} = x^{ij}_{t-1}$. Firm $i$'s value function is then: \begin{align*} V_i\left( {\left\{ {x^{ij}_{t-1}} \right\}_{j=1}^n} \right) = \underset{l_{it},\{x^{ij}_t\}_{j=1}^n}{max} \; \Pi_{it} + \beta V_i\left( {\left\{ {x^{ij}_{t}} \right\}_{j=1}^n} \right) \; , \; \; \Pi_{it} = p_{it} z_{it} l_{it}^{b_i} \prod_{j=1}^n \left( { x_{t-1}^{ij} } \right)^{a_{ij}} - w_t l_{it} - \sum_{j=1}^n p_{jt} x^{ij}_{t} \; . \end{align*} The FOC w.r.t. $l_{it}$ and $x^{ij}_t$ give \begin{align*} l_{it} = b_i \frac{p_{it}y_{it}}{w_t} \; , \quad x^{ij}_t = \beta a_{ij} \frac{p_{i,t+1}y_{i,t+1}}{p_{jt}} \; . \end{align*} Plugging these expressions into the production function and taking logs gives \begin{align*} \tilde{p}_{it} = k^{p1}_{it} + \sum_{j=1}^n a_{ij} \tilde{p}_{j,t-1} - \tilde{z}_{it} \quad \Leftrightarrow \quad \tilde{p}_t = k^{p1}_t + A \tilde{p}_{t-1} - \tilde{z}_t \; , \end{align*} where again $\tilde{p}_{it} = ln\left( { \frac{p_{it}}{w_t} } \right) $ and $\tilde{z}_{it} = ln(z_{it})$. Also, $k^{p1}_{it} = k^{p1}_i - (1-b_i)\tilde{G}^w_{t,t-1}$ with $k^{p1}_i = - \left[ { b_i ln(b_i) + \sum_{j=1}^n a_{ij}ln(\beta a_{ij}) } \right]$ and $\tilde{G}^w_{t,t-1} = ln(G^w_{t,t-1})$, $G^w_{t,t-1} = w_t /w_{t-1}$. Provided that in every period $t$ households spend all their period $t$ income, $w_t$, we again get $c_{it} = \gamma_i w_t / p_{it}$. By market clearing of good $j$, then, \begin{align*} y_{jt} = c_{jt} + \sum_{i=1}^n x_{t}^{ij} = \gamma_j \frac{w_t}{p_{jt}} + \sum_{i=1}^n \beta a_{ij} \frac{p_{i,t+1}y_{i,t+1}}{p_{jt}} \; . \end{align*} Multiplying again by $p_{jt}$ and dividing by $w_t$ gives \begin{align*} \lambda_{jt} \equiv \frac{y_{jt}p_{jt}}{w_t} = \gamma_j + \sum_{i=1}^n \beta a_{ij} G^w_{t+1,t} \lambda_{i,t+1} \quad \Leftrightarrow \quad \lambda_t = \gamma + \beta G^w_{t+1,t} A'\lambda_{t+1} \; . \end{align*} Stacking this equation for all $i$ and solving forward shows that, compared to the static economy above, Domar weights are adjusted for future changes in the value of the num\'eraire: \begin{align*} \lambda_t = \sum_{h=0}^{\infty} \beta^h G^w_{t+h,t} (A')^h \gamma \; . \end{align*} For output $\tilde{y}_t = \tilde{y}_t - \tilde{p}_t$, we obtain \begin{align*} \tilde{y}_t = k_t^{y1} + A \tilde{y}_{t-1} + \tilde{z}_t \; , \end{align*} where $k^{y1}_t = \tilde\lambda_t - A \tilde\lambda_{t-1} - k^{p1}_t$ and again $\tilde{y}_t = ln(y_t)$ and $\tilde{\lambda}_t = ln(\lambda_t)$. In the steady state (SS) with $\tilde{z}_t = \tilde{z} \; \forall \; t$ we get \begin{align*} \lambda = (I-\beta A')^{-1} \gamma \; , \quad \tilde{p} = (I-A)^{-1} (k^{p1}- \tilde{z}) \; , \quad \tilde{y}_t = (I-A)^{-1} (k^{y1} + \tilde{z}) \; , \end{align*} where $k^{p1}$ contains elements $k^{p1}_{i}$, and $k^{y1} = (I-A)\tilde{\lambda} - k^{p1}$. Relative to the static economy above, the meaning of $a_{ij}$ changes slightly: in SS, it equals $$ a_{ij} = \beta^{-1} (p_j x^{ij})/(p_i y_i) \; . $$ Taking this into account, the SS value of $\lambda$ is unchanged. $\tilde{p}$ is slightly higher than in the static economy, as $k^{p1}_i = k^{p}_i - (1-b_i)ln(\beta) > k^p_i$. For the same reason, $\tilde{y}$ is slightly lower. These differences vanish as $\beta \rightarrow 1$. \subsubsection*{RBC Model with Multiple-Lags Input-Output Conversion} I start with the general CES case. Firm $i$'s problem is then \begin{align*} \underset{\substack{\{l_{it}, \{x^{ij}_t, x^{ij}_{t,t-1}, \\ x^{ij}_{t,t-2}\}_{j=1}^n \}_{t=0}^\infty}}{max} \; \sum_{t=0}^\infty \beta^t &\Pi_{it} \quad \text{s.t.} \quad x^{ij}_t = x^{ij}_{t+1,t} + x^{ij}_{t+2,t} \; \forall \; t, i, j \; , \\ &\Pi_{it} = p_{it}z_{it}l_{it}^{b_i} \prod_{j=1}^n \left[ { \alpha_1 \left( { x^{ij}_{t,t-1} } \right)^r + \alpha_2 \left( { x^{ij}_{t,t-2} } \right)^r } \right]^{\frac{a_{ij}}{r}} - w_t l_{it} - \sum_{j=1}^n p_{jt}x^{ij}_t \; . \end{align*} For each input $j$, the firm chooses how much to buy in period t, $x^{ij}_t$, and how to distribute the purchased amount for production over periods $t+1, t+2$. Abstracting from perfect substitutability allows me to ignore the boundary constraints $l_{it}, x^{ij}_{t+1,t}, x^{ij}_{t+2,t} \geq 0 \; \forall \; t, i, j$. Let $\check{x}_{t+h,t}^{ij}$ be the amount of good $j$ purchased at $t$ and not used up in production before period $t+h$. We obtain the following value function: \begin{align*} V_i \left( { \{\check{x}_{t,t-2}^{ij}, \check{x}_{t,t-1}^{ij}\}_{j=1}^n } \right) = \underset{\substack{l_{it}, \{x^{ij}_t, \\ x^{ij}_{t,t-1}, x^{ij}_{t,t-2}\}_j}}{max} &\Pi_{it} + \beta V_i \left( { \{\check{x}_{t+1,t-1}^{ij}, \check{x}_{t+1,t}^{ij}\}_{j=1}^n } \right) \\ \text{s.t.} \quad \quad \check{x}_{t,t-2}^{ij} &= x^{ij}_{t,t-2} \; , \\ \check{x}_{t+1,t}^{ij} &= x^{ij}_t \; ,\\ \check{x}_{t,t-1}^{ij} &= x^{ij}_{t,t-1} + x^{ij}_{t+1,t-1} \; . \end{align*} The problem can be written more compactly as \begin{align*} V_i \left( { \{x_{t,t-2}^{ij}, \check{x}_{t,t-1}^{ij}\}_{j=1}^n } \right) = \underset{\substack{l_{it}, \{x^{ij}_t, \\ x^{ij}_{t+1,t-1}\}_j}}{max}\; &\left[ p_{it}z_{it}l_{it}^{b_i} \prod_{j=1}^n \left[ { \alpha_1 \left( { \check{x}_{t,t-1}^{ij} - x^{ij}_{t+1,t-1} } \right)^r + \alpha_2 \left( { x^{ij}_{t,t-2} } \right)^r } \right]^{\frac{a_{ij}}{r}} \right. \\ & \quad \left. - w_t l_{it} - \sum_{j=1}^n p_{jt}x^{ij}_t \right] + \beta V_i \left( { \{x_{t+1,t-1}^{ij}, x^{ij}_t\}_{j=1}^n } \right) \end{align*} In each period $t$, and for each input $j$, a firm only chooses how how much to buy in period $t$ -- to be used for production in $t+1$ and $t+2$ -- and how much of the leftover amount purchased at $t-1$ to use at $t$ as opposed to leaving it for $t+1$. \paragraph*{Cobb-Douglas Aggregation of Inputs Purchased in Past} Under $r\rightarrow 0$, we have $x_{ijt} = \left( { x^{ij}_{t,t-1} } \right)^{\alpha_1} \left( { x^{ij}_{t,t-2} } \right)^{\alpha_2}$ and the optimality conditions yield \begin{align*} l_{it} = b_i \frac{p_{it}y_{it}}{w_t} \; , \quad x^{ij}_{t,t-1} = \beta \alpha_1 a_{ij} \frac{p_{it}y_{it}}{p_{j,t-1}} \; , \quad x^{ij}_{t,t-2} = \beta^2 \alpha_2 a_{ij} \frac{p_{it}y_{it}}{p_{j,t-2}} \; . \end{align*} Inserting these expressions into the production function, leads after a little algebra to \begin{align*} \tilde{p}_{it} = k^{p2}_t + \sum_{j=1}^n a_{ij} \left[ { \alpha_1 \tilde{p}_{j,t-1} + \alpha_2 \tilde{p}_{j,t-2} } \right] - \tilde{z}_t \quad \Leftrightarrow \quad \tilde{p}_t = k^{p2}_t + \alpha_1 A \tilde{p}_{t-1} + \alpha_2 A \tilde{p}_{t-2} - \tilde{z}_t \; , \end{align*} where $k^{p2}_{it} = k^{p2}_i - (1 - b_i)\left[ { \alpha_1 \tilde{G}^w_{t,t-1} + \alpha_2 \tilde{G}^w_{t,t-2} } \right] $ and $k^{p2}_i = - b_i ln(b_i) - \sum_{j=1}^n a_{ij}\left[ { \alpha_1 ln(\beta \alpha_1 a_{ij}) + \alpha_2 ln(\beta^2 \alpha_2 a_{ij}) } \right]$. The market clearing condition for good $j$ is now \begin{align*} y_{jt} = c_{jt} + \sum_{i=1}^n x^{ij}_t = c_{jt} + \sum_{i=1}^n x^{ij}_{t+1,t} + \sum_{i=1}^n x^{ij}_{t+2,t} \; . \end{align*} Plugging in the optimality conditions and multiplying by $p_{jt}/w_t$ to solve for $\lambda_{jt}$ gives \begin{align*} \lambda_{jt} = \gamma_j + \beta \alpha_1 G^w_{t,t-1} \sum_{i=1}^n a_{ij} \lambda_{i,t+1} + \beta^2 \alpha_2 G^w_{t,t-2} \sum_{i=1}^n a_{ij} \lambda_{i,t+2} \; . \end{align*} When stacked for all $i$, one could solve forward to obtain $\lambda_t$. For output we get then \begin{align*} \tilde{y}_t = k^{y2}_t + \alpha_1 A \tilde{y}_{t-1} + \alpha_2 A \tilde{y}_{t-2} + \tilde{z}_t \; , \end{align*} where $k^{y2}_t = \tilde{\lambda}_t - \alpha_1 A \tilde{\lambda}_{t-1} - \alpha_2 A \tilde{\lambda}_{t-2} - k^{p2}_t$. In the SS with $\tilde{z}_t = \tilde{z} \; \forall \; t$ we get \begin{align*} \lambda = (I-(\beta \alpha_1 + \beta^2 \alpha_2) A')^{-1} \gamma \; , \quad \tilde{p} = (I-A)^{-1} (k^{p2}-\tilde{z}) \; , \quad \tilde{y} = (I-A)^{-1}(k^{y2} + \tilde{z}) \; . \end{align*} In this economy, we have \begin{align*} a_{ij} = \left[ { \beta \alpha_1 + \beta^2 \alpha_2 } \right]^{-1} (p_j x^{ij})/(p_i y_i) \; .\footnotemark \end{align*} \footnotetext{Note that $x^{ij} \neq x_{ij}$. In terms of $x_{ij}$, we have $a_{ij} = x_{ij}p_j /(p_iy_i) (\beta\alpha_1)^{-\alpha_1}(\beta^2\alpha_2)^{-\alpha_2}$.} Again, $\tilde{\lambda}$ is unaltered relative to the static economy, while $\tilde{p}$ increases and $\tilde{y}$ decreases, owing to the increase in $k^{p2}_i = k^{p}_i - (1-b_i)ln\left( {(\beta\alpha_1)^{\alpha_1}(\beta^2\alpha_2)^{\alpha_2}} \right) > k^p_i$. Differences to the economy with one period-lagged input-output conversion vanish as $\alpha_1 \rightarrow 1$, and differences to the economy with contemporaneous input-output conversion vanish as $\beta \rightarrow 1$ and either $\alpha_1 \rightarrow 1$ or $\alpha_1 \rightarrow 0$. Decreasing $\alpha_1$ starting from $\alpha_1 =1$ decreases $k^{p2}_i$ and therefore increases prices and decreases output. \paragraph*{General CES-Aggregation of Inputs Purchased in Past} For general $r$, the optimality conditions yield \begin{align*} l_{it} = b_i \frac{y_{it} p_{it}}{w_t} \; , \quad x^{ij}_{t,t-1} = \left[ { a_{ij}\alpha_1 \beta \frac{y_{it}p_{it}}{p_{jt-1} x_{ijt}^r} } \right]^{\frac{1}{1-r}} \; , \quad x^{ij}_{t,t-2} = \left[ { a_{ij}\alpha_2 \beta^2 \frac{y_{it}p_{it}}{p_{jt-2} x_{ijt}^r } } \right]^{\frac{1}{1-r}} \; , \end{align*} Inserting the resulting expressions into the equation for $x_{ijt}$ gives \begin{align*} x_{ijt} = a_{ij} p_{it}y_{it} \left[ { n_1 p_{j,t-1}^{-\frac{r}{1-r}} + n_2 p_{j,t-2}^{-\frac{r}{1-r}} } \right]^{\frac{1-r}{r}} \; , \quad n_1 = \alpha_1 (\alpha_1 \beta)^{\frac{r}{1-r}} \; , \; n_2 = \alpha_2 (\alpha_2 \beta^2)^{\frac{r}{1-r}} \; . \end{align*} In turn, inserting this equation back for $x_{ijt}$ in the expressions above yields: \begin{align*} x^{ij}_{t,t-1} = a_{ij} \frac{p_{it}y_{it}}{p_{j,t-1}}\frac{n_1^{-r}}{n_1 + n_2 \left( {\frac{p_{j,t-1}}{p_{j,t-2}}} \right)^{\frac{r}{1-r}}} \; , \quad x^{ij}_{t,t-2} = a_{ij} \frac{p_{it}y_{it}}{p_{j,t-2}}\frac{n_2^{-r}}{n_1 \left( {\frac{p_{j,t-1}}{p_{j,t-2}}} \right)^{-\frac{r}{1-r}} + n_2 } \; . \end{align*} Inserting the expression for $x_{ijt}$ into the production function gives $$ 1 = z_{it} b_i^{b_i} p_{it}^* \prod_{j=1}^n a_{ij}^{a_{ij}}\left[ { n_1 \frac{G^w_{t,t-1}}{p^*_{j,t-1}}^{\frac{r}{1-r}} + n_2 \frac{G^w_{t,t-2}}{p^*_{j,t-2}}^{\frac{r}{1-r}} } \right]^{a_{ij}\frac{1-r}{r}} \; ,$$ where $p^*_{it} = p_{it}/w_t$. Linearizing around the SS characterized below leads to $$ \hat{p}^*_{it} = c^{p2}_{it} + \sum_{j=1}^n a_{ij} \left[ { \chi_1 \hat{p}^*_{j,t-1} + \chi_2 \hat{p}^*_{j,t-2} } \right] - \hat{z}_{it} \quad \Leftrightarrow \quad \hat{p}^*_t = c^{p2}_t + \chi_1 A \hat{p}^*_{t-1} + \chi_2 A \hat{p}^*_{t-2} - \hat{z}_t \; , $$ where $c^{p2}_{it} = - (1-b_i) \left[ { \chi_1 \hat{G}^w_{t,t-1} + \chi_2 \hat{G}^w_{t,t-2} } \right]$, $\chi_1 = n_1 / (n_1 + n_2)$ and $\chi_2 = 1-\chi_1$. Inserting the optimal choices of $c_{jt}$, $x^{ij}_{t+1,t}$ and $x^{ij}_{t+2,t}$ into the market clearing condition for good $j$ yields $$ \lambda_{jt} = \gamma_j + \sum_{i=1}^n a_{ij} \frac{n_1^{-r}}{n_1 + n_2 \left( {\frac{p_{i,t}}{p_{i,t-1}}} \right)^{\frac{r}{1-r}} }G^w_{t+1,t} \lambda_{i,t+1} + \sum_{i=1}^n a_{ij} \frac{n_2^{-r}}{n_1 \left( {\frac{p_{i,t}}{p_{i,t-1}}} \right)^{-\frac{r}{1-r}} + n_2 }G^w_{t+2,t} \lambda_{i,t+2} \; . $$ Using the relation $\hat{y}_t = \hat{\lambda}_t - \hat{p}^*_t$, we get $$ \hat{y}_t = c^{y2}_t + \chi_1 A \hat{y}_{t-1} + \chi_2 A \hat{y}_{t-2} + \hat{z}_t \; , $$ where $c^{y2}_t = c^{p2}_t + \hat{\lambda}_t - \chi_1 A \hat{\lambda}_{t-1} - \chi_2 A \hat{\lambda}_{t-2}$. In SS, \begin{align*} \lambda = \left( { I - \frac{n_1^{-r} + n_2^{-r}}{n_1 + n_2} A' } \right)^{-1} \gamma \; , \quad \tilde{p} = (I-A)^{-1} (k^{p3} - \tilde{z}) \; , \quad \tilde{y} = (I-A)^{-1} (k^{y3}+ \tilde{z}) \; , \end{align*} where $k^{p3}$ contains elements $k^{p3}_i = - b_i ln(b_i) - \sum_{j=1}^n a_{ij} ln(a_{ij}) - (1-b_i) \frac{1-r}{r}ln(n_1 + n_2)$ and $k^{y3} = (I-A)\tilde{\lambda} - k^{p3}$. Also, \begin{align*} a_{ij} = \left[ { \frac{n_1^{-r} + n_2^{-r}}{n_1 + n_2} } \right]^{-1} (p_j x^{ij})/(p_i y_i) \; . \end{align*} \subsection{Data} ... \subsection{Estimation} \subsubsection*{Likelihood Evaluation} Under $q=1$, the model with contemporaneous IOC ((ref)) yields the following state space form: \begin{align*} s_t = \Phi_0 + \Phi_1 s_{t-1} + v_t \; , \quad \Delta y_t = \Psi s_t \; , \end{align*} where $s_t = (\Delta y_t', e_t', e^a_t)'$ and $v_t = (0, \varepsilon_t', \varepsilon^a_t)' \sim N(0,\Sigma_v)$ are $(2n+1) \times 1$, $\Psi = \begin{bmatrix} I_n, 0 \end{bmatrix}$, and \begin{align*} \Phi_0 = \begin{bmatrix} L\gamma \\ 0 \\ 0 \end{bmatrix} \; , \quad \Phi_1 = \begin{bmatrix} 0 & L & L \lambda \\ 0 & P & 0 \\ 0 & 0 & \rho_a \end{bmatrix} \; , \quad \Sigma_v = \begin{bmatrix} 0 & 0 & 0 \\ 0 & \Sigma & 0 \\ 0 & 0 & \sigma^2_a \end{bmatrix} \; , \end{align*} and we further define $L = (I-A)^{-1}$ to be the Leontief-inverse and $P$ and $\Sigma$ to be diagonal matrices containing $(\rho_1, ..., \rho_n)$ and $(\sigma^2_1, ..., \sigma^2_n)$, respectively. To write the model with lagged IOC ((ref)) in state space form, let $\tilde{p} = \max\{p,q\}$ and $\alpha_l = 0$ for $l=(p+1):\tilde{p}$. Define the $(n\tilde{p}+n+1)\times 1$ vectors $s_\tau = (\Delta \tilde{y}_\tau', ..., \Delta \tilde{y}_{\tau-\tilde{p}+1}',e_\tau', e^a_\tau)'$ and $v_\tau = (0, ..., 0, \varepsilon_\tau', \varepsilon^a_\tau)'$. We have the analogous state space form as above, with \begin{align*} \Phi_0 = \begin{bmatrix} \gamma \\ 0 \\ \vdots \\ 0 \end{bmatrix} \; , \quad \Phi_1 = \begin{bmatrix} \alpha_1 A & \dots & \alpha_{\tilde{p}-1}A & \alpha_{\tilde{p}}A & I & \lambda \\ & I_{np-n} & & 0 & 0 & 0 \\ & 0 & & 0 & P & 0 \\ & 0 & & 0 & 0 & \rho_a \end{bmatrix} \; , \quad \Sigma_v = \begin{bmatrix} 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \\ 0 & 0 & \Sigma & 0 \\ 0 & 0 & 0 & \sigma^2_a \end{bmatrix} \; . \end{align*} Under $q=1$, we observe $\Delta y_t = \Delta \tilde{y}_\tau$, meaning that $\Psi = [I_n, 0]$. Under $q>1$, we have observe $\Delta y_t = \sum_{l=0}^{q-1} \Delta \tilde{y}_{\tau-l}$ -- i.e. $\Psi = [I_n, ..., I_n, 0]$ -- only for periods $t = \tau/q \in \mathbb{N}$ (see (ref)). \subsubsection*{Prior-Construction & -Drawing} The Uniform prior for $\alpha \in [0,1]^{p-1} \cap \{\alpha: \sum_{l=1}^{p-1} \alpha_l \leq 1\}$ can be broken up as follows:\todo{derivation: P009diary3,p.39} \begin{align*} p(\alpha_1,...,\alpha_{p-1}) = p(\alpha_1|\alpha_2,...,\alpha_{p-1}) p(\alpha_2|\alpha_3,...,\alpha_{p-1}) ... p(\alpha_{p-2}|\alpha_{p-1}) p(\alpha_{p-1}) \; , \end{align*} where for $l=1:p-2$, \begin{align*} p(\alpha_l|\alpha_{l+1},...,\alpha_{p-1}) = \begin{cases} l \frac{ \left( { 1- \sum_{m=l}^{p-1} \alpha_m } \right)^{l-1} }{ \left( { 1- \sum_{m=l+1}^{p-1} \alpha_m } \right)^{l-1} } \quad &\text{if} \; \alpha_l \in \left[ { 0, 1-\sum_{m=l+1}^{p-1} \alpha_m } \right] \\ 0 \quad &\text{otherwise} \end{cases} \; , \end{align*} and \begin{align*} p(\alpha_{p-1}) = \begin{cases} (p-1) \left( { 1 -\alpha_{p-1}} \right)^{p-2} \quad &\text{if} \; \alpha_{p-1} \in \left[ { 0, 1 } \right] \\ 0 \quad &\text{otherwise} \end{cases} \; . \end{align*} To draw from $p(\alpha_1,...,\alpha_{p-1})$, I draw $\alpha_{p-1}$ from its marginal distribution and iteratively draw $\alpha_{p-2}, ..., \alpha_1$ from the conditionals, using the inverse-cdf method in each step: to draw $y_i \sim f(y)$, I draw $x_i \sim \mathcal{U}(0,1)$ and find $y_i$ so that $\int_{-\infty}^{y_i} f(y)dy=x_i$. In the present case, this yields \begin{align*} \alpha_l|(\alpha_{l+1}, ..., \alpha_{p-1}) = \left( { 1-\sum_{m=l+1}^{p-1}\alpha_m } \right)\left[ { 1- (1-x_l)^{1/l} } \right] \; , \quad x_l \sim \mathcal{U}(0,1) \; , \end{align*} for $l=1:(p-2)$, and $\alpha_{p-1} = 1-(1-x_{p-1})^{1/(p-1)}$, $x_{p-1} \sim \mathcal{U}(0,1)$. For the parameters $(\sigma^2_a,\sigma^{2\prime})' \in \mathbb{R}_{++}^{n+1}$, an upper bound has to be chosen so as to specify a proper Uniform prior distribution, since draws from it are needed to initialize the SMC sampler. A high upper bound is desirable so as to avoid domain restrictions in areas with non-trivial likelihood values. However, for efficient sampling, lower values are preferred. I choose a low upper bound to initialize the sampler, but allow the algorithm to disrespect it in search for parameter-values associated with high likelihood values and therefore high posterior mass. Ex-post, I redefine the upper bound as the largest posterior draw among $(\sigma^2_a,\sigma^{2\prime})'$ across all models. The resulting MDDs could be re-scaled to take this into account, but this is not necessary, as all models' MDD is “{off}" by the same proportionality constant, which means that the ranking is unaffected.\footnote{ Let $s = (\sigma^2_a,\sigma^{2\prime})' \in [0,\bar{s}]^{n+1}$. We get the MDD $$ p(Y) = \int p(Y|\theta_{-s},s)p(\theta_{-s})p(s)d(\theta_{-s},s) = \bar{s}^{-(n+1)} \int p(Y|\theta_{-s},s)p(\theta_{-s})d(\theta_{-s},s) \; . $$ If the upper bound is ex-post rescaled to $s^*$, the MDD needs to be corrected by multiplying by $(\bar{s}/s^*)^{n+1}$. The analogous holds with heterogeneous upper bounds. } I set $\bar{\sigma}^2_i = 0.5\mathbb{V}[\Delta \tilde{y}_{it}]$ and $\bar{\sigma}^2_a = \max_i \bar{\sigma}^2_i$. \subsubsection*{SMC Algorithm & Parameter Transformation} I use the adaptive tempering variant of the SMC algorithm (see CaiEtAl2021), which ensures a precise estimation of the posterior even as the distance between the prior and posterior distributions is difficult to assess. For efficient sampling even under tight domain restrictions, I reparameterize the parameters in the mutation step of the SMC algorithm as follows. Define the function $g$ s.t. $\check{\theta} = g^{-1}(\theta)$ is generated by transforming $\alpha_l$ into $\ln \alpha_l/\alpha_{p}$ for $l=1:(p-1)$, $\sigma_i^2$ into $\ln \sigma^2_i$ for $i=1:n$, and $\rho_i$ into $\ln \rho_i /(1-\rho_i)$ for $i=1:n$ and $i=a$. These are one-to-one mappings and ensure that $\check\theta \in \mathbb{R}$. As a result, no draws in the mutation step are rejected because of domain violations. To account for this reparameterization, the acceptance probabilities in the mutation of particle $i$ in iteration $n$ are adjusted as follows: \begin{algo}[Particle Mutation in SMC Algorithm] \\[-20pt] \begin{enumerate} • Given particle $\theta^{i}_{n-1}$, set $\theta^{i,0}_n = \theta^{i}_{n-1}$. • For $m=1:N_{MH}$: \begin{itemize} • Compute $\check{\theta}^{i,m-1}_n = g^{-1}(\theta^{i,m-1}_n)$ and draw \begin{align*} \check{v} | \theta^{i,m-1}_n \sim \check{q}(\check{v} | \theta^{i,m-1}_n) = N(\check{\theta}^{i,m-1}_n,c_n^2 \Sigma_n) = N(g^{-1}(\theta^{i,m-1}_n), c_n^2 \Sigma_n) \; . \end{align*} • Set \begin{align*} \theta^{i,m}_n = \begin{cases} v = g(\check{v}) \; \quad &\text{w.p.}\quad \alpha(v|\theta^{i,m-1}_n) \\ \theta^{i,m-1}_n \; \quad &\text{otherwise} \end{cases} \; , \end{align*} where \begin{align*} \alpha(v|\theta^{i,m-1}_n) &= min \; \left\{ { 1, \frac{p(Y|v)p(v) / q(v|\theta^{i,m-1}_n)}{p(Y|\theta^{i,m-1}_n)p(\theta^{i,m-1}_n) / q(\theta^{i,m-1}_n|v)} } \right\} \; . \end{align*} The densities $q(v|\theta^{i,m-1}_n)$ and $q(\theta^{i,m-1}_n|v)$ are obtained using analogous density transformations starting from $q(\check{v}|\theta^{i,m-1}_n)$ and $q(\check{\theta}^{i,m-1}_n|v)$, respectively; e.g. \begin{align*} q(v|\theta^{i,m-1}_n) = \check{q}(g^{-1}(v)|\theta^{i,m-1}_n)|J(v)| \; . \end{align*} where $J(\theta)$ is the Jacobian matrix. \end{itemize} • Set $\theta^{i}_n = \theta^{i,N_{MH}}_n$. \end{enumerate} \end{algo} Note that because $\check{q}(g^{-1}(v)|\theta^{i,m-1}_n) = \check{q}(g^{-1}(\theta^{i,m-1}_n)|v)$ is symmetric, we obtain \begin{align*} \alpha(v|\theta^{i,m-1}_n) = min \; \left\{ { 1, \frac{p(Y|v)p(v) }{p(Y|\theta^{i,m-1}_n)p(\theta^{i,m-1}_n)}\frac{|J(\theta^{i,m-1}_n)|}{|J(v)|} } \right\} \; . \end{align*} The Jacobian matrix $J(\theta) = \partial \check{\theta}/\partial\theta'$ is diagonal and leads to $$ |J(\theta)| = \left\{ {\prod_{i=1}^n \rho_i (1-\rho_i)\sigma_i^2} \right\}^{-1} \left\{ {\prod_{l=1}^{p-1} \alpha_l} \right\}^{-1} \left\{ { \rho_a (1-\rho_a)} \right\}^{-1} \; . $$ \subsection{Results} \section{Dimensionality-Reduction by Parsimonious NVAR} \subsection{Hyperparameter Selection} \paragraph*{Marginal Posterior Mode of $\lambda_a$} Under a Normal prior for $A$ and a uniform hyperprior for $\lambda_a$, we obtain \begin{align*} p(\lambda_a | A, B) &\propto p(A|B, \lambda_a) \\ &\propto \lambda_a^{n^2/2} exp \left\{ { -\frac{1}{2}\lambda_a tr\left[ {(A-B)'(A-B)} \right] } \right\} \; , \end{align*} whereby $tr\left[ {(A-B)'(A-B)} \right] = \sum_{i,j=1}^n (a_{ij}-b_{ij})^2$. This shows that \begin{align*} \lambda_a \mid(A, B) \sim G\left( { \frac{n^2}{2}+1 \; , \; \frac{1}{2} tr\left[ {(A-B)'(A-B)} \right] } \right) \; . \end{align*} Under an exponential prior for $A$ and a uniform hyperprior for $\lambda_a$, we obtain \begin{align*} p(\lambda_a | A) &\propto p(A|\lambda_a) \\ &\propto \lambda_a^{n^2} exp \left\{ { - \lambda_a \iota'A \iota} \right\} \; , \end{align*} which shows that \begin{align*} \lambda_a \mid A \sim G\left( { n^2+1 \; , \; \iota'A \iota } \right) \; . \end{align*} \paragraph*{Conditional MDD under NVAR-R} By Bayes' theorem, $$ p(A|Y,\lambda_a,B,\cdot) = \frac{p(Y|A,\cdot)p(A|\lambda_a,B)p(\lambda_a)}{p(Y|\lambda_a,\cdot)} \; , $$ where $\cdot$ stands for the remaining parameters affecting the likelihood, $(\alpha,\Sigma)$. The conditional MDD $p(Y|\lambda_a,\cdot)$ is obtained by rearranging this formula, inserting the known expressions for the densities $p(Y|A,\cdot)$, $p(A|\lambda_a,B)$, $p(\lambda_a)=c$ and $p(A|Y,\lambda_a,B,\cdot)$, and cancelling all terms involving $A$: \begin{align*} p(Y|\lambda_a,\cdot) &= \frac{p(Y|A,\cdot)p(A|\lambda_a,B)p(\lambda_a)}{p(A|Y,\lambda_a,B,\cdot)} \\ &= c \frac{(2\pi)^{-\frac{nT}{2}}|\Sigma|^{-\frac{T}{2}} exp\left\{ { -\frac{1}{2}\sum_{t=1}^T u_t'\Sigma^{-1}u_t} \right\} (2\pi)^{-\frac{n^2}{2}} \lambda_a^{\frac{n^2}{2}} exp \left\{ { -\frac{1}{2}\lambda_a \sum_{i,j=1}^n (a_{ij}-b_{ij})^2 } \right\} }{ (2\pi)^{-\frac{n^2}{2}} |\bar{V}_A|^{-\frac{n}{2}}|\bar{U}_A|^{-\frac{n}{2}} exp\left\{ { -\frac{1}{2}tr\left[ { \bar{U}_A^{-1}(A-\bar{A}')'\bar{V}_A^{-1}(A-\bar{A}') } \right] } \right\} } \\ &= c (2\pi)^{-\frac{nT}{2}} |\Sigma|^{-\frac{T}{2}} |\bar{V}_A|^{\frac{n}{2}}|\bar{U}_A|^{\frac{n}{2}} \lambda_a^{\frac{n^2}{2}} exp\left\{ { -\frac{1}{2}\left[ { \sum_{t=1}^T y_t'\Sigma^{-1}y_t + \lambda_a \sum_{i,j=1}^n b_{ij}^2 - tr\left[ { \bar{U}_A^{-1}\bar{A}\bar{V}_A^{-1}\bar{A}' } \right] } \right]} \right] } } \right\} \; . \end{align*} \subsection{NVAR-R: Network-Construction Using Multiple Link-Types} Parameterizing $B$ by $b_{ij} = w_{ij}^{b\prime}\beta_b$ with a hyperprior $\beta_b \sim N(0,\lambda_b^{-1}I)$, we get \begin{align*} p(\beta_b | A, \lambda_a, \lambda_b) &\propto p(A|\beta_b, \lambda_a ) p(\beta_b|\lambda_b) \\ &\propto exp \left\{ { -\frac{1}{2}\lambda_a \left( { vec(A) - W^b\beta_b } \right)' \left( { vec(A) - W^b\beta_b } \right) } \right\} exp \left\{ { - \frac{1}{2}\lambda_b \beta_b ' \beta_b } \right\} \\ &\propto exp \left\{ { - \frac{1}{2} \left[ { \beta_b ' \left( { \lambda_a W^{b\prime} W^b + \lambda_b I } \right)\beta_b - 2 \beta_b' \left( { \lambda_a W^{b\prime}vec(A) } \right)} \right] } \right\} \; , \end{align*} where $W^b$ is s.t. $W^b\beta_b = vec(B)$. This shows that \begin{align*} \beta_b \mid (A, \lambda_a, \lambda_b) \sim N \left( { \bar{\beta}_b, \bar{V}_{\beta_b} } \right) \; , \quad \bar{V}_{\beta_b} = \left[ { \lambda_a W^{b\prime} W^b + \lambda_b I } \right]^{-1} \; , \quad \bar{\beta}_b = \bar{V}_{\beta_b}\left[ { \lambda_a W^{b\prime} vec(A) } \right] \; . \end{align*} Further specifying a hyperprior $p(\lambda_b)\propto c$ for $\lambda_b$ yields \begin{align*} p(\lambda_b | \beta_b) &\propto p(\beta_b | \lambda_b) \\ &\propto \lambda_b^{k_b/2} exp \left\{ { -\frac{1}{2}\lambda_b \beta_b'\beta_b } \right\} \; , \end{align*} where $k_b = dim(\beta_b)$. This implies \begin{align*} \lambda_b \mid \beta_b \sim G\left( { \frac{k_b}{2}+1 \; , \; \frac{1}{2} \beta_b' \beta_b } \right) \; . \end{align*} There are two special cases. Under $\lambda_a =0$, we use a Uniform prior for $A$, and $\beta_b$ and $\lambda_b$ become irrelevant to the estimation problem. As $\lambda_a \rightarrow \infty$, we effectively reparameterize $A$ as $B$, which, if the elements of $B$ are parameterized as $b_{ij} = w_{ij}^{b\prime}\beta_b$, means that the above posterior for $\beta_b$ changes to \begin{align*} \beta_b \mid (Y, \Sigma, \lambda_b) \sim N \left( { \bar{\beta}_b, \bar{V}_{\beta_b} } \right) \; , \end{align*} with $$ \bar{V}_{\beta_b} = \left[ {\sum_{t=1}^T X_t^{b \prime}\Sigma^{-1}X^b_t + \lambda_b I_{k_b} } \right]^{-1} \; , \quad \bar{\beta}_b = \bar{V}_{\beta_b} \left[ { \sum_{t=1}^T X_t^{b \prime} \Sigma^{-1} y_t } \right] \; ,$$ where $X^b_t = [B_1 z_t, B_2 z_t, ..., B_{k_b}z_t]$ and $B_1, ..., B_{k_b}$ are $n\times n$ matrices containing the different link-types in $W^b$, i.e. $w_{ij}^b = (B_{1,ij},..., B_{k_b,ij})'$ and $A=B=B_1\beta_{b,1} + ... + B_{k_b} \beta_{b,k_b}$. \subsection{Factor Model Estimation} Consider the dynamic factor model \begin{align*} y_t &= \Lambda f_t + u_t \; , &\;& u_t \sim N(0,\Sigma_u) \; , \\ f_t &= \Phi_1 f_{t-1} + ... + \Phi_p f_{t-p} + \eta_t \; , &\;& \eta_t \sim N(0,\Sigma_\eta) \; , \end{align*} where $y_t$ is $n$-dimensional and $f_t$ is $r$-dimensional. The normalization of GewekeZhou1996 sets $\Sigma_u = I$, $\Sigma_\eta=I$ and takes $\Lambda_{1:r,\cdot}$ to be lower-triangular with positive diagonal elements. The VAR($p$) for $f_t$ can also be written as $$ f_t' = x_t^{F\prime}\Phi + \eta_t' \; , \quad \text{or} \quad F = X^F \Phi + N \; , $$ where $x^F_t = (f_{t-1}',...,f_{t-p}')'$ is $rp \times 1$, $\Phi = \left[ {\Phi_1, ..., \Phi_p } \right]'$ is $rp \times r$, and the matrices $F$, $X^F$ and $N$ stack $f_t'$, $x_t^{F\prime}$ and $\eta_t'$ along rows, respectively. The factor model permits the state space representation \begin{align*} y_t &= [\Lambda, 0, ..., 0] s_t + u_t \; , &\;& u_t \sim N(0,I) \; , \\ s_t &= R s_{t-1} + v_t \; , &\;& v_t \sim N(0,\Sigma_v) \; , \end{align*} where $s_t = (f_t',f_{t-1}', ..., f_{t-p}')'$ and $v_t = (\eta_t',0, ..., 0)'$ are $rp \times 1$, and \begin{align*} R = \begin{bmatrix} \multicolumn{2}{c}{\Phi_1, \Phi_2, ..., \Phi_p} \\ I_{rp-r \times rp-r} & 0_{rp-r \times r} \end{bmatrix} \quad \text{and} \quad \Sigma_v = \begin{bmatrix} I & 0_{r \times rp-r} \\ \multicolumn{2}{c}{0_{rp-r \times rp}} \end{bmatrix} \end{align*} are $rp \times rp$. The aim is to find the joint posterior $p(\Phi,\{\lambda^{ii}\}_{i=1}^r,\{\lambda^{i}\}_{i=2}^n|Y)$, where $Y = Y_{1:T} = \{y_1, ..., y_T\}$, $\lambda^{ii}$ is the $i$th diagonal element of $\Lambda_{1:r,\cdot}$ and $\lambda^i$ is the vector containing the remaining free parameters in $\Lambda_{i,\cdot}$, the $i$th row of $\Lambda$. It is achieved by treating $S = S_{1:T}= \{s_1, ..., s_T\}$ as parameters and obtaining first the posterior $p(\Lambda, \Phi, S | Y)$. A draw from $p( S | Y, \Lambda, \Phi)$ is obtained using the CarterKohn1994 Simulation Smoother, while under Uniform priors for $\Phi$ and $\Lambda$, we can analytically derive the conditional posteriors $p(\Phi| Y, S)$, $\left\{ { p(\lambda^{ii} | Y, S,\lambda^{i})} \right\}_{i=1}^r$ and $\{p(\lambda^{i}| Y, S,\lambda^{ii})\}_{i=2}^n$. \paragraph*{Drawing from $p(\Lambda | Y, S)$} Given that $u_t \sim N(0,I)$, the measurement equation consists of a set of independent regressions $$ y^i_t = f_t^{i\prime}\lambda^i + u_{it} \; , \quad u_{it} \sim N(0,1) \; , \quad i=1:n \; , $$ where $f^i_t$ is the vector of factors corresponding to $\lambda^i$, and $$ y^i_t = \begin{cases} y_{it} - \lambda^{ii} f_{it} \quad &\text{for} \; i \leq r \\ y_{it} \quad &\text{for} \; i > r \end{cases} \; . $$ Under $p(\lambda^i) \propto c$, we get $$ \lambda^i | Y, S, \lambda^{ii} \sim N( \hat{\lambda}^i, (F^{i\prime}F^i)^{-1}) \; , \quad \hat{\lambda}^i = (F^{i\prime}F^i)^{-1} (F^{i\prime}Y^i) \; , $$ where $F^i$ and $Y^i$ stack $f^i_t$ and $y^i_t$ along rows, respectively. Analogously, $p(\lambda^{ii}) \propto \mathbf{1}\left\{ { \lambda^{ii}>0 } \right\}$ yields $$ \lambda^{ii} | Y, S, \lambda^{i} \sim N( \hat{\lambda}^{ii}, (F^{ii\prime}F^{ii})^{-1}) \; , \quad \hat{\lambda}^{ii} = (F^{ii\prime}F^{ii})^{-1} (F^{ii\prime}Y^{ii}) \; , \quad \text{truncated to } \mathbb{R}_{++}$$ where $F^{ii}$ and $Y^{ii}$ stack $f_{it}$ and $y_{it}-f_t^{i\prime}\lambda^i$ along rows, respectively. \paragraph*{Drawing from $p(\Phi | Y, S)$} Given that $\Sigma_\eta=I$ is diagonal, the transition equation is also a set of independent regressions, $$ f_{it} = x_t^{F\prime}\Phi_{\cdot,i} + \eta_{it} \; , \quad \eta_{it} \sim N(0,1) \; , \quad i=1:r \; .$$ Under $p(\Phi_{\cdot,i}) \propto c$, we get $$ \Phi_{\cdot,i} | Y, S \sim N \left( { \hat{\Phi}_{\cdot,i}, (X^{F\prime}X^F)^{-1} } \right) \; , \quad \hat{\Phi}_{\cdot,i} = (X^{F\prime}X^F)^{-1}X^{F\prime} F_{\cdot,i} \; . $$ \paragraph*{Drawing from $p( S | Y, \Lambda, \Phi)$} The usual formulas for the Kalman filter and CarterKohn1994 simulation smoother simplify for the particular state space model above. Given an $rp \times 1$ vector $x$, let $\left[ {x} \right]_1 = x_{1:r}$ contain the first $r$ elements, $\left[ {x} \right]_{-1}$ all but the first $r$ elements, and $\left[ {x} \right]_{-p}$ all but the last $r$ elements. Similarly, given an $rp \times rp$ matrix $X$, let $$ X = \begin{bmatrix} \left[ {X} \right]_{1,1} & \left[ {X} \right]_{1,-1} \\ \left[ {X} \right]_{-1,1} & \left[ {X} \right]_{-1,-1} \end{bmatrix} = \begin{bmatrix} \left[ {X} \right]_{-p,-p} & \left[ {X} \right]_{-p,p} \\ \left[ {X} \right]_{p,-p} & \left[ {X} \right]_{p,p} \end{bmatrix} = \begin{bmatrix} \left[ {X} \right]_{-p,\cdot} \\ \left[ {X} \right]_{p,\cdot} \end{bmatrix} = \begin{bmatrix} \left[ {X} \right]_{\cdot,-p} & \left[ {X} \right]_{\cdot,p} \end{bmatrix} \; , $$ where $\left[ {X} \right]_{1,1}$ and $\left[ {X} \right]_{p,p}$ are $r\times r$, $\left[ {X} \right]_{p,\cdot}$ is $r \times (rp-p)$ and $\left[ {X} \right]_{\cdot,p}$ is $(rp-p)\times r$. \begin{algo}[Kalman Filter for Factor Model] \\[-20pt] \begin{enumerate} • Initialize $s_{0|0} = 0$ and $P_{0|0} = \sum_{l=0}^h R^l \Sigma_v R^{l\prime}$ for $h = 10$, say. • For $t=1:T$, given $s_{t-1|t-1}$ and $P_{t-1|t-1}$, \begin{enumerate} • Forecast $s_t$:) compute $s_{t|t-1}$ and $P_{t|t-1}$ as \begin{align*} \bullet \quad &\left[ {s_{t|t-1}} \right]_{1} = R_{1,\cdot} s_{t-1|t-1} \quad , \quad &&\left[ {s_{t|t-1}} \right]_{-1} = \left[ {s_{t-1|t-1}} \right]_{-p} \; ,\\[3pt] \bullet \quad &\left[ {P_{t|t-1}} \right]_{11} = R_{1,\cdot} P_{t-1|t-1} R_{1,\cdot}' + \Sigma_\eta \quad , \quad &&\left[ {P_{t|t-1}} \right]_{1,-1} = \left[ {P_{t|t-1}} \right]_{-1,1}' \; ,\\ &\left[ {P_{t|t-1}} \right]_{-1,1} = \left[ {P_{t-1|t-1}} \right]_{-p,\cdot} R_{1,\cdot}' \quad , \quad &&\left[ {P_{t|t-1}} \right]_{-1,-1} = \left[ {P_{t-1|t-1}} \right]_{-p,-p} \; . \end{align*} • Forecast $y_t$:) compute $y_{t|t-1}$ and $F_{t|t-1}$ as \begin{align*} \bullet \quad &y_{t|t-1} = \Lambda \left[ {s_{t|t-1}} \right]_{1} \; ,\\[3pt] \bullet \quad &F_{t|t-1} = \Lambda \left[ {P_{t|t-1}} \right]_{11} \Lambda' + I \; . \end{align*} • Update the forecast for $s_t$ given observation $y_t$:) compute $s_{t|t}$ and $P_{t|t}$ as \begin{align*} \bullet \quad &s_{t|t} = s_{t|t-1} + \left[ {P_{t|t-1}} \right]_{\cdot,1}\Lambda' F_{t|t-1}^{-1} (y_t - y_{t|t-1}) \; ,\\[3pt] \bullet \quad &P_{t|t} = P_{t|t-1} - \left[ {P_{t|t-1}} \right]_{\cdot,1}\Lambda' F_{t|t-1}^{-1} \Lambda \left[ {P_{t|t-1}} \right]_{1,\cdot} \; . \end{align*} \end{enumerate} \end{enumerate} \end{algo} Thereby, $R_{1,\cdot} = [\Phi_1, \Phi_2, ..., \Phi_p]$, and $\Lambda \left[ {P_{t|t-1}} \right]_{1,\cdot} = \left( { \left[ {P_{t|t-1}} \right]_{\cdot,1}\Lambda' } \right)'$. \begin{algo}[CarterKohn1994 Simulation Smoother for Factor Model] \\[-20pt] \begin{enumerate} • Run the Kalman filter to get $\{s_{t|t},s_{t|t-1},P_{t|t},P_{t|t-1}\}_{t=1}^T$. • Draw $\left[ {s_T^m} \right]_1$ from $ N\left( {\left[ {s_{T|T}} \right]_1, \left[ {P_{T|T}} \right]_{11} } \right)$. • For $t=T-1, ..., 0$, given draw $\left[ {s_{t+1}^m} \right]_1$ from $ N\left( {\left[ {s_{t+1|t+2}} \right]_1 , \left[ {P_{t+1|t+2}} \right]_{11} } \right)$, draw $\left[ {s_{t}^m} \right]_1$ from $ N\left( { \left[ {s_{t|t+1}} \right]_1,\left[ {P_{t|t+1}} \right]_{11} } \right)$ with \begin{align*} \bullet \quad &s_{t|t+1} = s_{t|t} + P_{t|t}R_{1\cdot}' \left( {R_{1\cdot}P_{t|t}R_{1\cdot}' + \Sigma} \right)^{-1}(\left[ {s_{t+1}^m} \right]_1 - \left[ {s_{t+1|t}} \right]_1) \; ,\\[3pt] \bullet \quad &P_{t|t+1} = P_{t|t} - P_{t|t}R_{1\cdot}' \left( {R_{1\cdot}P_{t|t}R_{1\cdot}' + \Sigma} \right)^{-1} R_{1\cdot} P_{t|t} \; . \end{align*} \end{enumerate} \end{algo} Analogous comments apply as for (ref). \subsection{Application Details} \begin{figure} \begin{center} \subcaption*{Forecasts At Posterior Mode} \begin{subfigure}[b]{0.24\textwidth} \subcaption*{$p=1$} \end{subfigure} \begin{subfigure}[b]{0.24\textwidth} \subcaption*{$p=2$} \end{subfigure} \begin{subfigure}[b]{0.24\textwidth} \subcaption*{$p=3$} \end{subfigure} \begin{subfigure}[b]{0.24\textwidth} \subcaption*{$p=4$} \end{subfigure} \subcaption*{Forecasts At Posterior Mean} \begin{subfigure}[b]{0.24\textwidth} \end{subfigure} \begin{subfigure}[b]{0.24\textwidth} \end{subfigure} \begin{subfigure}[b]{0.24\textwidth} \end{subfigure} \begin{subfigure}[b]{0.24\textwidth} \end{subfigure} \subcaption*{Posterior Mean Forecasts} \begin{subfigure}[b]{0.24\textwidth} \end{subfigure} \begin{subfigure}[b]{0.24\textwidth} \end{subfigure} \begin{subfigure}[b]{0.24\textwidth} \end{subfigure} \begin{subfigure}[b]{0.24\textwidth} \end{subfigure} \end{center} \caption{Forecasting: Factor Model, Industrial Production Growth\\[5pt] \scriptsize {\em Notes:} The plot depicts the percentage difference between the out-of-sample Mean Squared Errors generated by the Dynamic Factor Model and those generated by an unconditional mean forecast for different choices of $p$ and $r$ and for different types of forecasts. All forecasts are obtained for industrial production growth.} \end{figure} \begin{figure} \begin{center} \begin{subfigure}[b]{0.24\textwidth} \subcaption*{$p=1$} \end{subfigure} \begin{subfigure}[b]{0.24\textwidth} \subcaption*{$p=2$} \end{subfigure} \begin{subfigure}[b]{0.24\textwidth} \subcaption*{$p=3$} \end{subfigure} \begin{subfigure}[b]{0.24\textwidth} \subcaption*{$p=4$} \end{subfigure} \end{center} \caption{Forecasting: NVAR($p,1$), Industrial Production Growth \\[5pt] \scriptsize {\em Notes:} The plot depicts the percentage difference between the out-of-sample Mean Squared Errors generated by the NVAR($p,1$) and those generated by an unconditional mean forecast for different choices of $p$, types of shrinkage and hyperparameter selection methods. All forecasts are obtained for industrial production growth using the posterior mode.} \end{figure}