Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T03:12:31.588Z Has data issue: false hasContentIssue false

Approximate versions of Melamed's theorem

Published online by Cambridge University Press:  14 July 2016

A. D. Barbour*
Affiliation:
Universität Zürich
Timothy C. Brown*
Affiliation:
University of Melbourne
*
∗ Postal address: Institut für Angewandte Mathematik, Universität Zürich, Winterthurerstr. 190, 8057 Zürich, Switzerland.
∗∗ Postal address: Department of Statistics, University of Melbourne, Parkville, Victoria 3052, Australia.

Abstract

In 1979, Melamed proved that, in an open migration process, the absence of ‘loops' is necessary and sufficient for the equilibrium flow along a link to be a Poisson process. In this paper, we prove approximation theorems with the same flavour: the difference between the equilibrium flow along a link and a Poisson process with the same rate is bounded in terms of expected numbers of loops. The proofs are based on Stein's method, as adapted for bounds on the distance of the distribution of a point process from a Poisson process in Barbour and Brown (1992b). Three different distances are considered, and illustrated with an example consisting of a system of tandem queues with feedback. The upper bound on the total variation distance of the process grows linearly with time, and a lower bound shows that this can be the correct order of approximation.

MSC classification

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1996 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable