Poisson hypothesis for information networks. II

MaRDI QIDQ5757102zbMATH OpenFDO

Authors A. N. Rybko, S. B. Shlosman

Publication date 24 August 2007

Full work available at URL https://arxiv.org/abs/math-ph/0303010

zbMATH Keywords

attractorinformation networkslimit theoremPoisson hypothesisself-averaging property

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Communication networks in operations research (90B18) Queues and service in operations research (90B22)

Recommendations

• Poisson hypothesis for information networks. I
• Poisson hypothesis: combinatorial aspect
• Absence of Breakdown of the Poisson Hypothesis I. Closed Networks at Low Load
• Poisson Hypothesis for Open Networks at Low Load
• Proof of the Poisson hypothesis for circuit-switching loss networks

Cited in

(7)

• Poisson hypothesis: combinatorial aspect
• Nonlinear Markov processes in big networks
• Poisson hypothesis for information networks. I
• Absence of Breakdown of the Poisson Hypothesis I. Closed Networks at Low Load
• The pair-replica-mean-field limit for intensity-based neural networks
• Replica-mean-field limits for intensity-based neural networks
• Poisson Hypothesis for Open Networks at Low Load

This page was built for publication: Poisson hypothesis for information networks. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757102)