TEST - Catálogo BURRF
   

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

Por: Colaborador(es): Tipo de material: TextoTextoSeries Graduate Texts in Mathematics ; 230Editor: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2014Edición: 2nd ed. 2014Descripción: xvii, 203 páginas recurso en líneaTipo de contenido:
  • texto
Tipo de medio:
  • computadora
Tipo de portador:
  • recurso en línea
ISBN:
  • 9783642405235
Formatos físicos adicionales: Edición impresa:: Sin títuloClasificación LoC:
  • QA273.A1-274.9
Recursos en línea:
Contenidos:
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.
Resumen: 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.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Springer eBooks

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.

Para consulta fuera de la UANL se requiere clave de acceso remoto.

Universidad Autónoma de Nuevo León
Secretaría de Extensión y Cultura - Dirección de Bibliotecas @
Soportado en Koha