On Jackson Networks on Denumerable Graphs

DOI10.1137/1133055MaRDI QIDQ3817406zbMATH OpenOpenAlexFDO

Authors Maxim Kontsevich, Mark Kelbert, A. N. Rybko

Publication date 1988

Published in Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1133055

zbMATH Keywords

invariant measure of a Markov processJackson circuit on a countable graph

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Discrete-time Markov processes on general state spaces (60J05) Combinatorial probability (60C05) Discrete potential theory (31C20) Probabilistic potential theory (60J45) Renewal theory (60K05)

Cited in

(2)

• Interference queueing networks on grids
• Infinite closed Jackson networks

This page was built for publication: On Jackson Networks on Denumerable Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3817406)