Search arXivSearch

arXiv · 2303.05939

Gaussian Limits for Scheduled Traffic with Super-Heavy Tailed Perturbations

Abstract

A scheduled arrival model is one in which customers are scheduled to arrive at constant interarrival times, but each customer actual arrival time is perturbed from her scheduled arrival time by a random perturbation. The sequence of perturbations is independent and identically distributed. It has previously been shown that the arrival counting process for scheduled traffic obeys a functional central limit theorem (FCLT) with fractional Brownian motion (fBM) with Hurst parameter H strictly between 0 and 1/2 when the pertubratons have a Pareto-like tail with tail exponent lying in (0,1). Such limit processes exhibit less variability than Brownian motion, because the scheduling feature induces negative correlations in the arrival process. In this paper, we show that when the tail of the perturbations have a super-heavy tail, the FCLT limit process is Brownian motion (i.e. H=1/2), so that the heaviness of the tails eliminates any remaining negative correlations and generates a limit process with independent increments. We further study the case when the perturbations have a Cauchy-like tail, and show that the limit process in this setting is a fBM with H=0. So, this paper shows that the entire range of fBMs with $H \in [0,1/2]$ are possible as limits of scheduled traffic.

Explore related subjects

Keep this discovery

BibTeXRIS

Victor F. Araman, Peter W. Glynn. 2023-03-10. Gaussian Limits for Scheduled Traffic with Super-Heavy Tailed Perturbations. https://arxiv.org/abs/2303.05939

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