An Introduction to Markov Processes: Graduate Texts in Mathematics, cartea 230
Autor Daniel W. Stroocken Limba Engleză Hardback – 8 noi 2013
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.
Din seria Graduate Texts in Mathematics
- 13%
Preț: 407.97 lei -
Preț: 402.84 lei -
Preț: 526.10 lei - 15%
Preț: 414.37 lei - 15%
Preț: 403.03 lei - 15%
Preț: 413.96 lei - 15%
Preț: 530.03 lei - 15%
Preț: 449.14 lei - 15%
Preț: 532.83 lei - 15%
Preț: 530.66 lei - 15%
Preț: 501.17 lei - 15%
Preț: 546.10 lei - 17%
Preț: 415.26 lei -
Preț: 446.38 lei - 15%
Preț: 579.99 lei -
Preț: 381.34 lei - 15%
Preț: 460.27 lei - 15%
Preț: 564.00 lei - 17%
Preț: 453.24 lei - 15%
Preț: 590.39 lei -
Preț: 500.30 lei -
Preț: 456.39 lei -
Preț: 386.90 lei - 15%
Preț: 614.52 lei - 15%
Preț: 477.57 lei -
Preț: 460.05 lei - 15%
Preț: 498.36 lei -
Preț: 504.56 lei - 18%
Preț: 808.24 lei -
Preț: 472.04 lei - 15%
Preț: 621.81 lei -
Preț: 398.40 lei - 15%
Preț: 656.51 lei - 15%
Preț: 608.90 lei - 15%
Preț: 531.78 lei
Preț: 474.27 lei
Preț vechi: 515.51 lei
-8%
Puncte Express: 711
Carte indisponibilă temporar
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783642405228
ISBN-10: 3642405223
Pagini: 224
Ilustrații: XVII, 203 p.
Dimensiuni: 160 x 241 x 18 mm
Greutate: 0.45 kg
Ediția:2nd edition 2014
Editura: Springer
Colecția Graduate Texts in Mathematics
Seria Graduate Texts in Mathematics
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642405223
Pagini: 224
Ilustrații: XVII, 203 p.
Dimensiuni: 160 x 241 x 18 mm
Greutate: 0.45 kg
Ediția:2nd edition 2014
Editura: Springer
Colecția Graduate Texts in Mathematics
Seria Graduate Texts in Mathematics
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
GraduateCuprins
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.
Notă biografică
Daniel W. Stroock is Emeritus professor of mathematics at MIT. He is a respected mathematician in the areas of analysis, probability theory and stochastic processes. Prof. Stroock has had an active career in both the research and education. From 2002 until 2006, he was the first holder of the second Simons Professorship of Mathematics. In addition, he has held several administrative posts, some within the university and others outside. In 1996, the AMS awarded him together with his former colleague jointly S.R.S. Varadhan the Leroy P. Steele Prize for seminal contributions to research in stochastic processes. Finally, he is a member of both the American Academy of Arts and Sciences, the National Academy of Sciences and a foreign member of the Polish Academy of Arts and Sciences.
Textul de pe ultima copertă
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.
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.
Caracteristici
Corrected and enlarged 2nd edition Written by an expert Includes new material Includes supplementary material: sn.pub/extras