Propagation of Chaos and Poisson Hypothesis

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.

Saved in:
Bibliographic Details
Published in:Problems of information transmission 2018-07, Vol.54 (3), p.290-299
Main Authors: Vladimirov, A. A., Pirogov, S. A., Rybko, A. N., Shlosman, S. B.
Format: Article
Language:English
Subjects:
Communication Network Theory
Communications Engineering
Control
Electrical Engineering
Engineering
Hypotheses
Information Storage and Retrieval
Mathematics
Networks
Probability
Systems Theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0032-9460
1608-3253
DOI:10.1134/S0032946018030080