Skip to content
DraconiticResearch
Search Sources API
194,067 studies31 sourcesUpdated 13 min ago
PreprintarXiv licencearXiv

Exact analysis of a split--merge queue with latent Erlang-factor dependent subtask times

Abstract

This paper studies a two-server split--merge queue with positively dependent subtask service times modeled through a latent-factor bivariate Erlang construction. An exact characterization of the split--merge completion time is obtained, including explicit formulas for its first two moments and the resulting mean waiting time. Under fixed marginal service-time distributions, independence is shown to stochastically increase the completion time and hence overestimate mean waiting time. Numerical illustrations show that this benchmark gap can be substantial.

Related

  1. Identification of Nonlinear and Dependent Latent Factor Structure through Clique Search
    Dale S. Kim, Qing Zhou
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. The Laplace transform of the time of ruin in the Cramér--Lundberg model with Erlang E2(μ) claims: spectrum, exact moments and matrix reduction
    Goluba Yurieva
    arXivPreprintCC BY-SA 4.0Full textProbabilityarXiv
  3. Causal Mediation Analysis with High-Dimensional Surrogates: Identification, Estimation and Inference under Latent Factor Models
    Himani Yadav, Shi Bo, AmirEmad Ghassami +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. Fingerprint Analysis for Climate Change Detection and Attribution under a Latent Factor Model
    Haoran Li, Yan Li
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Correcting Bartlett factor-score error for latent covariates in partially linear double machine learning
    Eunjeong Song, Sehee Hong
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{zerom2026exact,
  title = {{Exact analysis of a split--merge queue with latent Erlang-factor dependent subtask times}},
  author = {Dawit Zerom},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.21146},
  eprint = {2609.21146},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.21146},
}
RIS
TY  - UNPB
TI  - Exact analysis of a split--merge queue with latent Erlang-factor dependent subtask times
AU  - Dawit Zerom
PY  - 2026
DA  - 2026/09/17
PB  - arXiv
DO  - 10.48550/arxiv.2609.21146
UR  - https://arxiv.org/abs/2609.21146
AB  - This paper studies a two-server split--merge queue with positively dependent subtask service times modeled through a latent-factor bivariate Erlang construction. An exact characterization of the split--merge completion time is obtained, including explicit formulas for its first two moments and the resulting mean waiting time. Under fixed marginal service-time distributions, independence is shown to stochastically increase the completion time and hence overestimate mean waiting time. Numerical illustrations show that this benchmark gap can be substantial.
ER  -