SearcharxivSearch

arXiv · 2607.24533

Colored Markov-Modulated Brownian Motion for Preemptive Workload Stacks

Abstract

We develop a colored Markov-modulated Brownian motion model for diffusion-scale systems in which newly created work preempts the active layer, occupies the top of an ordered stack, and must deplete before suspended work resumes. Such preemption arises whenever new work interrupts whatever is currently active, as in last-come, first-served queues and interrupt-driven scheduling, with diffusive dynamics appropriate when the processing rate itself fluctuates randomly. Colors encode stack position and priority, while a background phase, evolving through first-kind transitions that leave the active color unchanged, controls drift and volatility within each color. Second-kind transitions create higher colors at strictly positive random launch heights. A backward recursion summarizes higher-color excursions through return matrices and occupation-density kernels. We obtain stationary product-form representations under hold-and-jump and regulated-base boundary conventions, given explicitly through matrix-analytic formulae, and give matrix-transform formulas for illustrative launch-height families.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maria Laura Battagliola, Eduardo Medina-Valdés, Oscar Peralta. 2026-07-27. Colored Markov-Modulated Brownian Motion for Preemptive Workload Stacks. https://arxiv.org/abs/2607.24533

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