skorohod topologies
Recently Published Documents


TOTAL DOCUMENTS

2
(FIVE YEARS 0)

H-INDEX

1
(FIVE YEARS 0)

2020 ◽  
pp. 2150024
Author(s):  
Paul Jung ◽  
Ian Melbourne ◽  
Françoise Pène ◽  
Paulo Varandas ◽  
Hong-Kun Zhang

We consider a class of planar dispersing billiards with a cusp at a point of vanishing curvature. Convergence to a stable law and to the corresponding Lévy process in the [Formula: see text] and [Formula: see text] Skorohod topologies has been studied in recent work. Here, we show that certain sufficient conditions for [Formula: see text]-convergence are also necessary.


1998 ◽  
Vol 12 (4) ◽  
pp. 479-507 ◽  
Author(s):  
Anatolii A. Puhalskii ◽  
Ward Whitt

We establish functional large deviation principles (FLDPs) for waiting and departure processes in single-server queues with unlimited waiting space and the first-in first-out service discipline. We apply the extended contraction principle to show that these processes obey FLDPs in the function space D with one of the nonuniform Skorohod topologies whenever the arrival and service processes obey FLDPs and the rate function is finite for appropriate discontinuous functions. We apply our previous FLDPs for inverse processes to obtain an FLDP for the waiting times in a queue with a superposition arrival process. We obtain FLDPs for queues within acyclic networks by showing that FLDPs are inherited by processes arising from the network operations of departure, superposition, and random splitting. For this purpose, we also obtain FLDPs for split point processes. For the special cases of deterministic arrival processes and deterministic service processes, we obtain convenient explicit expressions for the rate function of the departure process, but not more generally. In general, the rate function for the departure process evidently must be calculated numerically. We also obtain an FLDP for the departure process of completed work, which has important application to the concept of effective bandwidths for admission control and capacity planning in packet communication networks.


Sign in / Sign up

Export Citation Format

Share Document