We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges – without the need for normalization – to a limiting random variable as the walk length tends to infinity. This paper focuses on the properties of these discrete limiting variables. The problem is rooted in probability theory but also has natural connections to statistical physics and analytic combinatorics. We present two main sets of results, each based on different assumptions regarding the random walk parameters. First, when the reflections on the horizontal and vertical boundaries are assumed to be similar, we reveal the recursive structure of the problem through a coupling approach. Second, in the case of more general reflection rules but singular random walks, we derive an explicit closed-form expression for the limiting distribution using the compensation approach. Our results are illustrated via concrete computations on various examples.
Hoang, Viet Hung, Raschel, Kilian. Boundary contacts for reflected random walks in the quarter plane. // Queueing Systems. – 2026. – DOI: 10.1007/s11134-026-09984-3. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s11134-026-09984-3
Hoang, Viet Hung, Raschel, & Kilian (2026). Boundary contacts for reflected random walks in the quarter plane. Queueing Systems. https://doi.org/10.1007/s11134-026-09984-3
Hoang, et al. “Boundary contacts for reflected random walks in the quarter plane.” Queueing Systems, 2026. doi:10.1007/s11134-026-09984-3.
@article{Hoang2026,
title = {Boundary contacts for reflected random walks in the quarter plane},
author = {Hoang and Hung, Viet and Raschel and Kilian},
journal = {Queueing Systems},
year = {2026},
doi = {10.1007/s11134-026-09984-3},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s11134-026-09984-3}
}
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...
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...
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...