Random Walks and Chemical Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2002

Random Walks and Chemical Networks


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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4412.pdf (215.77 Ko) Télécharger le fichier

Dates and versions

inria-00072176 , version 1 (23-05-2006)


  • HAL Id : inria-00072176 , version 1


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


Gmail Facebook Twitter LinkedIn More