Probl. Peredachi Inf., 2018 Volume 54, Issue 3, Pages 102–111
(Mi ppi2277)
This article is cited in
2 papers
Communication Network Theory
Propagation of chaos and Poisson hypothesis
A. A. Vladimirov a ,
S. A. Pirogov a ,
A. N. Rybko a ,
S. B. Shlosman abc a Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
b Skolkovo Institute of Science and Technology, Moscow, Russia
c Aix Marseille Université, Université de Toulon, CNRS, CPT, Marseille, France
Abstract:
We establish the strong Poisson hypothesis for symmetric closed networks. In particular, we prove asymptotic independence of nodes as the size of the system tends to infinity.
UDC:
621.391.1:519.2
Received: 21.10.2016
Revised: 25.04.2018
© , 2025