SearcharxivSearch

arXiv · 2108.12890

Diffusion Approximations for $\text{Cox}/G_t/\infty$ Queues In A Fast Oscillatory Random Environment

Abstract

We study infinite server queues driven by Cox processes in a fast oscillatory random environment. While exact performance analysis is difficult, we establish diffusion approximations to the (re-scaled) number-in-system process by proving functional central limit theorems (FCLTs) using a stochastic homogenization framework. This framework permits the establishment of quenched and annealed limits in a unified manner. At the quantitative level, we identity two parameter regimes, termed subcritical and supercritical indicating the relative dominance between the two underlying stochasticities driving our system: the randomness in the arrival intensity and that in the serivce times. We show that while quenched FCLTs can only be established in the subcritical regime, annealed FCLTs can be proved in both cases. Furthermore, the limiting diffusions in the annealed FCLTs display qualitatively different diffusivity properties in the two regimes, even though the stochastic primitives are identical. In particular, when the service time distribution is heavy-tailed, the diffusion is sub- and super-diffusive in the sub- and super-critical cases. The results illustrate intricate interactions between the underlying driving forces of our system.

Explore related subjects

Keep this discovery

BibTeXRIS

Harsha Honnappa, Yiran Liu, Samy Tindel, Aaron Yip. 2021-08-29. Diffusion Approximations for $\text{Cox}/G_t/\infty$ Queues In A Fast Oscillatory Random Environment. https://arxiv.org/abs/2108.12890

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR