Least-Variable Harmonic Matrix-Exponential Distributions
Abstract
Concentrated matrix-exponential (CME) distributions are random clocks approximating a fixed time, with quality measured by the squared coefficient of variation (SCV); a well-known construction builds such clocks from products of cosine-squared terms under shared exponential damping, but the number of these terms, and hence the number of parameters to optimize, grows with the order. Since exhaustive search over the full parameter space becomes prohibitively expensive at high orders, previous work has relied on low-dimensional heuristic parametrizations rather than the true optimum. We introduce a strictly larger class of common-damping harmonic densities, built from an arbitrary nonnegative trigonometric polynomial rather than such a product. For each fixed pair of scalar parameters, coefficient optimization reduces to a single eigenvalue problem, leaving a two-dimensional nonlinear search independent of the order. The enlargement leaves the infimum unchanged from that of the classical cosine-squared construction. Applying this exact characterization at the orders where the three-parameter heuristic allows comparison gives smaller reported SCV values, with larger gains at higher orders. Separately, an explicit harmonic construction gives an O(N−2) upper bound on the attainable SCV, where N is the ME representation budget, compared with the Erlang distribution's linear rate 1/N.
Related
- Stability of least-energy solutions of the harmonic map flow from the plane into the 2-sphere
- Harmonic maps from 𝕊2n+1 into ℂℙn with least Morse index
- Fast and Stable Harmonic Approximation from Ill-distributed Data using Moving Least Squares
- Solving the Tikhonov Regularization of the Total Least Squares Problem by matrix simultaneous diagonalization via congruence
- Pick-up sticks problems for exponential and Pareto distributions
BibTeX
@misc{battagliola2026leastvariable,
title = {{Least-Variable Harmonic Matrix-Exponential Distributions}},
author = {Maria Laura Battagliola and Oscar Peralta},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.14612},
eprint = {2609.14612},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.14612},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Least-Variable Harmonic Matrix-Exponential Distributions
AU - Maria Laura Battagliola
AU - Oscar Peralta
PY - 2026
DA - 2026/09/13
PB - arXiv
DO - 10.48550/arxiv.2609.14612
UR - https://arxiv.org/abs/2609.14612
AB - Concentrated matrix-exponential (CME) distributions are random clocks approximating a fixed time, with quality measured by the squared coefficient of variation (SCV); a well-known construction builds such clocks from products of cosine-squared terms under shared exponential damping, but the number of these terms, and hence the number of parameters to optimize, grows with the order. Since exhaustive search over the full parameter space becomes prohibitively expensive at high orders, previous work has relied on low-dimensional heuristic parametrizations rather than the true optimum. We introduce a strictly larger class of common-damping harmonic densities, built from an arbitrary nonnegative trigonometric polynomial rather than such a product. For each fixed pair of scalar parameters, coefficient optimization reduces to a single eigenvalue problem, leaving a two-dimensional nonlinear search independent of the order. The enlargement leaves the infimum unchanged from that of the classical cosine-squared construction. Applying this exact characterization at the orders where the three-parameter heuristic allows comparison gives smaller reported SCV values, with larger gains at higher orders. Separately, an explicit harmonic construction gives an O(N^−2) upper bound on the attainable SCV, where N is the ME representation budget, compared with the Erlang distribution's linear rate 1/N.
ER -