Cantitate/Preț
Produs

An Introduction to Markov Processes: Graduate Texts in Mathematics, cartea 230

Autor Daniel W. Stroock
en Limba Engleză Paperback – 30 mar 2005
To some extent, it would be accurate to summarize the contents of this book as an intolerably protracted description of what happens when either one raises a transition probability matrix P (i. e. , all entries (P)»j are n- negative and each row of P sums to 1) to higher and higher powers or one exponentiates R(P — I), where R is a diagonal matrix with non-negative entries. Indeed, when it comes right down to it, that is all that is done in this book. However, I, and others of my ilk, would take offense at such a dismissive characterization of the theory of Markov chains and processes with values in a countable state space, and a primary goal of mine in writing this book was to convince its readers that our offense would be warranted. The reason why I, and others of my persuasion, refuse to consider the theory here as no more than a subset of matrix theory is that to do so is to ignore the pervasive role that probability plays throughout. Namely, probability theory provides a model which both motivates and provides a context for what we are doing with these matrices. To wit, even the term "transition probability matrix" lends meaning to an otherwise rather peculiar set of hypotheses to make about a matrix.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 39800 lei  38-44 zile
  Springer Berlin, Heidelberg – 23 aug 2016 39800 lei  38-44 zile
  Springer Berlin, Heidelberg – 30 mar 2005 44070 lei  6-8 săpt.
Hardback (1) 45353 lei  38-44 zile
  Springer Berlin, Heidelberg – 8 noi 2013 45353 lei  38-44 zile

Din seria Graduate Texts in Mathematics

Preț: 44070 lei

Nou

Puncte Express: 661

Preț estimativ în valută:
8443 8889$ 6969£

Carte tipărită la comandă

Livrare economică 22 ianuarie-05 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540234517
ISBN-10: 3540234519
Pagini: 196
Ilustrații: XIV, 178 p.
Dimensiuni: 155 x 233 x 10 mm
Greutate: 0.3 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Graduate Texts in Mathematics

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Graduate

Cuprins

Random Walks A Good Place to Begin.- Doeblin's Theory for Markov Chains.- More about the Ergodic Theory of Markov Chains.- Markov Processes in Continuous Time.- Reversible Markov Processes.- Some Mild Measure Theory.

Recenzii

From the reviews:
“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)

Notă biografică

The author has held positions at NYU, the Univresity of Colorado, and MIT. In addition, he has visited and lectured at many universities throughout the world. He has authored several book bout various aspects of probability theory.

Caracteristici

Includes supplementary material: sn.pub/extras

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.