z-logo
Premium
Estimating the Dynamics and Persistence of Financial Networks, with an Application to the Sterling Money Market
Author(s) -
Giraitis Liudas,
Kapetanios George,
Wetherilt Anne,
ŽIKEŠ Filip
Publication year - 2015
Publication title -
journal of applied econometrics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.878
H-Index - 99
eISSN - 1099-1255
pISSN - 0883-7252
DOI - 10.1002/jae.2457
Subject(s) - econometrics , bivariate analysis , tobit model , estimator , curse of dimensionality , economics , interbank lending market , computer science , econometric model , lasso (programming language) , aggregate (composite) , position (finance) , financial networks , kernel (algebra) , interest rate , finance , mathematics , financial crisis , systemic risk , statistics , materials science , machine learning , world wide web , composite material , macroeconomics , combinatorics
Summary We propose a novel methodology for dynamic econometric modelling of large financial networks subject to persistence, structural changes and sparsity. We estimate bivariate dynamic Tobit‐type models for each pair of banks, allowing for deterministic or stochastic time‐varying parameters, and then aggregate across all bank pairs. To tackle the high dimensionality of the model, we construct a few lagged variables that efficiently summarize the position of a bank pair in the network. We propose a simple and computationally easy kernel‐based local maximum likelihood estimator of the time‐varying parameters of the model and establish its asymptotic properties. We then apply the model to the time series of daily overnight money market network in the UK 2003–2012. The results show that our model can successfully accommodate the numerous structural breaks arising from changes to the monetary framework and captures well the dynamics of the interbank lending relationships in this period. Copyright © 2015 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here