Search arXiv⌕ Search

arXiv subjects

Peter Reinhard Hansen

Publications and source records attributed to Peter Reinhard Hansen.

At least 19 recordsLinked to original sources

Box-Cox Transformations of Correlation Matrices

We consider Box-Cox transformations of correlation matrices, $Φ_α(C)=\mathrm{vecl}\{(C^α-I)/α\}$, with Jacobian $J_α$. The family nests the raw correlations at $α=1$, the generalised Fisher transformation (GFT), $C\mapsto\mathrm{vecl}(\log C)$, at $α=0$, and the negated off-diagonal concentration coordinates at $α=-1$. The inverse problem is a strictly convex program for every $α$, so every member is injective. The map is onto $\mathbb{R}^{d}$, $d=n(n-1)/2$, if and only if $α\le0$, such that $α=0$ defines the boundary for unrestricted parametrizations. For $α>0$ the image is bounded. The conditioning obeys the bound $κ(J_α)\leκ(C)^{|1-α|}$, where $κ(C)=λ_{\max}(C)/λ_{\min}(C)$, and on the surjective range the exponent is smallest at $α=0$. Under Gaussian sampling with $n\geq3$, the asymptotic covariance of the transformed sample correlations is the identity at independence for every member, but only $α=0$ retains the identity to first order in the correlations, whereas the leading joint third cumulant at independence vanishes only at $α=1/3$. Finally, applying the transformation to the diagonal rescaling of $C$ that makes the result hollow adds a new family to the existing correlation parametrizations. For every $α$ the rescaling solves a strictly convex problem and the inverse is explicit, and the scaled coordinates are unrestricted exactly when $α=0$, where they recover the known global normal coordinates, centred at independence, for the efficient information metric of the correlations.

econ.EM↗

Convolution Skew-$t$ Distributions

We introduce the convolution skew-$t$ (CST) distribution, which combines independent standardized skew-$t$ subvectors through a general loading matrix to accommodate heterogeneous tails, directional asymmetry, and non-elliptical dependence. We establish identification and develop likelihood inference using analytical scores and a one-dimensional reduction of Fisher information. For the finite-variance model, we prove consistency and asymptotic normality of maximum likelihood and characterize the consequences of imposing false symmetry. A raw representation extends the family to all positive tail indices. Simulations assess finite-sample performance, and a realized-volatility application illustrates the empirical value of allowing tail thickness and asymmetry to vary across latent subvectors.

econ.EM↗

A Balanced Parametrization of Correlation Matrices

We introduce the balanced correlation parametrization (BCP), which maps positive-definite correlation matrices one-to-one onto the set of symmetric hollow (zero-diagonal) matrices with unrestricted off-diagonal entries. A key feature of the parametrization is that both the transformation and its inverse are available in closed form. It can be viewed as a generalization of the transformation underlying the classical correlation $t$-statistic to higher dimensions. It has a direct interpretation as a scaled sum of marginal and partial correlations, is inverse-consistent and equivariant under variable permutations and sign changes, and preserves block structure. A novel property of BCP is that it preserves correlation sparsity as the dimension tends to infinity under suitable factor conditions, providing a basis for sparse high-dimensional correlation modeling. An empirical illustration using standardized idiosyncratic daily stock returns for 1,765 equities over 15 years shows that BCP retains the approximate sparsity pattern and magnitudes of shock correlations, and that it yields accurate positive-definite reconstructions under sparse coordinate restrictions.

econ.EM↗

Tweedie's Formula and Score-Driven Updating

Tweedie's formula expresses a conditional mean in terms of a score function, and this connects score-driven models with Bayesian updating. We show that the score-driven update is identical to a Bayesian update in some special cases. More generally, we show that score-driven updating is a local approximation to Bayesian updating, with an error of second order in the predictive variance. The second-order approximation error has two components, one from the curvature of the log likelihood and one from the asymmetry of the posterior distribution. Implicit score-driven (ISD) updating, which evaluates the score at the updated parameter, corrects for the former but not the latter. A simple correction for the second component leads to an improved third-order approximation, which we denote ISD*. Numerical experiments show substantial gains from ISD and ISD*.

econ.EM↗

Correlation Matrices in High Dimensions: Volume, Spectrum, and Extremes

The set of $n\times n$ correlation matrices, known as the elliptope, has volume decaying at the super-exponential rate $\exp\{-\tfrac14 n^2\log n\}$. We characterize where this vanishing volume concentrates. A uniform draw is entrywise close to the identity yet globally far from it and nearly singular. Its maximum absolute correlation is of order $\sqrt{\log n/n}$, its Frobenius distance is asymptotic to $\sqrt n$, its empirical spectral distribution converges to the Marchenko-Pastur law with ratio one, and its smallest eigenvalue has the exact $\operatorname{Beta}(1,d)$ distribution, where $d=n(n-1)/2$, and is therefore of order $n^{-2}$. Distinct off-diagonal entries are exactly pairwise independent under every $\operatorname{LKJ}(η)$ law, which yields a Chen-Stein proof of the extreme-correlation point-process limit for the whole LKJ family and an $O(n^{-1})$ total-variation bound for finite-dimensional exceedance counts relative to Poisson laws with their exact finite-$n$ means. Finally, for a bounded, centered i.i.d. off-diagonal perturbation of any correlation matrix, the nearest-correlation projection removes a fraction of the squared perturbation that tends to one and recovers the original matrix in average squared error per entry.

math.PR↗

Robust Estimation of Realized Correlation: New Insights about Intraday Fluctuations in Market Betas

Time-varying volatility is an inherent feature of economic time series and complicates correlation measurement at high frequencies. While the quadrant correlation estimator is robust to volatility dynamics, it has low efficiency under Gaussian sampling. We introduce a subsampled quadrant correlation estimator that improves efficiency while retaining robustness and computational simplicity. The estimator is based solely on sign information and involves no smoothing parameter beyond the sampling horizon, which makes it attractive for high-frequency financial data and large cross sections. An empirical application to a broad panel of U.S. stocks reveals substantial intraday variation in market betas. Decomposing beta dynamics shows that relative volatility declines over the day by a similar amount for all stocks, so that the differences across stocks in how their betas move within the day are predominantly driven by differences in intraday correlation changes.

econ.EM↗

Local Optimality and Rigidity of Frobenius Tests for Dense High-Dimensional Covariance Alternatives

We study identity testing for high-dimensional covariance matrices against dense alternatives of unknown direction, with $p/n \to γ$. Along a globally positive quadratic precision path, mixing Gaussian alternatives over a Gaussian Orthogonal Ensemble direction yields a contiguous experiment whose log likelihood reduces to the corrected Frobenius statistic; its upper-tail test attains the limiting weighted-power envelope at every fixed strength. Fixing the prior's Frobenius radius perturbs the mixture by only $O(p^{-1/2})$ in total variation, and exact whitening carries the experiment, the statistic, and its null law to any known null covariance. Separately, under a product-coordinate null, feasibility needs only $4+η$ moments, plus identical distributions over time when means are estimated; studentization and an exact degrees-of-freedom correction preserve the local power. A stability inequality turns near-envelope attainment into null agreement with the Frobenius rule, so uniform noninferiority on the typical dense bulk precludes gains at any contiguous alternative. For trace-matched rank-one alternatives, the corrected statistic is the first likelihood direction when $\vartheta_n \to 0$ and $n\vartheta_n \to \infty$; at fixed strength, the log likelihood ratio in the Onatski-Moreira-Hallin fixed-spike benchmark is governed by a richer linear spectral statistic below the Baik-Ben Arous-Peche threshold, while eigenvalue separation permits cost-free largest-eigenvalue enhancement above it. Simulations illustrate the theory.

math.ST↗

Fast inversion of the generalized Fisher transformation of correlation matrices

The generalized Fisher transformation maps a non-singular correlation matrix to an unconstrained real vector through the off-diagonal elements of its matrix logarithm. Evaluating its inverse is a computational bottleneck in dynamic correlation and multivariate volatility models. We develop a fast inversion algorithm by characterizing the unknown diagonal as the minimizer of a smooth, strictly convex, and coercive objective. An explicit Hessian and global spectral bounds identify the standard fixed-point iteration as a quasi-Newton method and explain why it can converge slowly near singularity. Every fixed-point step decreases the objective, and the iteration converges from every starting point. These results motivate GFT-FP+N, a hybrid of fixed-point and matrix-free Newton steps that never forms the Jacobian. In benchmarks with up to 1,000 replications per design and dimensions up to 800, GFT-FP+N reduces computation time by up to a factor of forty-five relative to the fixed-point iteration and converged in every replication, including on designs where Broyden's method almost always fails. Julia and R packages are provided.

stat.CO↗

Bartlett Couplings of the Onion and Vine LKJ Samplers

The extended-onion and C-vine constructions of Lewandowski, Kurowicka and Joe (2009) are standard methods for sampling from the LKJ_n(eta) distribution on correlation matrices. We show that both arise from the simpler row-normalized Bartlett construction associated with the restricted-Wishart representation of Wang, Wu and Chu (2018), which exposes redundancies hidden in standard gamma-based implementations of the classical constructions. Two exact row-wise couplings establish this: the squared norm of the Gaussian vector supplying the onion's direction has exactly the Gamma law required for one component of the Beta radius, and the same vector, with one chi-squared variate, generates the entire row of mutually independent C-vine partial correlations with their required symmetric-Beta laws. We also show that, relative to flat off-diagonal measure, the LKJ family maximizes entropy at fixed expected log-determinant; the dual natural parameter is eta-1. Under gamma-ratio accounting, normalized Bartlett, the onion, and the conventional symmetric-Beta C-vine require n-1, 2(n-1), and n(n-1) Gamma-equivalent calls. Controlled benchmarks confirm a low-dimensional advantage over the onion implementation and a persistent advantage over the C-vine implementations examined; direct Bartlett normalization also avoids subtractive complements, moving the small-eta zero-diagonal threshold from machine-epsilon scale toward the subnormal range. The sampler is valid for every real eta > 0 and requires only standard normal and chi-squared variates.

math.ST↗

voigtinference: Exact likelihood calculus and conditional attribution for the Voigt profile

Fast, accurate algorithms for the Faddeeva function w(z), and hence the Voigt profile K(x,a), have existed for four decades, and analytic first derivatives are available in some implementations. What the established libraries reviewed here have not provided is the full likelihood calculus of the normalized Voigt distribution: applications still commonly resort to pseudo-Voigt approximations, finite-difference derivatives, or numerical convolution for parameter inference. Because w'(z) = -2z w(z) + 2i/sqrt(pi), every derivative of the Voigt log-likelihood is an algebraic function of K and the dispersion part L(x,a) = Im w(z), from the single complex evaluation that delivers the profile. This yields the score and Hessian in closed form, and the expected Fisher information by one-dimensional quadrature of an analytic integrand; for fixed interior widths sigma, gamma > 0, the MLE of the center and both widths is consistent and asymptotically normal at rate sqrt(n), despite the distribution having no finite mean or variance, so conventional likelihood-based standard errors apply. The conditional mean of the Gaussian component given an observation is (y - mu) - gamma L/K: a redescending function that attributes moderate deviations to the Gaussian (Doppler/resolution) component and extreme ones to the Lorentzian tail. The package voigtinference (Python, NumPy/SciPy, with a cross-validated Julia companion) supplies the toolkit: score, full parameter Hessian, expected information, Newton-based unbinned maximum likelihood with boundary diagnostics, conditional component moments, and evaluation validated against high-precision references at extreme width ratios. It applies directly to unbinned non-relativistic, constant-width Breit-Wigner x Gaussian resonance fits and supplies analytic Jacobians for line-shape refinement. Companion paper: arXiv:2605.01665.

stat.CO↗

The Quarter-Hour Effect: Periodic Algorithmic Trading and Return Predictability in Cryptocurrency Futures

Cryptocurrency markets exhibit periodic bursts in volatility and volume at one-minute, five-minute, and quarter-hour marks. Using trade data for six Binance perpetual contracts, we link these bursts to algorithmic participation: trade-size roundness declines sharply during them. The Autocorrelation Map, a clock-phase-resolved display, reveals serial dependence in order flow and returns at quarter-hour openings that conventional measures obscure. Opening returns are predictable out of sample, while opening order imbalance predicts returns over four to twelve hours, with much weaker effects at finer clock-time frequencies. Together, these findings characterize periodic algorithmic trading and its cross-frequency variation.

q-fin.TR↗

Split-Session Cluster GARCH for Overnight and Intraday Returns: The Role of Tail Heterogeneity

We propose the Split-Session Cluster GARCH model for heavy-tailed multivariate dependence among asset returns decomposed into overnight and intraday components. The model uses convolution-$t$ distributions to allow tail behavior to differ across clusters defined by trading sessions and, within each session, by economic sectors. It also accommodates block-structured conditional correlation matrices, preserving parsimony and scalability in high-dimensional settings. The resulting likelihood remains tractable and yields a score-driven specification for dynamic correlations. We apply the model to U.S. equity returns in six-asset and 100-asset applications. The results reveal pronounced tail heterogeneity between overnight and intraday returns. Model comparisons show that session-specific tail parameters substantially improve fit relative to a common multivariate-$t$ specification, while sector-level tail partitioning delivers additional gains concentrated mainly in the overnight component. In the 100-asset application, asset-level tail heterogeneity delivers the strongest out-of-sample likelihood and global minimum-variance (GMV) portfolio performance.

econ.EM↗

The Generalized Fisher Transformation: Finite-Sample Properties and Inference

We study the finite-sample behavior of the Generalized Fisher Transformation (GFT), the parametrization of a correlation matrix $C$ by $γ(C)=\operatorname{vecl}\log C$. The GFT coordinates extend Fisher's transformation to dimension $n>2$: for elliptical data their finite-sample distributions are close to Gaussian. More strikingly, the coordinates are nearly uncorrelated and their covariance is largely invariant to $C$. This approximate orthogonality and invariance make GFT-based inference far better behaved in finite samples than inference based on sample correlations or element-wise Fisher transformed correlations, yielding estimation errors that are approximately Gaussian, weakly dependent, and nearly pivotal.

econ.EM↗

Moments by Integrating the Moment-Generating Function

We introduce a general integral framework for computing fractional, complex, absolute, and logarithmic moments from the moment-generating function (MGF) under explicit regularity conditions. By evaluating a complex extension of the MGF along a vertical contour, we obtain exact integral expressions that bypass the need for explicit probability densities and high-order derivatives. We establish conditions for negative fractional moments using the symmetric Cauchy principal value, including the requirement that the distribution have no point mass at the centering point. We demonstrate the theoretical scope and computational practicality of the framework through applications to the normal-inverse Gaussian distribution and a semicontinuous compound Poisson-Gamma distribution. In the latter case, the framework handles point masses at the boundary by evaluating conditional fractional moments.

econ.EM↗

The Parabolic Mellin Transform: Gamma and Zeta Integral Representations

We introduce the Parabolic Mellin Transform (PMT), defined by ${P}_σ[f](z)=\int_{-\infty}^{\infty}w^{2z}f(w^2)dt$, where $w=σ+it$ and $σ>0$. Under the substitution $u=w^2$, the vertical line $\operatorname{Re}(w)=σ$ is mapped to the parabolic contour $C_σ$ in the $u$-plane. For the Gaussian kernel, the PMT yields $\int_{-\infty}^{\infty}w^{2z}e^{w^2}dt=π/Γ(\tfrac{1}{2}-z)=\cos(πz)Γ(z+\tfrac{1}{2})$, a parabolic-contour form of the classical Hankel representation for the reciprocal Gamma function. The advantage of this parametrization is that the contour integral becomes a Gaussian-damped vertical-line integral. We develop scaling, differentiation, and Dirichlet-composition identities for the PMT and use them to derive integral representations of the Hurwitz zeta, Riemann zeta, and Dirichlet eta functions. The framework provides a unified transform dictionary for Gamma-type and zeta-type special functions and yields equivalent reformulations of the Riemann hypothesis and the Lindelöf hypothesis in terms of zeros and growth of parabolic-contour integrals.

math.NT↗

Exact Likelihood Inference and Robust Filtering for Gauss-Cauchy Convolution Models

The convolution of a Gaussian and a Cauchy distribution, known as the Voigt distribution, is widely used in spectroscopy and provides a natural framework for modeling heavy-tailed measurement noise. We derive analytical expressions for its density, score, Hessian, Fisher information, and conditional moments using the scaled complementary error function, enabling stable maximum likelihood estimation without numerical convolution, finite-difference derivatives, or pseudo-Voigt approximations. The conditional expectation of the latent Gaussian component is governed by a redescending location score, so extreme observations are automatically discounted rather than propagated. This structure leads to the Gauss-Cauchy Convolution (GCC) filter for state-space models with Gaussian latent dynamics and Voigt measurement errors, where the Masreliez Gaussian prediction approximation preserves a Voigt prediction-error density. In an application to log realized volatility for the Technology Select Sector SPDR Fund, the GCC filter separates persistent latent variation from transient measurement noise and attains the highest implemented prediction-error criterion among the Gaussian, Student-$t$, Huber, and related filtering specifications considered.

econ.EM↗

Principled Identification of Structural Dynamic Models

We take a new perspective on identification in structural dynamic models: rather than imposing restrictions alone, we optimize an objective. While definitive structural identification ultimately requires exogenous economic insight, a weighted correlation-maximizing objective yields an Order- and Scale-Invariant Scheme (OASIS) that selects the orthogonal rotation most aligned with designated target variables. In traditional SVARs, these targets are the reduced-form innovations, making OASIS a natural reference rotation. We show that recursive Cholesky identification is a constrained version of the same objective and that OASIS is systematically closer to perfect correlation, closing roughly twice as much of the gap as recursive orderings, both theoretically and empirically. The same framework also provides a principled estimation strategy for Proxy VARs (IV-SVARs), where the weighted criterion is essential for resolving overdetermination in multi-proxy systems while symmetrically accommodating proxy leakage. Revisiting 22 published SVARs, we find that reduced-form innovations are typically only weakly correlated, helping explain the historical robustness of recursive schemes. Applying OASIS to seminal proxy applications, however, reveals economically important leakage across shocks and shows that accounting for such leakage can materially alter substantive conclusions.

econ.EM↗

A Unifying Integral Representation of the Gamma Function and Its Reciprocal

We derive an integral expression $G(z)$ for the reciprocal gamma function, $1/Γ(z)=G(z)/π$, that is valid for all $z\in\mathbb{C}$, without the need for analytic continuation. The same integral avoids the singularities of the gamma function and satisfies $G(1-z)=Γ(z)\sin(πz)$ for all $z\in\mathbb{C}$.

math.CV↗