Financial markets are ultimately seen as a collection of dyadic transactions. We study the temporal evolution of dyadic relationships in the European interbank market, as induced by monetary transactions registered in the electronic market for interbank deposits (e-MID) during a period of 10 years (2006–2015). In particular, we keep track of how reciprocal exchange patterns have varied with macro events and exogenous shocks and with the emergence of the Global Financial Crisis in 2008. The approach adopted extends the model of Holland and Leinhardt to a longitudinal setting where individuals’ temporal trajectories for the tendency to connect and reciprocate transactions are explicitly modelled through splines or polynomials, and individual-specific parameters. We estimate the model by an iterative algorithm that maximizes the log-likelihood for every ordered pair of units. The empirical application shows that the methodology proposed may be applied to large networks and represents the process of exchange at a fine-grained level. Further results are available in on-line supplementary material.
Longitudinal networks of dyadic relationships using latent trajectories: evidence from the European interbank market
Mira A.
2020-01-01
Abstract
Financial markets are ultimately seen as a collection of dyadic transactions. We study the temporal evolution of dyadic relationships in the European interbank market, as induced by monetary transactions registered in the electronic market for interbank deposits (e-MID) during a period of 10 years (2006–2015). In particular, we keep track of how reciprocal exchange patterns have varied with macro events and exogenous shocks and with the emergence of the Global Financial Crisis in 2008. The approach adopted extends the model of Holland and Leinhardt to a longitudinal setting where individuals’ temporal trajectories for the tendency to connect and reciprocate transactions are explicitly modelled through splines or polynomials, and individual-specific parameters. We estimate the model by an iterative algorithm that maximizes the log-likelihood for every ordered pair of units. The empirical application shows that the methodology proposed may be applied to large networks and represents the process of exchange at a fine-grained level. Further results are available in on-line supplementary material.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.