The corrected and enlarged 2nd edition contains a new chapter in which the author develops computational methods for Markov chains on a finite state space. Most intriguing is the section with a new technique for computing stationary measures, which is applied to derivations of Wilson's algorithm and Kirchoff's formula for spanning trees in a connected graph.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
"The book under review ... provides an excellent introduction to the theory of Markov processes ... . An abstract mathematical setting is given in which Markov processes are then defined and thoroughly studied. Because of this the book will basically be of interest to mathematicians and those who have at least a good knowledge of undergraduate analysis and probability theory. ... The proofs are clearly written and explanations are not too concise which makes this book indeed very useful for a graduate course." (Stefaan De Winter, Bulletin of the Belgian Mathematical Society, Vol. 15 (1), 2008)