Skip to main content

Reversible Markov process

  • Reference work entry
  • First Online:
  • 30 Accesses

A stationary Markov process whose generator has elements given by

where πj is the steady-state probability that the chain is in state j and q (j, k) is the rate at which the chain goes from state j to k. That is, the mean flow rates or probability flux satisfies detailed balance equations for every pair of nodes. Markov chains; Markov processes; Networks of queues; Queueing theory.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   532.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Kluwer Academic Publishers

About this entry

Cite this entry

Gass, S.I., Harris, C.M. (2001). Reversible Markov process . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_892

Download citation

  • DOI: https://doi.org/10.1007/1-4020-0611-X_892

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-7923-7827-3

  • Online ISBN: 978-1-4020-0611-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics