On Jackson Networks on Denumerable Graphs

DOI10.1137/1133055zbMath0666.60084OpenAlexW2021881826MaRDI QIDQ3817406

Maxim Kontsevich, M. Ya. Kel'bert, Alexander 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

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

Related Items (1)

Interference queueing networks on grids

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