On convergence to stationarity of fractional Brownian storage

From MaRDI portal
(Redirected from Publication:835064)



Abstract: With M(t):=supsin[0,t]A(s)−s denoting the running maximum of a fractional Brownian motion A(cdot) with negative drift, this paper studies the rate of convergence of mathbbP(M(t)>x) to mathbbP(M>x). We define two metrics that measure the distance between the (complementary) distribution functions mathbbP(M(t)>cdot) and mathbbP(M>cdot). Our main result states that both metrics roughly decay as exp(−varthetat2−2H), where vartheta is the decay rate corresponding to the tail distribution of the busy period in an fBm-driven queue, which was computed recently [Stochastic Process. Appl. (2006) 116 1269--1293]. The proofs extensively rely on application of the well-known large deviations theorem for Gaussian processes. We also show that the identified relation between the decay of the convergence metrics and busy-period asymptotics holds in other settings as well, most notably when G"artner--Ellis-type conditions are fulfilled.


Let \(A=(A(t))_{t\geq 0}\) be a fractional Brownian motion and set \[ M(t):=\sup_{0\leq s\leq t}[A(s)-s]\quad\text{and}\quad M:=\sup_{s>0}[A(s)-s]\;. \] The aim of the present paper is to determine the rate of convergence of \(M(t)\) to \(M\) as \(t\to\infty\). Here the distance between \(M(t)\) and \(M\) is measured by two different metrics, namely by the Kolmogorov--Smirnov distance and by the so-called integral distance. In both cases the authors obtain surprisingly sharp convergence rates of exponential order. The proofs of these results rely on large deviation theorems for Gaussian processes.



Cites work









This page was built for publication: On convergence to stationarity of fractional Brownian storage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835064)