On a weighted embedding for pontograms
A generalized pontogram {Kn(t): 0 [less-than-or-equals, slant] t [less-than-or-equals, slant] 1} corresponding pointwise to a renewal counting process {N(x): 0 [less-than-or-equals, slant] x < [infinity]} via Kn(t) = n-1/2(N(nt)-tN(n)) is investigated in this paper. A weighted embedding for the process {Kn(t): 0 [less-than-or-equals, slant] t [less-than-or-equals, slant] 1} is studied. After proper normalization, weak convergence results for the processes {Kn(t): 0 [less-than-or-equals, slant] t [less-than-or-equals, slant] 1} are derived both in sup-norm as well as in Lp-norm.
Year of publication: |
1993
|
---|---|
Authors: | Steinebach, Josef ; Zhang, Hanqin |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 47.1993, 2, p. 183-195
|
Publisher: |
Elsevier |
Keywords: | pontograms Poisson bridges Brownian bridges strong approximations weighted embedding renewal processes |
Saved in:
Saved in favorites
Similar items by person
-
Einige Bemerkungen zur Regularität der Stichprobenkovarianzmatrix
Steinebach, Josef, (1984)
-
Optimal production planning in stochastic jobshops with long-run average cost
Presman, Ernst, (2000)
-
Strong approximations for multiple channel queues in heavy traffic
Zhang, Hanqin, (1990)
- More ...