arXiv subjects

Piero Mazzarisi

Publications and source records attributed to Piero Mazzarisi.

27 records · Page 2Linked to original sources

arXiv2021

Tail Granger causalities and where to find them: extreme risk spillovers vs. spurious linkages

Identifying risk spillovers in financial markets is of great importance for assessing systemic risk and portfolio management. Granger causality in tail (or in risk) tests whether past extreme events of a time series help predicting future extreme events of another time series. The topology and connectedness of networks built with Granger causality in tail can be used to measure systemic risk and to identify risk transmitters. Here we introduce a novel test of Granger causality in tail which adopts the likelihood ratio statistic and is based on the multivariate generalization of a discrete autoregressive process for binary time series describing the sequence of extreme events of the underlying price dynamics. The proposed test has very good size and power in finite samples, especially for large sample size, allows inferring the correct time scale at which the causal interaction takes place, and it is flexible enough for multivariate extension when more than two time series are considered in order to decrease false detections as spurious effect of neglected variables. An extensive simulation study shows the performances of the proposed method with a large variety of data generating processes and it introduces also the comparison with the test of Granger causality in tail by [Hong et al., 2009]. We report both advantages and drawbacks of the different approaches, pointing out some crucial aspects related to the false detections of Granger causality for tail events. An empirical application to high frequency data of a portfolio of US stocks highlights the merits of our novel approach.

q-fin.RM↗

arXiv2021

New centrality and causality metrics assessing air traffic network interactions

In ATM systems, the massive number of interacting entities makes it difficult to identify critical elements and paths of disturbance propagation, as well as to predict the system-wide effects that innovations might have. To this end, suitable metrics are required to assess the role of the interconnections between the elements and complex network science provides several network metrics to evaluate the network functioning. Here we focus on centrality and causality metrics measuring, respectively, the importance of a node and the propagation of disturbances along links. By investigating a dataset of US flights, we show that existing centrality and causality metrics are not suited to characterise the effect of delays in the system. We then propose generalisations of such metrics that we prove suited to ATM applications. Specifically, the new centrality is able to account for the temporal and multi-layer structure of ATM network, while the new causality metric focuses on the propagation of extreme events along the system.

physics.soc-ph↗

arXiv2021

On the equivalence between the Kinetic Ising Model and discrete autoregressive processes

Binary random variables are the building blocks used to describe a large variety of systems, from magnetic spins to financial time series and neuron activity. In Statistical Physics the Kinetic Ising Model has been introduced to describe the dynamics of the magnetic moments of a spin lattice, while in time series analysis discrete autoregressive processes have been designed to capture the multivariate dependence structure across binary time series. In this article we provide a rigorous proof of the equivalence between the two models in the range of a unique and invertible map unambiguously linking one model parameters set to the other. Our result finds further justification acknowledging that both models provide maximum entropy distributions of binary time series with given means, auto-correlations, and lagged cross-correlations of order one. We further show that the equivalence between the two models permits to exploit the inference methods originally developed for one model in the inference of the other.

cond-mat.stat-mech↗

arXiv2020

Betweenness centrality for temporal multiplexes

Betweenness centrality quantifies the importance of a vertex for the information flow in a network. We propose a flexible definition of betweenness for temporal multiplexes, where geodesics are determined accounting for the topological and temporal structure and the duration of paths. We propose an algorithm to compute the new metric via a mapping to a static graph. We show the importance of considering the temporal multiplex structure and an appropriate distance metric comparing the results with those obtained with static or single-layer metrics on a dataset of $\sim 20$k European flights.

physics.soc-ph↗

arXiv2019

Trip Centrality: walking on a temporal multiplex with non-instantaneous link travel time

In complex networks, centrality metrics quantify the connectivity of nodes and identify the most important ones in the transmission of signals. In many real world networks, especially in transportation systems, links are dynamic, i.e. their presence depends on time, and travelling between two nodes requires a non-vanishing time. Additionally, many networks are structured on several layers, representing, e.g., different transportation modes or service providers. Temporal generalisations of centrality metrics based on walk-counting, like Katz centrality, exist, however they do not account for non-zero link travel times and for the multiplex structure. We propose a generalisation of Katz centrality, termed Trip Centrality, counting only the paths that can be travelled according to the network temporal structure, i.e. "trips", while also differentiating the contributions of inter- and intra-layer walks to centrality. We show an application to the US air transport system, specifically computing airports' centrality losses due to delays in the flight network.

physics.soc-ph↗

arXiv2019

Detectability of Macroscopic Structures in Directed Asymmetric Stochastic Block Model

We study the problem of identifying macroscopic structures in networks, characterizing the impact of introducing link directions on the detectability phase transition. To this end, building on the stochastic block model, we construct a class of hardly detectable directed networks. We find closed form solutions by using belief propagation method showing how the transition line depends on the assortativity and the asymmetry of the network. Finally, we numerically identify the existence of a hard phase for detection close to the transition point.

physics.soc-ph↗

arXiv2018

Disentangling group and link persistence in Dynamic Stochastic Block models

We study the inference of a model of dynamic networks in which both communities and links keep memory of previous network states. By considering maximum likelihood inference from single snapshot observations of the network, we show that link persistence makes the inference of communities harder, decreasing the detectability threshold, while community persistence tends to make it easier. We analytically show that communities inferred from single network snapshot can share a maximum overlap with the underlying communities of a specific previous instant in time. This leads to time-lagged inference: the identification of past communities rather than present ones. Finally we compute the time lag and propose a corrected algorithm, the Lagged Snapshot Dynamic (LSD) algorithm, for community detection in dynamic networks. We analytically and numerically characterize the detectability transitions of such algorithm as a function of the memory parameters of the model and we make a comparison with a full dynamic inference.

cs.SI↗

arXiv2018

When panic makes you blind: a chaotic route to systemic risk

We present an analytical model to study the role of expectation feedbacks and overlapping portfolios on systemic stability of financial systems. Building on [Corsi et al., 2016], we model a set of financial institutions having Value at Risk capital requirements and investing in a portfolio of risky assets, whose prices evolve stochastically in time and are endogenously driven by the trading decisions of financial institutions. Assuming that they use adaptive expectations of risk, we show that the evolution of the system is described by a slow-fast random dynamical system, which can be studied analytically in some regimes. The model shows how the risk expectations play a central role in determining the systemic stability of the financial system and how wrong risk expectations may create panic-induced reduction or over-optimistic expansion of balance sheets. Specifically, when investors are myopic in estimating the risk, the fixed point equilibrium of the system breaks into leverage cycles and financial variables display a bifurcation cascade eventually leading to chaos. We discuss the role of financial policy and the effects of some market frictions, as the cost of diversification and financial transaction taxes, in determining the stability of the system in the presence of adaptive expectations of risk.

econ.GN↗

arXiv2017

A dynamic network model with persistent links and node-specific latent variables, with an application to the interbank market

We propose a dynamic network model where two mechanisms control the probability of a link between two nodes: (i) the existence or absence of this link in the past, and (ii) node-specific latent variables (dynamic fitnesses) describing the propensity of each node to create links. Assuming a Markov dynamics for both mechanisms, we propose an Expectation-Maximization algorithm for model estimation and inference of the latent variables. The estimated parameters and fitnesses can be used to forecast the presence of a link in the future. We apply our methodology to the e-MID interbank network for which the two linkage mechanisms are associated with two different trading behaviors in the process of network formation, namely preferential trading and trading driven by node-specific characteristics. The empirical results allow to recognise preferential lending in the interbank market and indicate how a method that does not account for time-varying network topologies tends to overestimate preferential linkage.

cs.SI↗