✦ LIBER ✦

The minimum coefficient of ergodicity for a Markov chain with a given directed graph

✍ Scribed by Kirkland, Steve

Book ID: 121002975
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 724 KB
Volume: 447
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2013.06.036

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The minimum restricted edge-connected gr

The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree

✍ Yang, Weihua; Tian, Yingzhi; Li, Hengzhe; Li, Hao; Guo, Xiaofeng 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 419 KB

The minimum spectral radius of graphs wi

The minimum spectral radius of graphs with a given independence number

✍ Mimi Xu; Yuan Hong; Jinlong Shu; Mingqing Zhai 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 221 KB

The minimum order of a cayley graph with

The minimum order of a cayley graph with given degree and diameter

✍ Yahya Ould Hamidoune 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

On the Minimum Rank Among Positive Semid

On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph

✍ Booth, Matthew; Hackney, Philip; Harris, Benjamin; Johnson, Charles R.; Lay, Mar 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 152 KB

A Flow-Graph Formula for the Stationary

A Flow-Graph Formula for the Stationary Distribution of a Markov Chain

✍ Shubert, Bruno O. 📂 Article 📅 1975 🏛 Institute of Electrical and Electronics Engineers ⚖ 417 KB

A central limit theorem for the sojourn

A central limit theorem for the sojourn times of strongly ergodic Markov chains

✍ E. Bolthausen 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 486 KB