Big Jobs Arrive Early: From Critical Queues to Random Graphs

DOI10.1287/stsy.2019.0057zbMath1456.60238arXiv1704.03406OpenAlexW3092204449MaRDI QIDQ5141706

Johan S. H. van Leeuwaarden, Remco van der Hofstad, Gianmarco Bet

Publication date: 18 December 2020

Published in: Stochastic Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.03406

zbMATH Keywords

queueing theorydirected random graphsheavy-traffic approximationtransitory queueing systems

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Queueing theory (aspects of probability theory) (60K25) Functional limit theorems; invariance principles (60F17)

Related Items (2)

Weighted Dyck paths and nonstationary queues ⋮ Weakly interacting oscillators on dense random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The component sizes of a critical random graph with given degree sequence
• The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs
• Critical window for the configuration model: finite third moment degrees
• Scaling limits for critical inhomogeneous random graphs with finite third moments
• Continuum limit of critical inhomogeneous random graphs
• Novel scaling limits for critical inhomogeneous random graphs
• Random trees and applications
• Limit distributions for queues and random rooted trees
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Cluster tails for critical power-law inhomogeneous random graphs
• A LIFO queue in heavy traffic
• An alternative approach to heavy-traffic limits for finite-pool queues
• A queueing model with independent arrivals, and its fluid and diffusion limits
• The continuum limit of critical random graphs
• Probability theory. A comprehensive course.
• Stochastic-Process Limits
• The critical behavior of random digraphs
• Critical epidemics, random graphs, and Brownian motion with a parabolic drift
• The phase transition in the evolution of random digraphs
• Queues, random graphs and branching processes
• The final size of a nearly critical epidemic, and the first passage time of a Wiener process to a parabolic barrier
• Finite-pool queueing with heavy-tailed services
• Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations
• The phase transition in inhomogeneous random graphs
• Probability

This page was built for publication: Big Jobs Arrive Early: From Critical Queues to Random Graphs