arXiv subjects

Alessandra Luati

Publications and source records attributed to Alessandra Luati.

10 recordsLinked to original sources

arXiv2026

Spectral clustering of network time series via the sample covariance matrix

Spectral clustering for community detection is analysed in multivariate time series models whose dependence structure is determined by an unobserved stochastic blockmodel. We establish that spectral clustering of the sample covariance matrix achieves exact recovery of the underlying communities. The recovery rates depend explicitly on the network size, sample length, block separation, and degree of data dependence. This demonstrates that exact community recovery under a stochastic blockmodel is possible even when the adjacency matrix is unobserved. Our theory provides extensions of both classical and fine-grained matrix perturbation theory to the setting of dependent data, which may be of independent interest.

math.ST↗

arXiv2025

NIRVAR: Network Informed Restricted Vector Autoregression

High-dimensional panels of time series often arise in finance and macroeconomics, where co-movements within groups of panel components occur. Extracting these groupings from the data provides a coarse-grained description of the complex system in question and can inform subsequent prediction tasks. We develop a novel methodology to model such a panel as a restricted vector autoregressive process, where the coefficient matrix is the weighted adjacency matrix of a stochastic block model. This network time series model, which we call the Network Informed Restricted Vector Autoregression (NIRVAR) model, yields a coefficient matrix that has a sparse block-diagonal structure. We propose an estimation procedure that embeds each panel component in a low-dimensional latent space and clusters the embedded points to recover the blocks of the coefficient matrix. Crucially, the method allows for network-based time series modelling when the underlying network is unobserved. We derive the bias, consistency and asymptotic normality of the NIRVAR estimator. Simulation studies suggest that the NIRVAR estimated embedded points are Gaussian distributed around the ground truth latent positions. On three applications to finance, macroeconomics, and transportation systems, NIRVAR outperforms competing models in terms of prediction and provides interpretable results regarding group recovery.

stat.ME↗

arXiv2025

Factor-Driven Network Informed Restricted Vector Autoregression

High-dimensional financial time series often exhibit complex dependence relations driven by both common market structures and latent connections among assets. To capture these characteristics, this paper proposes Factor-Driven Network Informed Restricted Vector Autoregression (FNIRVAR), a model for the common and idiosyncratic components of high-dimensional time series with an underlying unobserved network structure. The common component is modelled by a static factor model, which allows for strong cross-sectional dependence, whilst a network vector autoregressive process captures the residual co-movements due to the idiosyncratic component. An assortative stochastic block model underlies the network VAR, leading to groups of highly co-moving variables in the idiosyncratic component. For estimation, a two-step procedure is proposed, whereby the static factors are estimated via principal component analysis, followed by estimation of the network VAR parameters. The method is demonstrated in financial applications to daily returns, intraday returns, and FRED-MD macroeconomic variables. In all cases, the proposed method outperforms a static factor model, as well as a static factor plus LASSO-estimated sparse VAR model, in terms of forecasting and financial performance metrics.

stat.ME↗

arXiv2022

A Robust Score-Driven Filter for Multivariate Time Series

A multivariate score-driven filter is developed to extract signals from noisy vector processes. By assuming that the conditional location vector from a multivariate Student's t distribution changes over time, we construct a robust filter which is able to overcome several issues that naturally arise when modeling heavy-tailed phenomena and, more in general, vectors of dependent non-Gaussian time series. We derive conditions for stationarity and invertibility and estimate the unknown parameters by maximum likelihood (ML). Strong consistency and asymptotic normality of the estimator are proved and the finite sample properties are illustrated by a Monte-Carlo study. From a computational point of view, analytical formulae are derived, which consent to develop estimation procedures based on the Fisher scoring method. The theory is supported by a novel empirical illustration that shows how the model can be effectively applied to estimate consumer prices from home scanner data.

econ.EM↗

arXiv2021

Fused graphical lasso for brain networks with symmetries

Neuroimaging is the growing area of neuroscience devoted to produce data with the goal of capturing processes and dynamics of the human brain. We consider the problem of inferring the brain connectivity network from time dependent functional magnetic resonance imaging (fMRI) scans. To this aim we propose the symmetric graphical lasso, a penalized likelihood method with a fused type penalty function that takes into explicit account the natural symmetrical structure of the brain. Symmetric graphical lasso allows one to learn simultaneously both the network structure and a set of symmetries across the two hemispheres. We implement an alternating directions method of multipliers algorithm to solve the corresponding convex optimization problem. Furthermore, we apply our methods to estimate the brain networks of two subjects, one healthy and the other affected by a mental disorder, and to compare them with respect to their symmetric structure. The method applies once the temporal dependence characterising fMRI data has been accounted for and we compare the impact on the analysis of different detrending techniques on the estimated brain networks.

stat.ME↗

arXiv2021

GARCH density and functional forecasts

This paper derives the analytic form of the $h$-step ahead prediction density of a GARCH(1,1) process under Gaussian innovations, with a possibly asymmetric news impact curve. The contributions of the paper consists both in the derivation of the analytic form of the density, and in its application to a number of econometric problems. A first application of the explicit formulae is to characterize the degree of non-Gaussianity of the prediction distribution; for some values encountered in applications, deviations of the prediction distribution from the Gaussian are found to be small, and sometimes not. the Gaussian density as an approximation of the true prediction density. A second application of the formulae is to compute exact tail probabilities and functionals, such as the Value at Risk and the Expected Shortfall, that measure risk when the underlying asset return is generated by a Gaussian GARCH(1,1). This improves on existing methods based on Monte Carlo simulations and (non-parametric) estimation techniques, because the present exact formulae are free of Monte Carlo estimation uncertainty. A third application is the definition of uncertainty regions for functionals of the prediction distribution that reflect in-sample estimation uncertainty. These applications are illustrated on selected empirical examples.

math.ST↗

arXiv2011

An approximate quantum Cramér--Rao bound based on skew information

A closed-form expression for Wigner-Yanase skew information in mixed-state quantum systems is derived. It is shown that limit values of the mixing coefficients exist such that Wigner-Yanase information is equal to Helstrom information. The latter constitutes an upper bound for the classical expected Fisher information, hence the inverse Wigner-Yanase information provides an approximate lower bound to the variance of an unbiased estimator of the parameter of interest. The advantage of approximating Helstrom's sharp bound lies in the fact that Wigner-Yanase information is straightforward to compute, while it is often very difficult to obtain a feasible expression for Helstrom information. In fact, the latter requires the solution of an implicit second order matrix differential equation, while the former requires just scalar differentiation.

math.ST↗

arXiv2009

Real time estimation in local polynomial regression, with application to trend-cycle analysis

The paper focuses on the adaptation of local polynomial filters at the end of the sample period. We show that for real time estimation of signals (i.e., exactly at the boundary of the time support) we cannot rely on the automatic adaptation of the local polynomial smoothers, since the direct real time filter turns out to be strongly localized, and thereby yields extremely volatile estimates. As an alternative, we evaluate a general family of asymmetric filters that minimizes the mean square revision error subject to polynomial reproduction constraints; in the case of the Henderson filter it nests the well-known Musgrave's surrogate filters. The class of filters depends on unknown features of the series such as the slope and the curvature of the underlying signal, which can be estimated from the data. Several empirical examples illustrate the effectiveness of our proposal.

stat.AP↗

arXiv2008

On the Spectral Properties of Matrices Associated with Trend Filters

This paper is concerned with the spectral properties of matrices associated with linear filters for the estimation of the underlying trend of a time series. The interest lies in the fact that the eigenvectors can be interpreted as the latent components of any time series that the filter smooths through the corresponding eigenvalues. A difficulty arises because matrices associated with trend filters are finite approximations of Toeplitz operators and therefore very little is known about their eigenstructure, which also depends on the boundary conditions or, equivalently, on the filters for trend estimation at the end of the sample. Assuming reflecting boundary conditions, we derive a time series decomposition in terms of periodic latent components and corresponding smoothing eigenvalues. This decomposition depends on the local polynomial regression estimator chosen for the interior. Otherwise, the eigenvalue distribution is derived with an approximation measured by the size of the perturbation that different boundary conditions apport to the eigenvalues of matrices belonging to algebras with known spectral properties, such as the Circulant or the Cosine. The analytical form of the eigenvectors is then derived with an approximation that involves the extremes only. A further topic investigated in the paper concerns a strategy for a filter design in the time domain. Based on cut-off eigenvalues, new estimators are derived, that are less variable and almost equally biased as the original estimator, based on all the eigenvalues. Empirical examples illustrate the effectiveness of the method.

math.ST↗

arXiv2004

Maximum Fisher information in mixed state quantum systems

We deal with the maximization of classical Fisher information in a quantum system depending on an unknown parameter. This problem has been raised by physicists, who defined [Helstrom (1967) Phys. Lett. A 25 101-102] a quantum counterpart of classical Fisher information, which has been found to constitute an upper bound for classical information itself [Braunstein and Caves (1994) Phys. Rev. Lett. 72 3439-3443]. It has then become of relevant interest among statisticians, who investigated the relations between classical and quantum information and derived a condition for equality in the particular case of two-dimensional pure state systems [Barndorff-Nielsen and Gill (2000) J. Phys. A 33 4481-4490]. In this paper we show that this condition holds even in the more general setting of two-dimensional mixed state systems. We also derive the expression of the maximum Fisher information achievable and its relation with that attainable in pure states.

math.ST↗