Library Services | Technical University of Kenya

Your cart is empty.
Normal view MARC view ISBD view

An Introduction to Markov Processes [electronic resource] / by Daniel W. Stroock.

By: Stroock, Daniel W [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Graduate Texts in Mathematics: 230Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2014Edition: 2nd ed. 2014.Description: XVII, 203 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642405235.Subject(s): Mathematics | Differentiable dynamical systems | Distribution (Probability theory) | Mathematics | Probability Theory and Stochastic Processes | Dynamical Systems and Ergodic TheoryDDC classification: 519.2 Online resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

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.

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.

There are no comments for this item.

Log in to your account to post a comment.

2017 | The Technical University of Kenya Library | +254(020) 2219929, 3341639, 3343672 | library@tukenya.ac.ke | Haile Selassie Avenue