𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Markov Chain Models β€” Rarity and Exponentiality

✍ Scribed by Julian Keilson (auth.), Julian Keilson (eds.)


Publisher
Springer-Verlag New York
Year
1979
Tongue
English
Leaves
198
Series
Applied Mathematical Sciences 28
Edition
1
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


in failure time distributions for systems modeled by finite chains. This introductory chapter attempts to provide an overΒ­ view of the material and ideas covered. The presentation is loose and fragmentary, and should be read lightly initially. Subsequent perusal from time to time may help tie the matΒ­ erial together and provide a unity less readily obtainable otherwise. The detailed presentation begins in Chapter 1, and some readers may prefer to begin there directly. Β§O.l. Time-Reversibility and Spectral Representation. Continuous time chains may be discussed in terms of discrete time chains by a uniformizing procedure (Β§2.l) that simplifies and unifies the theory and enables results for discrete and continuous time to be discussed simultaneously. Thus if N(t) is any finite Markov chain in continuous time governed by transition rates vmn one may write for pet) = [Pmn(t)] β€’ P[N(t) = n I N(O) = m] pet) = exp [-vt(I - a )] (0.1.1) v where v > Max r v ' and mn m n law ~ 1 - v-I * Hence N(t) where is governed r vmn Nk = NK(t) n K(t) is a Poisson process of rate v indep- by a ' and v dent of N β€’ k Time-reversibility (Β§1.3, Β§2.4, Β§2.S) is important for many reasons. A) The only broad class of tractable chains suitable for stochastic models is the time-reversible class.

✦ Table of Contents


Front Matter....Pages i-xiii
Introduction and Summary....Pages 1-14
Discrete Time Markov Chains; Reversibility in Time....Pages 15-19
Markov Chains in Continuous Time; Uniformization; Reversibility....Pages 20-30
More on Time-Reversibility; Potential Coefficients; Process Modification....Pages 31-42
Potential Theory, Replacement, and Compensation....Pages 43-56
Passage Time Densities in Birth β€”Death Processes; Distribution Structure....Pages 57-75
Passage Times and Exit Times for More General Chains....Pages 76-104
The Fundamental Matrix, and Allied Topics....Pages 105-129
Rarity and Exponentiality....Pages 130-163
Stochastic Monotonicity....Pages 164-175
Back Matter....Pages 176-185

✦ Subjects


Mathematics, general


πŸ“œ SIMILAR VOLUMES


Markov Chain Models β€” Rarity and Exponen
✍ Julian Keilson (auth.), Julian Keilson (eds.) πŸ“‚ Library πŸ“… 1979 πŸ› Springer-Verlag New York 🌐 English

<p>in failure time distributions for systems modeled by finite chains. This introductory chapter attempts to provide an overΒ­ view of the material and ideas covered. The presentation is loose and fragmentary, and should be read lightly initially. Subsequent perusal from time to time may help tie the

Markov Chains: Models
✍ Wai-Ki Ching; Michael Kwok-Po Ng πŸ“‚ Library 🌐 English

MARKOV CHAINS: Models, Algorithms and Applications outlines recent developments of Markov chain models for modeling queueing sequences, Internet, re-manufacturing systems, reverse logistics, inventory systems, bio-informatics, DNA sequences, genetic networks, data mining, and many other practical sy

Markov Chains : Models, Algorithms and A
✍ Ching W.K., et al. πŸ“‚ Library πŸ“… 2013 πŸ› Springer 🌐 English

This new edition of Markov Chains: Models, Algorithms and Applications has been completely reformatted as a text, complete with end-of-chapter exercises, a new focus on management science, new applications of the models, and new examples with applications in financial risk management and modeling

Markov Chains: Models, Algorithms and Ap
✍ Wai-Ki Ching, Michael K. Ng (auth.) πŸ“‚ Library πŸ“… 2006 πŸ› Springer US 🌐 English

<P>Markov chains are a particularly powerful and widely used tool for analyzing a variety of stochastic (probabilistic) systems over time. This monograph will present a series of Markov models, starting from the basic models and then building up to higher-order models. Included in the higher-order d