Propagation of Chaos and Poisson Hypothesis


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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.

作者简介

A. Vladimirov

Kharkevich Institute for Information Transmission Problems

编辑信件的主要联系方式.
Email: vladim@iitp.ru
俄罗斯联邦, Moscow

S. Pirogov

Kharkevich Institute for Information Transmission Problems

Email: vladim@iitp.ru
俄罗斯联邦, Moscow

A. Rybko

Kharkevich Institute for Information Transmission Problems

Email: vladim@iitp.ru
俄罗斯联邦, Moscow

S. Shlosman

Kharkevich Institute for Information Transmission Problems; Skolkovo Institute of Science and Technology; Aix Marseille Université, Université de Toulon

Email: vladim@iitp.ru
俄罗斯联邦, Moscow; Moscow; Marseille

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Inc., 2018