Poisson Hypothesis for information networks (A study in non-linear Markov processes)

Simple item page
dc.creatorRybko, Alexander
dc.creatorShlosman, Senya
dc.date2003-03-04
dc.date.accessioned2026-07-07T04:29:51Z
dc.date.available2026-07-07T04:29:51Z
dc.descriptionIn this paper we prove the Poisson Hypothesis for the limiting behavior of the large queueing systems in some simple ("mean-field") cases. We show in particular that the corresponding dynamical systems, defined by the non-linear Markov processes, have a line of fixed points which are global attractors. To do this we derive the corresponding non-linear integral equation and we explore its self-averaging properties. Our derivation relies on a solution of a combinatorial problem of rode placements.
dc.description70 pages
dc.identifierhttps://arxiv.org/abs/math-ph/0303010
dc.identifierhttp://arxiv.org/abs/math-ph/0303010
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/57312
dc.subjectMathematical Physics
dc.subjectProbability
dc.subject82C20; 60J25
dc.titlePoisson Hypothesis for information networks (A study in non-linear Markov processes)
dc.typetext

Files

Collections

arXiv