Search arXivSearch

arXiv · 2609.27969

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

Abstract

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter Reinhard Hansen, Chen Tong. 2026-08-24. voigtinference: Exact likelihood calculus and conditional attribution for the Voigt profile. https://arxiv.org/abs/2609.27969

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Penguin data reanalyzed via Computational Taxonomy

We employ Computational Taxonomy (CT) to reanalyze the penguin data set penguins_lter by validating and addressing two biological issues: Sexual Size Dimorphism (SSD) and mate-selection criteria. Via Scientific Data Analysis (SDA) computing, CT constructs a Taxonomic Hierarchy by splitting Species first and then Sex, without involving Island, to achieve less complexity. This Taxonomic Hierarchy validates SSD as a branch comparison: (Species, Sex = Male)-vs-(Species, Sex = Female), upon which SDA explores all potential pieces of associative information from all covariate feature-sets, including interacting effects from order-2 to order-4, and then confirms them via their idiosyncratic reliability checks. The collective of confirmed information pieces are displayed on a heatmap platform to manifest underlying dynamics of SSD with explicit block-structured heterogeneity found within males and females. SSD dynamics is explained through mechanistic dependence pertaining to one chief factor consisting of up to 8 feature-sets: Body-Mass coupled by combinations of {Culmen-length,Culmen-depth, Flipper-length}, and two minor factors consisting of low-order combinations of {Culmen-length,Culmen-depth, Flipper-length}. Such Intra-Sex heterogeneity invalidates all Logistic regression modeling on SSD in the original paper. Further, we explore potential mate-selection criteria through the data-frame of Nest-ID within-species homogeneity.

stat.CO

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

Exact Simulation of Diffusions via Brownian Bridge Range Reconstruction

We develop an exact simulation algorithm for scalar diffusion paths and diffusion bridges when the Poisson potential is unbounded in both tails. The method reconstructs the realized range of a Brownian bridge proposal by sampling its maximum and location, together with the maxima and locations of the two adjacent restricted Brownian meanders. Conditional on this finite information, the remaining path decomposes into four conditionally independent interval-constrained Brownian bridges, which can be sampled exactly at the Poisson times required by the rejection test. In contrast to constructions based on an enclosing range layer, the proposed representation retains the exact extrema and their locations. Our algorithm returns an exact finite-dimensional skeleton without time-discretization error and permits exact post-acceptance refinement at arbitrary finite collections of times. Numerical experiments validate the resulting finite-dimensional laws and identify the restricted-meander extremum simulation as the principal computational cost in the nonlinear example.

stat.CO