| 書(shū)目名稱(chēng) | Introduction to Markov Chains |
| 副標(biāo)題 | With Special Emphasi |
| 編輯 | Ehrhard Behrends |
| 視頻video | http://file.papertrans.cn/474/473862/473862.mp4 |
| 概述 | Aktuelles aus der Theorie der Markovketten |
| 叢書(shū)名稱(chēng) | Advanced Lectures in Mathematics |
| 圖書(shū)封面 |  |
| 描述 | The aims of this book are threefold:.We start with a naive description of a Markov chain as a memoryless random walk on a finite set. This is complemented by a rigorous definition in the framework of probability theory, and then we develop the most important results from the theory of homogeneous Markov chains on finite state spaces..Chains are called rapidly mixing if all of the associated walks, regardles of where they started, behave similarly already after comparitively few steps: it is impossible from observing the chain to get information on the starting position or the number of steps done so far. We will thoroughly study methods which have been proposed in the last decades to investigate this phenomenon..A number of examples will be studied to indicate how the methods treated in this book can be applied.. |
| 出版日期 | Textbook 2000 |
| 關(guān)鍵詞 | Counting; Finite; Markowsche Kette; Mathematische Statistik; Wahrscheinlichkeitstheorie; calculus |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-322-90157-6 |
| isbn_softcover | 978-3-528-06986-5 |
| isbn_ebook | 978-3-322-90157-6Series ISSN 0932-7134 Series E-ISSN 2512-7039 |
| issn_series | 0932-7134 |
| copyright | Springer Fachmedien Wiesbaden 2000 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-6 13:11
發(fā)表于 2025-3-21 19:03:19
