HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Random Walks and Chemical Networks

Abstract : We consider continuous time random walks in the orthant with bounded jumps, the rates however are not bounded - they have a polynomial dependence on the coordinates of the point. The case when the rates are bounded correspon- ds in applications to the queueing theory, more exactly to markovian communication networks. The goal of this paper is to discuss the situation for polynomial rates, we show that the boundaries do not play role, but new effects and complicated behaviour can arise due to different time scales.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 7:58:21 PM
Last modification on : Thursday, February 3, 2022 - 11:13:54 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:57:00 PM


  • HAL Id : inria-00072176, version 1



Vadim A. Malyshev, S. A. Pirogov, A. Rybko. Random Walks and Chemical Networks. [Research Report] RR-4412, INRIA. 2002. ⟨inria-00072176⟩



Record views


Files downloads