1.

Record Nr.

UNINA9910300157403321

Autore

Stroock Daniel W

Titolo

An Introduction to Markov Processes / / by Daniel W. Stroock

Pubbl/distr/stampa

Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014

ISBN

3-642-40523-1

Edizione

[2nd ed. 2014.]

Descrizione fisica

1 online resource (xv, 203 pages )

Collana

Graduate Texts in Mathematics, , 0072-5285 ; ; 230

Disciplina

519.2

Soggetti

Probabilities

Dynamics

Ergodic theory

Probability Theory and Stochastic Processes

Dynamical Systems and Ergodic Theory

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Bibliographic Level Mode of Issuance: Monograph

Nota di bibliografia

Includes bibliographical references (page 199) and index.

Nota di contenuto

Preface -- Random Walks, a Good Place to Begin -- Doeblin's Theory for Markov Chains -- Stationary Probabilities -- More about the Ergodic Theory of Markov Chains -- Markov Processes in Continuous Time -- Reversible Markov Processes -- A minimal Introduction to Measure Theory -- Notation -- References -- Index.

Sommario/riassunto

This book provides a rigorous but elementary introduction to the theory of Markov Processes on a countable state space. It should be accessible to students with a solid undergraduate background in mathematics, including students from engineering, economics, physics, and biology. Topics covered are: Doeblin's theory, general ergodic properties, and continuous time processes. Applications are dispersed throughout the book. In addition, a whole chapter is devoted to reversible processes and the use of their associated Dirichlet forms to estimate the rate of convergence to equilibrium. These results are then applied to the analysis of the Metropolis (a.k.a simulated annealing) algorithm. 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.