๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Markov chains on a matrix group

โœ Scribed by I. V. Evstigneev

Publisher
SP MAIK Nauka/Interperiodica
Year
1971
Tongue
English
Weight
221 KB
Volume
10
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the numerical solution of a nonlinear
On the numerical solution of a nonlinear matrix equation in Markov chains
โœ Chun-Hua Guo ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 786 KB

We consider iterative methods for t;le minimal nonnegativc :~oiu)i()n of the matrix equation G = ~, (), ,G', where the matrices ,4, are nonnegative and \'~ ,)..I, is stocha:4ic. Convergence theory lbr an 'inversion frec algorithm is established. The convergence rale of this algorithm is sho,s'.i ~o

A note on circular Markov chains
A note on circular Markov chains
โœ Josรฉ Luis Palacios ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 70 KB

Using the electric network approach, we give closed-form formulas for the stationary probabilities and expected hitting times in balanced circular Markov chains. As an application, we give a closed-form formula for the duration of play in the general ruin problem, where the probabilities of winning

A Markov chain on the symmetric group an
A Markov chain on the symmetric group and Jack symmetric functions
โœ Phil Hanlon ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 872 KB

Hanlon, P., A Markov chain on the symmetric group and Jack symmetric functions, Discrete Mathematics 99 (1992) 123-140. Diaconis and Shahshahani studied a Markov chain Wf(l) whose states are the elements of the symmetric group S,. In W,(l), you move from a permutation n to any permutation of the for