IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2512.02352.html

First-passage horizons in horizontal visibility graphs: a rank-invariant estimator of path roughness for rough volatility models

Author

Listed:
  • Micha{l} Sikorski

Abstract

Horizontal visibility graphs (HVGs) encode the ordinal structure of time series and provide graph-local summaries of path topology. This article introduces L+(t), the forward visibility horizon at node t, with finite-sample terminal non-crossings treated as right-censored observations. For paths without ties, each uncensored L+(t) is identical to the first-passage time {\tau}+(t) = inf{k ≥ 1 : x_{t+k} ≥ x_t}. For an i.i.d. sequence with a continuous distribution, the survival law is exactly Pr[L+ ≥ k] = 1/k, equivalent to R\'enyi's record statistic and implying infinite mean and variance. Hence roughness is estimated on a power-law survival scale through a single tail exponent {\theta}. Combining the identity L+ = {\tau}+ with discrete-grid persistence theory for fractional Brownian motion gives the prediction {\theta}(H) = 1 − H. For rough Bergomi-type volatility, the same prediction is derived under an explicit persistence hypothesis for Riemann–Liouville fBm increments and verified numerically. In Monte-Carlo experiments (N = 10,000, T = 2^16), a Hill-MLE with Clauset–Shalizi–Newman threshold selection recovers {\theta}(H) within one cross-replicate standard deviation for H ≤ 0.2 and reveals a positive finite-size bias for smoother paths. The rank-invariant, parameter-free estimator separates rough Bergomi volatility from classical Heston, GARCH, and FIGARCH benchmarks. Applied to daily FRED VIX data from 2000–2026, the rolling estimate is {\theta}̂ = 0.91 ± 0.19 across 45 four-year windows and lies far below an overlapping-window i.i.d. Monte-Carlo null (p

Suggested Citation

  • Micha{l} Sikorski, 2025. "First-passage horizons in horizontal visibility graphs: a rank-invariant estimator of path roughness for rough volatility models," Papers 2512.02352, arXiv.org, revised May 2026.
  • Handle: RePEc:arx:papers:2512.02352
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2512.02352
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2512.02352. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.