|
This article is cited in 8 scientific papers (total in 8 papers)
Random walks and chemical networks
V. A. Malysheva, S. A. Pirogovb, A. N. Rybkoc a French National Institute for Research in Computer Science and Automatic Control,
INRIA Paris - Rocquencourt Research Centre
b A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences
c Institute for Information Transmission Problems, Russian Academy of Sciences
Abstract:
We consider continuous-time random walks with bounded jumps but unbounded rates (they depend polynomially on coordinates in the orthant). In applications, the case when the rates are bounded corresponds in applications to queueing theory, more precisely, to Markovian communication networks. The goal of this paper is to discuss the situation for polynomial rates; we show that the boundaries often play no role, but new effects and complicated behaviour may arise due to time scales and nonlinearity.
Key words and phrases:
Random walks, chemical kinetics, entropy.
Received: September 25, 2002; in revised form May 5, 2003
Citation:
V. A. Malyshev, S. A. Pirogov, A. N. Rybko, “Random walks and chemical networks”, Mosc. Math. J., 4:2 (2004), 441–453
Linking options:
https://www.mathnet.ru/eng/mmj155 https://www.mathnet.ru/eng/mmj/v4/i2/p441
|
Statistics & downloads: |
Abstract page: | 430 | References: | 92 |
|