Paper: arXiv 2504.04992

Authors: Dan Pirjol

Abstract

This note gives a bound on the error of the leading term of the \(t\to 0\) asymptotic expansion of the Hartman-Watson distribution \(θ(r,t)\) in the regime \(rt=ρ\) constant. The leading order term has the form \(θ(ρ/t,t)=\frac{“1”}{“2πt”}e^{"-\frac{1"}{“t”} (F(ρ)-π^2/2)} G(ρ) (1 + \vartheta(t,ρ))\), where the error term is bounded uniformly over \(ρ\) as \(|\vartheta(t,ρ)|\leq \frac{“1”}{“70”}t\).

Complexity vs Empirical Score

  • Math Complexity: 9.5/10
  • Empirical Rigor: 2.0/10
  • Quadrant: Lab Rats — high math complexity, limited empirical testing

Why this score: The paper is dominated by advanced asymptotic analysis and complex analytic methods (saddle point expansions, steepest descent, contour integration) to derive error bounds for a special function, but contains no data, backtests, or implementation details for practical quant strategies.

Research Flowchart

  flowchart TD
  A["Research Goal: <br>Bound error of asymptotic expansion of<br>Hartman-Watson integral <br><i>θ(r,t)</i> as <i>t → 0</i> with <i>ρ = rt</i> constant"] --> B

  subgraph B ["Key Methodology"]
      B1["Stochastic Calculus <br>(Brownian motion paths)"]
      B2["Rigorous Bounds <br>(Non-linear ODEs)"]
      B3["Asymptotic Analysis <br>(Method of Dominant Terms)"]
  end

  B --> C["Data / Inputs:<br>Asymptotic Form:<br><i>θ(ρ/t,t) ~ (1/2πt)e^{'-1/t F(ρ)'} G(ρ)</i>"]

  C --> D["Computational Process:<br>Derive uniform error bound<br><i>|θ(t,ρ)| ≤ 1/70 t</i><br>Valid for all <i>ρ > 0</i>"]

  D --> E["Key Outcomes:<br>1. Explicit error bound<br>2. Uniformity over <i>ρ</i><br>3. Validity for small <i>t</i>"]

Evidence Card

What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card

Proposes

The paper provides an explicit upper bound on the error term of the leading order asymptotic expansion of the Hartman‑Watson distribution for small t, namely |ϑ(t,ρ)| ≤ 1/70 t.

Source sentence
Using a combination of analytical and numerical estimates for the inte-grand appearing in the asymptotic expansion we give in this note an upper bound on the error term (4) |ϑ(t, ρ)| ≤1 70t . This bound is the main result of this note.

Assumes 2

  • The asymptotic regime considered is t → 0 with the product ρ = r t held constant. model
    Source sentence
    This note gives a bound on the error of the leading term of the $t\to 0$ asymptotic expansion of the Hartman-Watson distribution $θ(r,t)$ in the regime $rt=ρ$ constant. An asymptotic expansion of this integral was proposed in [11] in the limit t →0 at fixed ρ = rt.
  • The bound (16) on δ(τ,ρ) holds uniformly over ρ for τ > 0. statistical
    Source sentence
    The exact results ρ = 1 presented in the next section and numerical tests for general ρ > 0 in Sec. 3.2 suggest that δ(τ, ρ) is bounded as (16) |δ(τ, ρ)| < 1 35τ , τ > 0 uniformly over ρ. Assume that the bound (16) holds.

Data

No dataset named in the text.

Costs

Not applicable The paper reports no trading or execution result.

Finds 2

  • The error term ϑ(t,ρ) in the leading order approximation of θ(ρ/t,t) is bounded by |ϑ(t,ρ)| ≤ 1/70 t for all ρ. theoretical
    Source sentence
    Then the error ϑ(t, ρ) in (14) is bounded from above as (17) |ϑ(t, ρ)| ≤1 70t . Proof.
  • The auxiliary error function δ(τ,ρ) satisfies |δ(τ,ρ)| < 1/35 τ for τ > 0 uniformly over ρ. theoretical
    Source sentence
    The exact results ρ = 1 presented in the next section and numerical tests for general ρ > 0 in Sec. 3.2 suggest that δ(τ, ρ) is bounded as (16) |δ(τ, ρ)| < 1 35τ , τ > 0 uniformly over ρ.

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 7 related papers). Coverage is partial, so this is neither replication nor refutation.

Code

No repository by the authors found in the paper.

Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.