2000 character limit reached
Stationary States of the Generalized Jackson Networks (1308.1524v2)
Published 7 Aug 2013 in math.PR
Abstract: We consider Jackson Networks on general countable graphs and with arbitrary service times. We find natural sufficient conditions for existence and uniqueness of stationary distributions. They generalise these obtained earlier by Kelbert, Kontsevich and Rybko.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.