Strong approximation of extended renewal processes
Let \(\{X_ n\}\) be a sequence of i.i.d. random vectors in \(R^ d\), \(d\geq 1\), with expectation \(\mu\) and finite \(\nu\) th moment, \(\nu >2\). Let h be a real function on \(R^ d\) which is homogeneous, \(h(\mu)>0\), and has continuous partial derivatives of the second order in a neighbourhood of \(\mu\). For \(0<q\leq 1\) define the extended renewal process \(N(t)=\min \{k:h(S_ k)\geq tk^{1-q}\}\), \(t\geq 0\), where \(S_ k=X_ 1+...+X_ k.\) The main result of the paper is a strong approximation of \((t/h(\mu))^{1/q}-N(t)\) by a time-transformed Wiener process \(cW((t/h(\mu))^{1/q})\). It is shown that the rate of approximation cannot be improved when \(\nu\geq 4\). Consequences of this theorem are functional and Chung-type laws of iterated logarithm, Bahadur-Kiefer type representation of N(t) in terms of partial sums, and the characterization of N(t) by four classes of deterministic curves in the sense of Révesz. Generalization of the results to the case of nonindependent and nonidentically distributed random vectors is also discussed. It is worthwhile to notice that this paper is the first one considering the case \(q<1\) when \(d>1\).
- Strong approximations of renewal processes and their applications
- Estimates for the probability of ruin starting with a large initial reserve
- Strong approximations of k-th records and k-th record times by Wiener processes
- Invariance principles for renewal processes
- On the optimality of strong approximation rates for compound renewal processes
- Invariance principles for renewal processes when only moments of low order exist
- Confidence bands for percentile residual lifetime under random censorship model
- Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback
- Extreme value asymptotics for multivariate renewal processes
- The (functional) law of the iterated logarithm of the sojourn time for a multiclass queue
- A functional law of the iterated logarithm for multi-class queues with batch arrivals
- A law of iterated logarithm for multiclass queues with preemptive priority service discipline
- Asymptotic variability analysis for a two-stage tandem queue. I: The functional law of the iterated logarithm
- Asymptotic variability analysis for a two-stage tandem queue. II: The law of the iterated logarithm
- Functional Law of the Iterated Logarithm for Multiclass Queues with Preemptive Priority Service Discipline: The Overloaded Case
- scientific article; zbMATH DE number 3969769 (Why is no real title available?)
- scientific article; zbMATH DE number 4076203 (Why is no real title available?)
- scientific article; zbMATH DE number 148793 (Why is no real title available?)
- Limit laws for the averages of exponential random variables
- Asymptotic variability analysis for multi-server generalized Jackson network in overloaded
- On best possible approximations of local time
- Small deviations for the Poisson process
- Small deviations for the Poisson process
- Strong approximation of renewal processes
- Strong approximation of certain stopped sums
This page was built for publication: Strong approximation of extended renewal processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801595)