RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

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. Vladimirova, S. A. Pirogova, A. N. Rybkoa, S. B. Shlosmanabc

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


 English version:
Problems of Information Transmission, 2018, 54:3, 290–299

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025