SearcharxivSearch

arXiv · 2508.17015

Functional Limits of Generalized Jackson Networks in Multi-scale Heavy Traffic

Abstract

We investigate the functional limits of generalized Jackson networks in a multi-scale heavy traffic regime where stations approach full utilization at distinct, separated rates. Our main result shows that the appropriately scaled queue length processes converge weakly to a limit process whose coordinates are mutually independent. This finding reveals the underlying dynamic mechanism that explains the asymptotic independence previously observed only in stationary distributions. The specific form of the limit process is shown to depend on the initial conditions. In this paper, we consider the matching-rate and the lowest-rate initial conditions. Although the corresponding limit processes have different laws, they have the same product-form exponential limiting distribution on the positive orthant as $t\to\infty$. Moreover, we introduce and analyze a blockwise multi-scale heavy traffic regime. In this regime, the network's stations are partitioned into blocks, where stations in different blocks approach the heavy traffic at different rates, while stations within the same block share a common rate. We obtain the functional limits in this regime as well, showing that the limit process exhibits blockwise independence.

Explore related subjects

Keep this discovery

BibTeXRIS

Zhen-Qing Chen, J. G. Dai, Jin Guang. 2025-08-23. Functional Limits of Generalized Jackson Networks in Multi-scale Heavy Traffic. https://arxiv.org/abs/2508.17015

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