1. Introduction
For any $\alpha\in(0,2]$ let $\{B_\alpha(t), t\in\mathbb{R}\}$ be a fractional Brownian motion (fBm) with Hurst parameter $H=\alpha/2$ ; that is, $B_\alpha(t)$ is a centered Gaussian process with covariance function given by
In this manuscript we consider the classical Pickands constant defined by
The constant $\mathcal H_\alpha$ was first defined by Pickands [Reference Pickands31, Reference Pickands32] to describe the asymptotic behavior of the maximum of stationary Gaussian processes. Since then, Pickands constants have played an important role in the theory of Gaussian processes, appearing in various asymptotic results related to the supremum; see the monographs [Reference Piterbarg33, Reference Piterbarg34]. In [Reference Dieker and Mikosch22], it was recognized that the discrete Pickands constant can be interpreted as an extremal index of a Brown–Resnick process. This new realization motivated the generalization of Pickands constants beyond the realm of Gaussian processes. For further references the reader may consult [Reference Dębicki, Engelke and Hashorva13, Reference Dębicki and Hashorva14], which give an excellent account of the history of Pickands constants, their connection to the theory of max-stable processes, and the most recent advances in the theory.
Although it is omnipresent in the asymptotic theory of stochastic processes, to date, the value of $\mathcal H_\alpha$ is known only in two very special cases: $\alpha=1$ and $\alpha=2$ . In these cases, the distribution of the supremum of process $B_\alpha$ is well known: $B_1$ is a standard Brownian motion, while $B_2$ is a straight line with random, normally distributed slope. When $\alpha\not\in\{1,2\}$ , one may attempt to estimate the numerical value of $\mathcal H_\alpha$ from the definition (1) using Monte Carlo methods. However, there are several problems associated with this approach:
-
(i) Firstly, the Pickands constant $\mathcal H_\alpha$ in (1) is defined as a limit as $S\to\infty$ , so one must approximate it by choosing some (large) S. This results in a bias in the estimation, which we call the truncation error. The truncation error has been shown to decay faster than $S^{-p}$ for any $p<1$ ; see [Reference Dębicki12, Corollary 3.1].
-
(ii) Secondly, for every $\alpha\in(0,2)$ , the variance of the truncated estimator blows up as $S\to\infty$ ; that is,
\[\lim_{S\to\infty}\textrm{var} \left\{\frac{1}{S}\text{sup}_{t\in [0,S]}\exp\{\sqrt 2 B_\alpha(t)-t^{\alpha}\}\right\} = \infty.\]This can easily be seen by considering the second moment of $\tfrac{1}{S}\exp\{\sqrt{2}B_\alpha(S)-S^\alpha\}$ . This directly affects the sampling error (standard deviation) of the crude Monte Carlo estimator. As $S\to\infty$ , one needs more and more samples to prevent its variance from blowing up. -
(iii) Finally, there are no methods available for the exact simulation of $\text{sup}_{t\in [0,S]}\exp\{\sqrt 2 B_\alpha(t)-t^{\alpha}\}$ for $\alpha\not\in\{1,2\}$ . One must therefore resort to some method of approximation. Typically, one would simulate fBm on a regular $\delta$ -grid, i.e. on the set $\delta\mathbb{Z}$ for $\delta>0$ ; cf. Equation (2) below. This approximation leads to a bias, which we call the discretization error.
In the following, for any fixed $\delta>0$ we define the discrete Pickands constant
where, for $a,b\in\mathbb{R}$ and $\delta>0$ , $[a,b]_\delta = [a,b]\cap \delta\mathbb{Z}$ . Additionally, we set $0\mathbb{Z} = \mathbb{R}$ , so that $\mathcal H^0_\alpha = \mathcal H_\alpha$ . In light of the discussion in item (iii) above, the discretization error equals $\mathcal H_\alpha-\mathcal H_\alpha^\delta$ . We should note that the quantity $\mathcal H_\alpha^\delta$ is well defined and $\mathcal{H}_{\alpha}^{\delta}\in (0,\infty)$ for $\delta\ge0$ . Moreover, $\mathcal{H}_{\alpha}^{\delta} \to \mathcal{H}_{\alpha}$ as $\delta\to0$ , which means that the discretization error diminishes as the size of the gap of the grid goes to 0. We refer to [Reference Dębicki, Engelke and Hashorva13] for the proofs of these properties.
In recent years, [Reference Dieker and Yakir23] proposed a new representation of $\mathcal H^\delta_\alpha$ , which does not involve the limit operation. They show [Reference Dieker and Yakir23, Proposition 3] that for all $\delta\ge 0$ and $\alpha\in(0,2]$ ,
For $\delta = 0$ the denominator in the fraction above is replaced by $\int_{\mathbb{R}} e^{\sqrt 2B_\alpha(t)-|t|^{\alpha}}\textrm{d}t$ . In fact, the denominator can be replaced by $\eta\sum_{t\in \eta \mathbb{Z}}e^{\sqrt 2B_\alpha(t)-|t|^{\alpha}}$ for any $\eta$ , which is an integer multiple of $\delta$ ; see [Reference Dębicki, Engelke and Hashorva13, Theorem 2]. While one would ideally estimate $\mathcal H_\alpha$ using $\xi_\alpha^0$ , this is unfortunately infeasible since there are no exact simulation methods for $\xi^\delta_\alpha$ (see also item (iii) above). For that reason, the authors define the ‘truncated’ version of the random variable $\xi_\alpha^\delta$ , namely
where for $\delta = 0$ the denominator of the fraction is replaced by $\int_{-T}^T e^{\sqrt 2B_\alpha(t)-|t|^{\alpha}}\textrm{d}t$ . For any $\delta,T\in(0,\infty)$ , the estimator $\xi_\alpha^\delta(T)$ is a functional of a fractional Brownian motion on a finite grid, and as such it can be simulated exactly; see e.g. [Reference Dieker24] for a survey of methods of simulation of fBm. A side effect of this approach is that the new estimator induces both the truncation and the discretization errors described in items (i) and (iii) above.
In this manuscript we rigorously show that the estimator $\xi_\alpha^\delta(T)$ is well suited for simulation. In Theorem 1, we address the conjecture stated by the inventors of the estimator $\xi^\delta_\alpha$ about the asymptotic behavior of the discretization error between the continuous and discrete Pickands constant for a fixed $\alpha\in(0,2]$ :
[Reference Dieker and Yakir23, Conjecture 1] For all $\alpha\in(0,2]$ it holds that $\displaystyle \lim_{\delta\to 0}\frac{\mathcal{H}_{\alpha}-\mathcal{H}_{\alpha}^{\delta}}{\delta^{\alpha/2}}\in (0,\infty).$
We establish that the conjecture is true when $\alpha=1$ and is not true when $\alpha=2$ ; see Corollary 1 below, where the exact asymptotics of the discretization error are derived in these two special cases.
Furthermore, in Theorem 1(i) we show that
for $\alpha\in(0,1)$ , and in Theorem 1(ii) we show that $\mathcal H_\alpha-\mathcal H_\alpha^\delta$ is upper-bounded by $\delta^{\alpha/2}$ up to logarithmic terms for $\alpha\in(1,2)$ and all $\delta>0$ small enough. These results support the claim of the conjecture for all $\alpha\in(0,2)$ .
Secondly, we consider the truncation and sampling errors induced by $\xi_\alpha^\delta(T)$ . In Theorem 2 we derive a uniform upper bound for the tail of the probability distribution of $\xi_\alpha^\delta$ which implies that all moments of $\xi_\alpha^\delta$ exist and are uniformly bounded in $\delta\in[0,1]$ . In Theorem 3 we establish that for any $\alpha\in(0,2)$ and $p\ge1$ , the difference $|\mathbb{E}(\xi_\alpha^\delta(T))^p - \mathbb{E}(\xi_\alpha^\delta)^p|$ decays no slower than $\exp\{-\mathcal CT^\alpha\}$ , as $T\to\infty$ , uniformly for all $\delta\in[0,1]$ . This implies that the truncation error of the Dieker–Yakir estimator decays no slower than $\exp\{-\mathcal CT^\alpha\}$ , and combining this with Theorem 2, we have that $\xi_\alpha^\delta(T)$ has a uniformly bounded sampling error, i.e.
Although arguably the most celebrated, Pickands constants are not the only constants appearing in the asymptotic theory of Gaussian processes and related fields. Depending on the setting, other constants may appear, including Parisian Pickands constants [Reference Dębicki, Hashorva and Ji15, Reference Dębicki, Hashorva and Ji16, Reference Jasnovidov and Shemendyuk27], sojourn Pickands constants [Reference Dębicki, Liu and Michna18, Reference Dębicki, Michna and Peng20], Piterbarg-type constants [Reference Bai, Dębicki, Hashorva and Luo3, Reference Ji and Robert28, Reference Piterbarg33, Reference Piterbarg34], and generalized Pickands constants [Reference Dębicki11, Reference Dieker21]. As with the classical Pickands constants, the numerical values of these constants are typically known only in the case $\alpha\in\{1,2\}$ . To approximate them, one can try the discretization approach. We believe that, using techniques from the proof of Theorem 1(ii), one could derive upper bounds for the discretization error which are exact up to logarithmic terms; see, e.g., [Reference Bisewski and Jasnovidov6].
The manuscript is organized as follows. In Section 2 we present our main results and discuss their extensions and relationship to other problems. The rigorous proofs are presented in Section 3, while some technical calculations are given in the appendix.
2. Main results
In the following, we give an upper bound for $\mathcal H_{\alpha} - \mathcal H_{\alpha}^{\delta}$ for all $\alpha\in(0,1)\cup(1,2)$ for small $\delta>0$ .
Theorem 1. The following hold:
-
(i) For any $\alpha\in(0,1)$ and $\varepsilon>0$ , for all $\delta>0$ sufficiently small,
\begin{equation*}\mathcal H_{\alpha} - \mathcal H_{\alpha}^{\delta} \leq \frac{\mathcal H_\alpha \sqrt{\pi}(1+\varepsilon)}{(1 - 2^{-1-\alpha/2})\sqrt{4-2^\alpha}} \cdot \delta^{\alpha/2}.\end{equation*} -
(ii) For every $\alpha\in(1,2)$ there exists $\mathcal C>0$ such that for all $\delta>0$ sufficiently small,
\begin{equation*}\mathcal H_{\alpha} - \mathcal H_{\alpha}^{\delta} \leq\mathcal C\delta^{\alpha/2}|\log\delta|^{1/2}.\end{equation*}
While for the proof of the case $\alpha\in(1,2)$ we were able to use general results from the theory of Gaussian processes, in the case $\alpha\in(0,1)$ we needed to come up with more precise tools in order to skip the $|\log \delta|^{1/2}$ part in the upper bound. Therefore, the proofs in these two cases are very different from each other. Unfortunately, the proof in case (i) cannot be extended to case (ii) because of the switch from positive to negative correlations between the increments of fBm; see also Remark 1.
In the following two results we establish an upper bound for the survival function of $\xi_\alpha^\delta$ and for the truncation error discussed in item (i) in Section 1. These two results combined imply that the sampling error of $\xi_\alpha^\delta(T)$ is uniformly bounded in $(\delta,T)\in[0,1]\times[1,\infty)$ ; cf. Equation (4).
Theorem 2. For any $\alpha \in (0,2)$ , $\delta\in[0,1]$ , and $\varepsilon>0$ for sufficiently large x, T, we have
Moreover, there exist positive constants $\mathcal C_1, \mathcal C_2$ such that for all $x,T>0$ and $\delta\ge 0$ ,
Evidently, Theorem 2 implies that all moments of $\xi_\alpha^\delta$ are finite and uniformly bounded in $\delta\in [0,1]$ for any fixed $\alpha \in (0,2)$ .
Theorem 3. For any $\alpha\in (0,2)$ and $p>0$ there exist postive constants $\mathcal C_1,\mathcal C_2$ such that
for all $(\delta,T)\in[0,1]\times[1,\infty)$ .
2.1. Case $\alpha\in\{1,2\}$
In this scenario, the explicit formulas for $\mathcal H_1^\delta$ (see, e.g., [Reference Dębicki and Mandjes19, Reference Kabluchko and Wang29]) and $\mathcal H_2^\delta$ (see, e.g., [Reference Dębicki and Hashorva14, Equation (2.9)]) are known. They are summarized in the proposition below, with $\Phi$ being the cumulative distribution function of a standard Gaussian random variable.
Proposition 1. It holds that
-
(i) $\mathcal H_1 = 1$ and $\displaystyle \mathcal{H}^{\delta}_1 =\bigg(\delta\exp\Big\{2\sum_{k=1}^\infty\frac{\Phi(\!-\!\sqrt {\delta k/2})}{k}\Big\}\bigg)^{-1}$ for all $\delta>0$ , and
-
(ii) $\mathcal{H}_{2}=\frac{1}{\sqrt{\pi}}$ , and $\displaystyle \mathcal{H}^\delta_{2}=\frac{2}{\delta}\left( \Phi(\delta/\sqrt{2})-\frac{1}{2} \right)$ for all $\delta>0$ .
Relying on the above, we can provide the exact asymptotics of the discretization error, as $\delta\to0$ . In the following, $\zeta$ denotes the Euler–Riemann zeta function.
Corollary 1. It holds that
-
(i) $\displaystyle \lim_{\delta\to0}\frac{\mathcal H_1-\mathcal H_1^\delta}{\sqrt{\delta}} = -\frac{\zeta(1/2)}{\sqrt \pi}$ , and
-
(ii) $\displaystyle \lim_{\delta\to0}\frac{\mathcal H_2-\mathcal H_2^\delta}{\delta^2} = \frac{1}{12\sqrt{\pi}}$ .
2.2. Discussion
We believe that finding the exact asymptotics of the speed of the discretization error $\mathcal H_{\alpha}-\mathcal H_\alpha^\delta$ is closely related to the behavior of fBm around the time of its supremum. We motivate this by the following heuristic:
where $\Delta(\delta)$ is the difference between the suprema on the continuous and discrete grids, i.e. $\Delta(\delta) \;:\!=\; \text{sup}_{t\in\mathbb{R}}\{\sqrt{2}B_\alpha(t)-|t|^{\alpha}\} - \text{sup}_{t\in\delta\mathbb{Z}}\{\sqrt{2}B_\alpha(t)-|t|^{\alpha}\}$ . The first approximation above is due to the mean value theorem, and the second approximation is based on the assumption that $\Delta(\delta)$ and $\xi^\delta_\alpha$ are asymptotically independent as $\delta\to0$ . We believe that $\Delta(\delta)\sim \mathcal C\delta^{\alpha/2}$ by self-similarity, where $\mathcal C>0$ is some constant, which would imply that $\mathcal H_\alpha-\mathcal H_\alpha^\delta \sim \mathcal C\mathcal H_\alpha\delta^{\alpha/2}$ . This heuristic reasoning can be made rigorous in the case $\alpha=1$ , when $\sqrt{2}B_\alpha(t)-|t|^\alpha$ is a Lévy process (Brownian motion with drift). In this case, the asymptotic behavior of functionals such as $\mathbb{E}\left\{ \Delta(\delta)\right\}$ , as $\delta\to0$ , can be explained by the weak convergence of trajectories around the time of supremum to the so-called Lévy process conditioned to be positive; see [Reference Ivanovs26] for more information on this topic. In fact, Corollary 1(i) can be proven using the tools developed in [Reference Bisewski and Ivanovs5]. To the best of the authors’ knowledge, there are no such results available for a general fBm. However, it is worth mentioning that recently [Reference Aurzada, Buck and Kilian2] considered the related problem of penalizing fractional Brownian motion for being negative.
A problem related to the asymptotic behavior of $\mathcal H_\alpha- \mathcal H_\alpha^\delta$ was considered in [Reference Borovkov, Mishura, Novikov and Zhitlukhin7, Reference Borovkov, Mishura, Novikov and Zhitlukhin8], who showed that $\mathbb{E} \text{sup}_{t\in [0,1]}B_\alpha(t)-\mathbb{E} \text{sup}_{t\in [0,1]_\delta}B_\alpha(t)$ decays like $\delta^{\alpha/2}$ up to logarithmic terms. We should emphasize that in Theorem 1, in the case $\alpha\in(0,1)$ , we were able to establish that the upper bound for the discretization error decays exactly like $\delta^{\alpha/2}$ . In light of the discussion above, we believe that the result and the method of proof of Theorem 1(i) could be useful in further research related to the discretization error for fBm.
Monotonicity of Pickands constants. Based on the definition (2), it is clear that for any $\alpha\in(0,2)$ , the sequence $\{\mathcal H^{\delta}_\alpha, \mathcal H^{2\delta}_\alpha,\mathcal H^{4\delta}_\alpha, \ldots\}$ is decreasing for any fixed $\delta>0$ . It is therefore natural to speculate that $\delta\mapsto\mathcal H_\alpha^\delta$ is a decreasing function. The explicit formulas for $\mathcal H_1^\delta$ and $\mathcal H_2^\delta$ given in Proposition 1 allow us to give a positive answer to this question in these cases.
Corollary 2. For all $\delta\ge 0$ , $\mathcal{H}^{\delta}_1$ and $\mathcal{H}^{\delta}_2$ are strictly decreasing functions with respect to $\delta$ .
3. Proofs
For $\alpha \in (0,2)$ define
Assume that all of the random processes and variables we consider are defined on a complete general probability space $\Omega$ equipped with a probability measure $\mathbb P$ . Let $\mathcal C,\mathcal C_1,\mathcal C_2,\ldots$ be some positive constants that may differ from line to line.
3.1. Proof of Theorem 1, case $\alpha\in(0,1)$
The proof of Theorem 1 in the case $\alpha\in(0,1)$ is based on the following three results, whose proofs are given later in this section. In what follows, $\eta$ is independent of $\{Z_\alpha(t), t\in\mathbb{R}\}$ and follows a standard exponential distribution.
Lemma 1. For all $\alpha\in (0,2)$ ,
As a side note, we remark that the representation in Lemma 1 yields a straightforward lower bound
for all $\alpha\in(0,2)$ , $\delta>0$ .
Lemma 2. For all $\alpha\in(0,1)$ and $\delta>0$ ,
Proposition 2. For any $\alpha\in(0,2)$ and $\varepsilon>0$ , it holds that
for all $\delta>0$ small enough.
Proof of Theorem 1, $\alpha\in (0,1)$ . Using the fact that $\mathcal H^\delta_\alpha \to \mathcal H_\alpha$ as $\delta\downarrow0$ , we may represent the discretization error $\mathcal H_\alpha - \mathcal H^\delta_\alpha$ as a telescoping series; that is,
Combining Lemma 2 and Proposition 2, we find that, with $\mathcal C$ denoting the constant from Proposition 2,
for all $\delta$ small enough. This completes the proof.
Remark 1. If the upper bound in Lemma 2 holds also for $\alpha\in(1,2)$ , then the upper bound in Theorem 1(i) holds for all $\alpha\in(0,2)$ .
The remainder of this section is devoted to proving Lemma 1, Lemma 2, and Proposition 2.
In what follows, for any $\alpha\in(0,2)$ , let $\{X_\alpha(t), t\in\mathbb{R}\}$ be a centered, stationary Gaussian process with $\textrm{var}\{X_\alpha(t)\} = 1$ , whose covariance function satisfies
Before we give the proof of Lemma 1, we introduce the following result.
Lemma 3. The finite-dimensional distributions of $\{u(X_\alpha(u^{-2/\alpha}t)-u) \mid X_\alpha(0)>u, t\in\mathbb{R}\}$ converge weakly to the finite-dimensional distributions of $\{Z_\alpha(t)+\eta, t\in\mathbb{R}\}$ , where $\eta$ is a random variable independent of $\{Z_\alpha(t), t\in\mathbb{R}\}$ following a standard exponential distribution.
The result in Lemma 3 is well known; see, e.g., [Reference Albin and Choi1, Lemma 2], where the convergence of finite-dimensional distributions is established on $t\in\mathbb{R}_+$ . The extension to $t\in\mathbb{R}$ is straightforward.
Proof of Lemma 1. The following proof is very similar in flavor to the proof of [Reference Bisewski, Hashorva and Shevchenko4, Lemma 3.1]. From [Reference Piterbarg34, Lemma 9.2.2] and the classical definition of the Pickands constant it follows that for any $\alpha\in (0,2)$ and $\delta\ge 0$ ,
where $\Psi(u)$ is the complementary CDF (tail) of the standard normal distribution and $\{X_\alpha, t\in\mathbb{R}\}$ is the process introduced above Equation (5). Therefore,
Now, notice that we can decompose the event in the numerator above into a sum of disjoint events:
Using the stationarity of the process $X_\alpha$ , the above is equal to
Applying Lemma 3 to each element of the sum above, we find that the sum converges to $\sum_{\tau\in[0,T]_{\delta/2}} U(\tau,T)$ as $u\to\infty$ , where
We have now established that $\mathcal H_\alpha^{\delta/2}-\mathcal H_\alpha^\delta = \lim_{T\to\infty}\frac{1}{T}\sum_{\tau\in[0,T]_{\delta/2}}U(\tau,T)$ . Clearly,
We will now show that $\mathcal H_\alpha^{\delta/2}-\mathcal H_\alpha^{\delta}$ is lower-bounded and upper-bounded by $\delta^{-1}U(0,\infty)$ , which will complete the proof. For the lower bound note that
where the limit is equal to $\delta^{-1}U(0,\infty)$ , because the sum above has $[T(\delta/2)^{-1}]$ elements, of which half are equal to 0 and the other half are equal to $U(0,\infty)$ . In order to show the upper bound, consider $\varepsilon>0$ . For any $\tau\in(\varepsilon T,(1-\varepsilon)T)_{\delta/2}$ we have
Furthermore, we have the following decomposition:
where $I_- \;:\!=\; [0,\varepsilon T]$ , $I_0 \;:\!=\; (\varepsilon T,(1-\varepsilon)T)$ , $I_+ \;:\!=\; [(1-\varepsilon),T]$ . The first and last sums can be bounded by their number of elements, $[\varepsilon T(\delta/2)^{-1}]$ , because $U(\tau,T)\leq 1$ . The middle sum can be bounded by $\frac{1}{2}\cdot [(1-2\varepsilon)T(\delta/2)^{-1}]\overline U(T,\varepsilon)$ , because half of its elements are equal to 0 and the other half can be upper-bounded by $\overline U(T,\varepsilon)$ . Letting $T\to\infty$ , we obtain
because $\overline U(T,\varepsilon) \to U(0,\infty)$ as $T\to\infty$ . Finally, letting $\varepsilon\to0$ yields the desired result.
Proof of Lemma 2. In light of Lemma 1, it suffices to show that
The left-hand side of the above equals
Observe that for all $t,s\in\delta\mathbb{Z}\setminus\{0\}$ it holds that
the proof of this technical inequality is given in the appendix. Since in the case $t=s$ the covariances in Equation (6) are equal, we may apply the Slepian lemma [Reference Piterbarg34, Lemma 2.1.1] and obtain
from which the claim follows.
We will now lay out the preliminaries necessary to prove Proposition 2. First, let us introduce some notation that will be used until the end of this section. For any $\delta>0$ , $\lambda>0$ let
For any $\delta>0$ and $\lambda>0$ we define the densities of the two-dimensional vectors $(Z_\alpha(\!-\!\delta), Z_\alpha(\delta))$ and $(Z_\alpha(\!-\!\delta) + \lambda^{-1}\eta, Z_\alpha(\delta)+ \lambda^{-1}\eta)$ respectively, with $\textbf{x} \;:\!=\; \left(\begin{smallmatrix} x_1\\[5pt] x_2 \end{smallmatrix}\right) \in\mathbb{R}^2$ , as follows:
We also define the densities of these random vectors conditioned to take negative values on both coordinates:
Notice that both $f^-$ and $g^-$ are nonzero in the same domain $\textbf{x}\leq \textbf{0}$ . Now, let $\Sigma$ be the covariance matrix of $(Z_\alpha(\!-\!1), Z_\alpha(1))$ , that is,
By the self-similarity property of fBm, the covariance matrix $\Sigma(\delta)$ of $(Z_\alpha(\!-\!\delta), Z_\alpha(\delta))$ equals $\Sigma(\delta) = \delta^{\alpha}\Sigma$ . With ${\textbf{1}}_2 = \left(\begin{array}{c}{1} \\[2pt] {1}\end{array}\right)$ we define
so that, with $|\Sigma|$ denoting the determinant of matrix $\Sigma$ , we have
The proofs of the following three lemmas are given in the appendix.
Lemma 4. For any $\lambda>0$ there exist $\mathcal C_{0},\mathcal C_{1}>0$ such that
for all $\delta>0$ sufficiently small.
In the following lemma, we establish the formulas for $f^-$ and $g^-$ and show that $g^-$ is upper-bounded by $f^-$ uniformly in $\delta$ , up to a positive constant.
Lemma 5. For any $\lambda>0$ ,
-
(i) $\displaystyle f^-(\boldsymbol{x};\; \delta) = p(\delta)^{-1} f(\boldsymbol{x};\;\delta) \mathbb{1}\{\boldsymbol{x}\leq 0\}$ ;
-
(ii) $\displaystyle g^-(\boldsymbol{x};\; \delta, \lambda) = q(\delta, \lambda)^{-1}f(\boldsymbol{x};\;\delta) \int_0^\infty \lambda\exp\!\left\{-\frac{cz^2 + 2z((\lambda-c)\delta^{\alpha} - b(\boldsymbol{x}))}{2\delta^{\alpha}}\right\}\textrm{d}z \cdot \mathbb{1}\{\textbf{x}\leq 0\}$ ;
-
(iii) there exists $C>0$ , depending only on $\lambda$ , such that for all $\delta$ small enough,
$\displaystyle g^-(\boldsymbol{x};\; \delta,\lambda) \leq C f^-(\boldsymbol{x};\;\delta)$ for all $\boldsymbol{x}\leq 0$ .
Recall the definition of $\Sigma$ in Equation (10). In what follows, for $k\in\mathbb{Z}$ we define
Lemma 6. For $k\in\mathbb{Z}\setminus\{0\}$ ,
-
(i) $\displaystyle (2-2^{\alpha-1})^{-1} < c^-(k) + c^+(k) \leq 1$ when $\alpha\in(0,1)$ ;
-
(ii) $1 \leq c^-(k) + c^+(k) \leq (2-2^{\alpha-1})^{-1}$ when $\alpha\in(1,2)$ .
We are now ready to prove Proposition 2. In what follows, for any $\delta>0$ and $t\in\mathbb{R}$ let
It is a well-known fact that $\{Y_\alpha^\delta(t), t\in\mathbb{R}\}$ is independent of $(Z_\alpha(\!-\!\delta),Z_\alpha(\delta))$ .
Proof of Proposition 2. Recall the definition of the events $A(\delta,\lambda)$ and $A(\delta)$ in (7). We have
with $Y_\alpha(t)$ as defined in (13). Let $\lambda^* \;:\!=\; 1$ when $\alpha\in(0,1]$ , and $\lambda^* \;:\!=\; (2-2^{\alpha-1})^{-1}$ when $\alpha\in[1,2)$ . By Lemma 6 we have $\lambda^*\geq1$ and $c^-(k)+c^+(k)\leq \lambda^*$ ; thus $A(\delta,1) \subseteq A(\delta,\lambda^*)$ , and the display above is upper-bounded by
where $g^-$ is as defined in (9). By using Lemma 5(iii), in particular Equation (25), we know that for every $\varepsilon>0$ and all $\delta>0$ small enough, with
the expression above is upper-bounded by
Finally, from [Reference Dieker and Yakir23, Proposition 4] we know that $\mathbb{P} \left\{ \text{sup}_{t\in\delta\mathbb{Z}\setminus\{0\}} Z_\alpha(t) \leq 0 \right \} \sim \delta\mathcal H_\alpha$ ; therefore, after substituting for $\lambda^*$ , we find that the above is upper-bounded by
for all $\delta>0$ sufficiently small.
3.2. Proof of Theorem 1, case $\alpha\in (1,2)$
The following lemma provides a crucial bound for $\mathcal H_{\alpha} - \mathcal H_{\alpha}^{\delta}$ .
Lemma 7. For sufficiently small $\delta>0$ it holds that
Proof of Lemma 7. As follows from the proof of [Reference Dębicki, Hashorva and Michna17, Theorem 1], in particular the first equation on p. 12 with $c_\delta \;:\!=\; [1/\delta]\delta$ , where $[\!\cdot\!]$ is the integer part of a real number, it holds that
This completes the proof.
Now we are ready to prove Theorem 1(ii).
Proof of Theorem 1, $\alpha\in (1,2)$ . Note that for any $ y\le x$ it holds that $e^x-e^y\le (x-y)e^x$ . Implementing this inequality, we find that for $s,t\in[0,1]$ ,
Next, by Lemma 7 we have
Clearly, the second term is upper-bounded by $\mathcal C_1 \delta$ for all $\delta$ small enough. Using the Hölder inequality, the first term can be bounded by
The first expectation is finite. The random variable inside the second expectation is called the uniform modulus of continuity. From [Reference Dalang10, Theorem 4.2, p. 164] it follows that there exists $\mathcal C>0$ such that
This concludes the proof.
3.3. Proofs of Theorems 2 and 3
Let $\delta\geq0$ . Define a measure $\mu_\delta$ such that for real numbers $a\le b$ ,
Proof of Theorem 2. For any $T>0$ , $x\ge 1$ , and $\delta\ge 0$ , we have
Estimation of $p_2(T)$ . By the self-similarity of fBm we have
Thus, using the Borell–TIS inequality, we find that for all $T\ge 1$ ,
Estimation of $p_1(T,x)$ . Observe that for $T,x\ge 1$ and $\delta\in[0,1]$ ,
Since the event $\{\sum_{k=-T}^{T-1}a_k(\omega)/\sum_{k=-T}^{T-1}b_k(\omega)>x\}$ implies $\{a_k(\omega)/b_k(\omega)>x, \textrm{ for some } k \in [\!-\!T,T-1]_1\}$ , we have
Therefore, we obtain that for $x,T\ge 1$
Next, by the stationarity of the increments of fBm, for $x,T\ge 1$ we have
where in the second line we used that $\mu_\delta[k,k+1]\geq1/2$ for $\delta\in[0,1]$ . Thus, for $T,x\ge 1$ ,
Combining the statement above with (14) and (15), for $x,T\ge1$ we have
Assume that $\alpha\le 1$ . Then, choosing $T=x$ in the line above, by the Borell–TIS inequality we have for any fixed $\varepsilon>0$ and sufficiently large x that
Assume that $\alpha>1$ . Taking $T = \mathcal C'(\log x)^{\frac{1}{\alpha-1}}$ with sufficiently small $\mathcal C'>0$ , we obtain by the Borell–TIS inequality that for any fixed $\varepsilon>0$ and sufficiently large x,
The first claim now follows since $\mathbb{P} \left\{ \xi_\alpha^\delta(T)>x \right \} =p_1(T,x)$ and $\frac{\alpha}{\alpha-1}>2$ . The second claims follows in the same way by (17).
Proof of Theorem 3. Observe that $|x^p-y^p| \le p|x-y|(x^{p-1}+y^{p-1})$ for all $x,y\ge 0$ and $p\ge 1$ ; this can be shown straightforwardly by differentiation. Hence we have
We have
where
Applying the Hölder inequality, we obtain
We have by (16) that for $x,T\ge 1$ ,
which implies that for $T\ge 1$ ,
Finally for $\alpha\in (0,2)$ and $T\ge 1$ we have
Next, we focus on the properties of $\beta_2$ . For $k>0$ and sufficiently large T we have
which, by the Borell–TIS inequality, is upper-bounded by $e^{-k^{\alpha}T^{\alpha}/19}$ . By the lines above we obtain that with probability at least $1-\sum_{k\in \mathbb{Z}\backslash\{0\}}e^{-|k|^{\alpha}T^{\alpha}/19}\ge 1-e^{-T^{\alpha}/20}$ , for large T,
Putting everything together, we find that for sufficiently large T,
Next we notice that for $T\geq1$ ,
so, by the Borell–TIS inequality, the above is bounded by $e^{-\frac{T^{2\alpha}}{65}}$ for all sufficiently large T. This result in combination with (21) gives us $\mathbb{P} \left\{ \beta_2>e^{-T^\alpha/12 } \right \} \le e^{-T^\alpha/21}$ for all sufficiently large T. Thus, since $\beta_2\in [0,1]$ , from the line above we immediately obtain that
for $T\ge 1$ . By (15) we observe that
Next, by Theorem 2, for $x\ge 1$ we have
and thus $\mathbb{E}\left\{ \beta_1^4\right\}<\mathcal C$ for a positive constant $\mathcal C$ that does not depend on T. With $A_T\;:\!=\; \{\beta_1(\omega)>0\}$ , by the Hölder inequality, for large T we have
By the line above and (20), (22), and (18), for $T\ge 1$ we obtain
Our next aim is to estimate $\mathbb{E}\left\{ \kappa_{p}\right\}$ . We have for $T\ge 1$ that
By the same arguments as in Equation (19), the last integral above does not exceed $\mathcal C_1e^{\max \mathcal C_2(T^{\alpha-1},1)}$ , and since Theorem 2 implies that $\xi_\alpha^\delta$ has all finite moments uniformly bounded for all $\delta\ge 0$ , we obtain for $T\ge 1$ that
Combining the bound above with (23), we have $\sqrt 2 p\mathbb{E}\left\{ \beta^2\right\}\mathbb{E}\left\{ \kappa_{p}\right\} \le e^{-\mathcal C_pT^\alpha}$ for sufficiently large T, and the claim follows.
3.4. Proofs of Corollaries 1 and 2
In the following, $\phi$ stands for the probability density function of a standard Gaussian random variable and
with (recall) $\Psi$ the survival function of a standard Gaussian random variable. Before giving the proofs we introduce the following auxiliary lemma, whose proof is given in the appendix.
Lemma 8. It holds that for any $\eta>0$ ,
Proof of Corollary 1, $\alpha=1$ . By Proposition 1(i), we find that
Since $\mathcal H_\eta = v(\eta)^{-1} \to 1$ as $\eta \to 0$ (see, e.g., [Reference Dieker and Yakir23]), we conclude that $\lim_{\eta\to 0} v(\eta)=1$ and hence $\mathcal A = \lim_{\eta \to 0}\frac{v(\eta)-1}{\sqrt \eta}.$ Implementing L’Hôpital’s rule, we obtain by Lemma 8 that
Note that by the definition of $v(\eta)$ , the observation that $\lim_{\eta\to 0}v(\eta) = 1$ implies
and hence, with $x \;:\!=\; \sqrt \eta/2$ ,
where $\textrm{Li}_{\frac{1}{2}}$ is the polylogarithm function; see, e.g., [Reference Cvijović9]. As follows from [Reference Wood35, Equation (9.3)],
Thus, to prove the claim it is enough to show that
By the Riemann functional equation (see [Reference Guariglia25, Equation (2.3)]) and the observation that $\zeta(s)$ is strictly decreasing for real $s>1$ , we have for any natural number k that
Thus, for $|x|<1$ we have
and (24) follows, which completes the proof of the first statement.
For the statement (ii), by Proposition 1(ii) we have, as $\delta\to 0$ ,
and the claim follows.
Proof of Corollary 2. Case $\alpha=1$ . First we show that $v(\eta)$ is an increasing function for $\eta> 0$ , which is equivalent to the fact that $v'(\eta)>0$ for $\eta>0$ . In light of Lemma 8 it is sufficient to show that
We have
and hence $\mathcal{H}^{\eta}_1 =1/v(\eta)$ is decreasing for $\eta>0$ . Since, by the classical definition, $\mathcal{H}_{1}^0>\mathcal{H}_1^{\eta}$ for any $\eta>0$ , we obtain the claim.
Case $\alpha =2$ . By Proposition 1(ii) we have
where $\eta = \delta/\sqrt 2$ . The derivative of the last integral above with respect to $\eta$ equals
and the claim follows.
Appendix
Proof of Equation (6). Let $t,s\in\mathbb{R}$ be fixed, and let
We will show that $\delta\mapsto c(\delta;\;t,s)$ is a nondecreasing function, which will conclude the proof. We have
We consider two cases: (i) $t,s>0$ , and (ii) $s<0<t$ . Consider case (i) first. Without loss of generality we assume that $t\geq s$ ; then
It suffices to show that the first derivative of $\delta\mapsto c(\delta;\;t,s)$ is nonnegative. We have
where $x \;:\!=\; \frac{s+\delta}{t+\delta} \in (0,1]$ . The derivative above is nonnegative if and only if $G_1(x,\alpha) \;:\!=\;$ $(1-x)^{\alpha-1}(1+x) + x^{\alpha} - 1 \geq 0$ for all $x\in(0,1]$ . It is easy to see that, for any fixed $x\in(0,1]$ , $\alpha\mapsto G_1(x,\alpha)$ is a nondecreasing function; this observation combined with the fact that $G(x,2)=0$ completes the proof of case (i). In case (ii) we need to show that
is a nondecreasing function of x for any $s,t>0$ . Without loss of generality let $0<s\leq t$ . Again, we take the first derivative of the above and see that
where $x \;:\!=\; \frac{s+\delta}{t+\delta}\in(0,1]$ . The derivative above is nonnegative if and only if $G_2(x,\alpha) \;:\!=\;$ $(1-x)(1+x)^{\alpha-1} + x^\alpha - 1 \geq 0$ . Notice that $G_2(x,1) = 0$ . We will now show that $\frac{\partial}{\partial\alpha}G_2(x,\alpha) \leq 0$ for all $\alpha\in[0,1]$ and $x\in(0,1]$ , which will conclude the proof. We have
where in the last line we used the fact that $\log\!(1+x)\leq x$ for all $x>-1$ .
Proof of Lemma 4. For the lower bound, observe that
which behaves like $\lambda\delta^{\alpha/2}\mathbb{P} \left\{ \sqrt{2}B_\alpha(\!-\!1) > 1, \sqrt{2}B_\alpha(1) > 1 \right \} $ as $\delta\downarrow0$ . For the upper bound, observe that
where (recall) $\Phi(\!\cdot\!), \Psi(\!\cdot\!)$ are the CDF and complementary CDF, respectively, of the standard normal distribution. This concludes the proof.
Proof of Lemma 5. Part (i) follows directly from the definition. For part (ii),
for $\textbf{x}\leq0$ we have
For part (iii), we have $\Sigma^{-1} = \big(2^\alpha(4-2^\alpha)\big)^{-1} \cdot \left(\begin{smallmatrix}2 & 2^\alpha-2\\[5pt] 2^\alpha-2 & 2 \end{smallmatrix}\right)$ ; thus $\Sigma^{-1}{\textbf{1}}_2 \geq \textbf{0}$ element-wise. It then follows that $b(\textbf{x}) \leq \textbf{0}$ for all $\textbf{x}\leq \textbf{0}$ . Since $g^{-}$ is nonzero only on $\textbf{x} \leq \textbf{0}$ , this yields the following upper bound:
Now, after applying the substitution $z \;:\!=\; \delta^{\alpha/2} z$ , we find that for any $\varepsilon>0$ and all $\delta$ small enough,
Hence, using part (i) and substituting $c = 2/(4-2^\alpha)$ as in Equation (11), we obtain
for all $\delta>0$ sufficiently small. The proof is concluded by noting that $p(\delta) \to \mathbb{P} \left\{ B_\alpha(\!-\!1)<0, B_\alpha(1)<0 \right \} > 0$ and $\delta^{\alpha/2}q(\delta,\lambda)^{-1} = O(1)$ , by Lemma 4.
Proof of Lemma 6. After some algebraic transformations, from (12) we find that
Let $f(x) = 2x^{\alpha}-(x-1)^\alpha-(x+1)^\alpha$ . For $x>1$ we have
We see that each of the terms in the sum above is positive, so $\textrm{sgn}(f'(x)) = \textrm{sgn}(\alpha-1)$ . Thus, f’(x) is negative for $\alpha\in (0,1)$ and positive for $\alpha\in(1,2)$ . Finally, since
and $c^-(1) + c^+(1) =1$ , the claim follows.
Proof of Lemma 8. It is sufficient to show that for any $\eta>0$ ,
Take $a,b>0$ such that $\eta\in [a,b]$ , $f(\eta) = \sum_{k=1}^\infty (\Psi(\sqrt{\eta k/2})/k)$ and $f_n(\eta) =\sum_{k=1}^n (\Psi(\sqrt{\eta k/2})/k)$ , $n \in \mathbb{N}$ . According to [Reference Kudryavtsev, Kutasov, Chehlov and Shabunin30, paragraph 3.1, p. 385], to claim the line above it is enough to show that (1) there exists $\eta_0 \in[a,b]$ such that the sequence $\{f_n(\eta_0)\}_{n\in \mathbb{N}}$ converges to a finite limit, and (2) $f'_n(\eta)$ , $\eta\in [a,b]$ , converge uniformly to some function.
The first condition holds since $\Psi(x)<e^{-x^2/2}$ for $x>0$ . For the second condition we need to prove that, uniformly for all $\eta\in [a,b]$ , it holds that $\sum_{k=n+1}^\infty f'_k(\eta) \to 0$ as $n \to \infty$ . We have
so the claim holds.
Acknowledgements
We would like to thank Professor Enkelejd Hashorva and Professor Krzysztof Dębicki for fruitful discussions.
Funding information
K. Bisewski’s research was funded by SNSF Grant 200021-196888. G. Jasnovidov was supported by the Ministry of Science and Higher Education of the Russian Federation, under agreements 075-15-2019-1620 (dated 08/11/2019) and 075-15-2022-289 (dated 06/04/2022).
Competing interests
There were no competing interests to declare which arose during the preparation or publication process of this article.