Semimartingale reflecting Brownian motions (SRBMs) are an integral part of queueing theory. Fluid paths are a standard tool for demonstrating positive recurrence of SRBMs, and their convergence provides both necessary and sufficient conditions for three- and fewer-dimensional SRBMs. Previous examples have been given in the literature for six- and greater-dimensional positive recurrent SRBMs with divergent linear fluid paths. Using predator–prey models, this article provides a family of four-dimensional positive recurrent SRBMs with divergent linear fluid paths, and a family of five-dimensional positive recurrent SRBMs with divergent linear fluid paths and identity covariance matrix. This closes the gap on the number of dimensions under which the positive recurrence of an SRBM does and does not imply convergence of the associated fluid paths.
Construction of positive recurrent semimartingale reflecting Brownian motions with divergent fluid paths using predator–prey models. // Biological Research. – 2026. – DOI: 10.1007/s11134-026-10006-5. – URL: https://link.springer.com/article/10.1007/s11134-026-10006-5
(2026). Construction of positive recurrent semimartingale reflecting Brownian motions with divergent fluid paths using predator–prey models. Biological Research. https://doi.org/10.1007/s11134-026-10006-5
“Construction of positive recurrent semimartingale reflecting Brownian motions with divergent fluid paths using predator–prey models.” Biological Research, 2026. doi:10.1007/s11134-026-10006-5.
@article{article32560,
title = {Construction of positive recurrent semimartingale reflecting Brownian motions with divergent fluid paths using predator–prey models},
journal = {Biological Research},
year = {2026},
doi = {10.1007/s11134-026-10006-5},
url = {https://link.springer.com/article/10.1007/s11134-026-10006-5}
}
We introduce several dynamic models of sources of “posts” publishing them on a “newsfeed” in e.g. some social media. All of them have a product-form stationary distribution. We define four metrics relevant to these newsfeeds and compute...
We study a restricted version of the Erlang-R queueing model that has both server and space constraints, in which the space restriction is administered by two types of admission policies: blocking or holding in a pre-entrant queue. This...
Single-server queues with customer abandonment arise in call centers and other service systems, yet their steady-state performance is analytically tractable only in special cases. We develop Robust Queueing approximations for the mean...
We study a non-stationary state-dependent Hawkes single-server queueing model with both time-varying arrival and service rates, under the first-come first-served discipline. The arrival process is a Hawkes process with a time-varying...
Motivated by recent optimality results in matching models, we consider the symmetric W -matching model with three demand classes and two supply classes, and a threshold-based matching policy with finite threshold value T . Under this...