Skip to Main content Skip to Navigation
Reports

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 :
Reports
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00072176
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 7:58:21 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:57:00 PM

Identifiers

  • HAL Id : inria-00072176, version 1

Collections

Citation

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

Share

Metrics

Record views

116

Files downloads

236