June 2016 Random walks in a queueing network environment
M. Gannon, E. Pechersky, Y. Suhov, A. Yambartsev
Author Affiliations +
J. Appl. Probab. 53(2): 448-462 (June 2016).

Abstract

We propose a class of models of random walks in a random environment where an exact solution can be given for a stationary distribution. The environment is cast in terms of a Jackson/Gordon–Newell network although alternative interpretations are possible. The main tool is the detailed balance equations. The difference compared to earlier works is that the position of the random walk influences the transition intensities of the network environment and vice versa, creating strong correlations. The form of the stationary distribution is closely related to the well-known product formula.

Citation

Download Citation

M. Gannon. E. Pechersky. Y. Suhov. A. Yambartsev. "Random walks in a queueing network environment." J. Appl. Probab. 53 (2) 448 - 462, June 2016.

Information

Published: June 2016
First available in Project Euclid: 17 June 2016

zbMATH: 1344.60086
MathSciNet: MR3514290

Subjects:
Primary: 60J27
Secondary: 60J28

Keywords: Continuous-time Markov process , Jackson network , product formula , Queueing network , reversibility , simple exclusion , stationary probability , Zero range

Rights: Copyright © 2016 Applied Probability Trust

JOURNAL ARTICLE
15 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.53 • No. 2 • June 2016
Back to Top