Propagation of Chaos and Poisson Hypothesis
classification
🧮 math.PR
keywords
hypothesispoissonasymptoticchaosclosedestablishindependenceinfinity
read the original abstract
We establish the Strong Poisson Hypothesis for symmetric closed networks. In particular, the asymptotic independence of the nodes -- as the size of the system tends to infinity -- is proved.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.