Approximating countable Markov chains Freedman David
Material type:
TextLanguage: English Series: Holden-Day series in probability and statisticsPublication details: San Francisco Holden-Day 1972Description: x, 140p. cmSubject(s): DDC classification: - B281N07, L21
| Item type | Current library | Home library | Call number | Status | Barcode | |
|---|---|---|---|---|---|---|
Textual
|
Central Science Library | Central Science Library | B281N07 L21 (Browse shelf(Opens below)) | Available | SL0533248 |
Browsing Central Science Library shelves Close shelf browser (Hides shelf browser)
| B281N07 L2 Numerical methods in Markov chains and bulk queues | B281N07 L2-;1 Regenerative phenomena | B281N07 L2-;1 Regenerative phenomena | B281N07 L21 Approximating countable Markov chains | B281N07 L21;1 Approximating countable Markov chain | B281N07 L4 Gibbs states on countable sets | B281N07 L41 Symmetric Markov processes |
There are no comments on this title.
Log in to your account to post a comment.