Moscow Mathematical Journal
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mosc. Math. J.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Moscow Mathematical Journal, 2004, Volume 4, Number 2, Pages 441–453
DOI: https://doi.org/10.17323/1609-4514-2004-4-2-441-453 (Mi mmj155) 		 
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
Full-text PDF Citations (8)
References:
PDF
HTML
DOI: https://doi.org/10.17323/1609-4514-2004-4-2-441-453
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
Bibliographic databases:
MSC: 90B10, 94C99, 37-XX
Language: English
Citation: V. A. Malyshev, S. A. Pirogov, A. N. Rybko, “Random walks and chemical networks”, Mosc. Math. J., 4:2 (2004), 441–453
Citation in format AMSBIB
\Bibitem{MalPirRyb04}
\by V.~A.~Malyshev, S.~A.~Pirogov, A.~N.~Rybko
\paper Random walks and chemical networks
\jour Mosc. Math.~J.
\yr 2004
\vol 4
\issue 2
\pages 441--453
\mathnet{http://mi.mathnet.ru/mmj155}
\crossref{https://doi.org/10.17323/1609-4514-2004-4-2-441-453}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2108444}
\zmath{https://zbmath.org/?q=an:1113.90030}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000208594700005}
Linking options:
  • https://www.mathnet.ru/eng/mmj155
  • https://www.mathnet.ru/eng/mmj/v4/i2/p441
    • This publication is cited in the following 8 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Moscow Mathematical Journal
    Statistics & downloads:
    Abstract page:433
    References:92
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025