Abstract
An alternative proof of a result of Blomqvist on the “heavy-traffic” problem for the two-barrier random walks using weak convergence methods is indicated.

This publication has 2 references indexed in Scilit: