Searcharxiv⌕ Search

arXiv · 2609.23069

Feasible Frontiers for Sub-Gamma Envelopes: the Variance--Pole Trade-off for Infinitely Divisible Laws

Abstract

A right sub-gamma bound is described by a quadratic proxy $v$ and a pole $c$, and the pair is not unique: enlarging either preserves it. Fixing $v$ at the variance $V$ removes the ambiguity at quadratic order but is a convention, not a consequence. For centered infinitely divisible laws with finite nonzero variance we determine the entire boundary of the feasible set, the map $v\mapsto c_*(v)$. A Beta$(1,2)$ multiplier applied to the normalised Kolmogorov canonical measure turns feasibility into a one-dimensional comparison and yields an exact variational formula: the frontier is convex, nonincreasing, and its feasible set is convex. The abscissa of convergence of the moment generating function imposes a $v$-insensitive floor on $c_*$, so a law whose variance-exact pole sits on it has a flat frontier, whereas the third-cumulant obstruction exists only at $v=V$. Whenever that pole lies strictly above both floors the frontier drops strictly as soon as $v>V$; if the control is also purely local with $κ_3^2/(9V^2)>κ_4/(12V)$, the drop has a square-root profile, and in the remaining boundary case a cube-root profile, with derivative $-\infty$ at $V$ either way. We then characterise when the optimised frontier reproduces the exact Chernoff deviation: equality holds at a level exactly when some pair on the frontier is tangent to the cumulant generating function at a Legendre maximiser for that level. At the levels tabulated in a worked example $v=V$ costs four to thirty percent; for a centered exponential a gap persists at every level, reaching thirteen percent.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yichuan Chen, Xin Wang. 2026-09-19. Feasible Frontiers for Sub-Gamma Envelopes: the Variance--Pole Trade-off for Infinitely Divisible Laws. https://arxiv.org/abs/2609.23069

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

KEEP EXPLORING

Related papers

Dark Subspaces and Invariant Measures of Quantum Trajectories

Quantum trajectories are Markov processes describing the evolution of a quantum system subject to indirect measurements. They can be viewed as place dependent iterated function systems or the result of products of dependent and non identically distributed random matrices. In this article, we establish a complete classification of their invariant measures. The classification is done in two steps. First, we prove a Markov process on some linear subspaces called dark subspaces, defined in (Maassen, Kümmerer 2006), admits a unique invariant measure. Second, we study the process inside the dark subspaces. Using a notion of minimal family of isometries from a reference space to dark subspaces, we prove a set of measures indexed by orbits of a unitary group is the set of ergodic measures of quantum trajectories.

math.PR↗

Expected Signature Kernels for Rough Paths

The expected signature kernel is a similarity measure of probability laws on path space and enters directly into signature maximum mean discrepancies. Building on [P. K. Friz, P. P. Hager, and N. Tapia, Forum Math. Sigma, 10 (2022), e42] and [M. Lemercier, T. Lyons, and C. Salvi, SIAM J. Numer. Anal., 64 (2026), pp. 1095-1125], we characterize the expected signature kernel of group-valued inhomogeneous Lévy processes, aka Lévy rough paths, as the scalar component of the solution to an extended Goursat-type system. We give an original description, first in the continuous case where the finite-dimensional system is exact. In the presence of jumps, this system is inherently infinite-dimensional; we prove its well-posedness and derive finite-dimensional truncations with explicit error control. This permits direct evaluation of the reference-dependent terms in one-sample signature-MMD tests without an auxiliary reference sample. Finally, for conditionally Gaussian martingales, conditioning the usual unbiased empirical squared signature-MMD on the sampled quadratic variations yields an unbiased statistic for the same quantity with no larger variance. We derive computable finite-grid versions and illustrate the resulting variance reduction and gain in power.

math.PR↗

A central limit theorem for the range of random walk indexed by an infinite tree

We are interested in the second-order fluctuations of the size of the range of a random walk indexed by an infinite tree in ${\mathbb Z}^d$. Consider the Kesten tree with geometric offspring, we view the vertices on the left of its spine (the unique infinite path) as the past, and those on the right as the future. We show that the number of new sites in the future given its past has linear variance when $d>8$, and satisfies a central limit theorem (CLT) with Gaussian limiting distribution when $d>16$. The proof relies on the stationarity of the model under depth-first exploration, a general CLT by Dedecker and Merlevède [7], a truncation technique exploiting the local independence of tree structures, and a recursion argument for moment bounds.

math.PR↗