An Introduction to Markov Processes
Daniel W. Stroock
Vendu par AHA-BUCH GmbH, Einbeck, Allemagne
Vendeur AbeBooks depuis 14 août 2006
Neuf(s) - Couverture souple
Etat : Neu
Quantité disponible : 1 disponible(s)
Ajouter au panierVendu par AHA-BUCH GmbH, Einbeck, Allemagne
Vendeur AbeBooks depuis 14 août 2006
Etat : Neu
Quantité disponible : 1 disponible(s)
Ajouter au panierDruck auf Anfrage Neuware - Printed after ordering - 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.
N° de réf. du vendeur 9783662517826
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.
Daniel Stroock has held positions at NYU, the University of Colorado, and MIT. In addition, he has visited and lectured at many universities throughout the world. He has authored several books on analysis and various aspects of probability theory and their application to partial differential equations and differential geometry.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Visitez la page d’accueil du vendeur
Conditions générales et informations client
I. Conditions générales
§ 1 Dispositions de base
(1) Les conditions générales suivantes s?appliquent à tous les contrats que vous concluez avec nous en tant que fournisseur (AHA-BUCH GmbH) via les plateformes Internet AbeBooks et/ou ZVAB. Sauf accord contraire, l?inclusion de l?une de vos propres conditions générales que vous utilisez sera contestée
(2) Un consommateur au sens des règlements suivants est toute personne physique qui conclut une transact...
Pour plus d'informationNous expédions votre commande après les avoir reçues
pour les articles disponibles au plus tard 24 heures,
pour les articles avec un approvisionnement de nuit au plus tard 48 heures.
Dans le cas où nous devons commander un article auprès de notre fournisseur, notre délai d’expédition dépend de la date de réception des articles, mais les articles seront expédiés le jour même.
Notre objectif est d’envoyer les articles commandés de la manière la plus rapide, mais aussi la plus efficace et la plus sécurisée à nos clients.