The Equivalence of Functional Central Limit Theorems for Counting Processes and Associated Partial Sums
From MaRDI portal
Publication:5633337
DOI10.1214/AOMS/1177693249zbMATH Open0226.60028OpenAlexW2047437921MaRDI QIDQ5633337FDOQ5633337
Authors: Donald L. Iglehart, Ward Whitt
Publication date: 1971
Published in: Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177693249
Cited In (24)
- Controlling the Running Maximum of a Diffusion Process and an Application to Queueing Systems
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Weak convergence inapplied probability
- Diffusion approximation for a heavily loaded multi-user wireless communication system with cooperation
- Accuracy of state space collapse for earliest-deadline-first queues
- ON BOUNCING GEOMETRIC BROWNIAN MOTIONS
- Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic.
- Optimal scheduling of critically loaded multiclass \(GI/m/n+m\) queues in an alternating renewal environment
- Some invariance principles for stochastic processes and their inverse and supremum processes
- A functional limit theorem for general shot noise processes
- Variables selection using \(\mathcal{L}_0\) penalty
- Invariance principle for processes with independent increments, conditioned to be positive
- Maxima of sums of random variables and suprema of stable processes
- Optimal service rate perturbations of many server queues in heavy traffic
- Stochastic Abelian and Tauberian theorems
- Functional approach in the divisor distribution problems
- Diffusion approximations for double-ended queues with reneging in heavy traffic
- Limit theorems for queueing systems with various service disciplines in heavy-traffic conditions
- CONDITIONS FOR THE PROPAGATION OF MEMORY PARAMETER FROM DURATIONS TO COUNTS AND REALIZED VOLATILITY
- Large deviation analysis of the single server queue
- Equivalences in strong limit theorems for renewal counting processes
- Functional central limit theorems for processes with positive drift and their inverses
- Strong approximation of renewal processes
- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
This page was built for publication: The Equivalence of Functional Central Limit Theorems for Counting Processes and Associated Partial Sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5633337)