scientific article
From MaRDI portal
Publication:3322961
zbMath0537.60061MaRDI QIDQ3322961
John G. Kemeny, J. Laurie Snell
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory (60-01) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (33)
Fast reactions with non-interacting species in stochastic reaction networks ⋮ On Boyer-Moore automata ⋮ Understanding transitions in professors' evaluation: the application of Markov chain ⋮ Catch-Up: A Rule That Makes Service Sports More Competitive ⋮ Exact computation and approximation of stochastic and analytic parameters of generalized Sierpinski gaskets ⋮ Cycle frequency in standard rock-paper-scissors games: evidence from experimental economics ⋮ Collecting coupons on trees, and the cover time of random walks ⋮ An Extension of Foster's Network Theorem ⋮ Branching-time model-checking of probabilistic pushdown automata ⋮ Geometric reduction for identity testing of reversible Markov chains ⋮ Formally verified animation for RoboChart using interaction trees ⋮ Kemeny's constant and Wiener index on trees ⋮ Minimization of probabilistic models of programs ⋮ Longitudinal data analysis of mean passage time among malnutrition states: an application of Markov chains ⋮ Proof rules for the correctness of quantum programs ⋮ Steady-state analysis of probabilistic Boolean networks ⋮ Ranking nodes in general networks: a Markov multi-chain approach ⋮ The jump start power method: a new approach for computing the ergodic projector of a finite Markov chain ⋮ Performance evaluation of fault-tolerant routing algorithms: an optimization problem ⋮ Branching-Time Model-Checking of Probabilistic Pushdown Automata ⋮ Quantum loop programs ⋮ A discrete probability problem in card shuffling ⋮ Composition Markov chains of multinomial type ⋮ Iterates and invariant measures for Markov operators ⋮ Observational learning in large anonymous games ⋮ Switching problems with controlled randomisation and associated obliquely reflected BSDEs ⋮ The GI/M/1 queue with phase-type working vacations and vacation interruption ⋮ Link prediction techniques, applications, and performance: a survey ⋮ New evidence on market response to public announcements in the presence of microstructure noise ⋮ Limiting distribution of X-chromosomal coalescence times under first-cousin consanguineous mating ⋮ The Convergence of Bird Flocking ⋮ Parallel computing for Markov chains with islands and ports ⋮ Double coset Markov chains
This page was built for publication:
