
Algorithmic Probability
A Collection of Problems
Marcel F. Neuts(Author)
Thomson Learning (Publisher)
1st Edition
Published on 1. July 1995
Book
Hardback
472 pages
978-0-412-99691-7 (ISBN)
Description
This unique text collects more than 400 problems in combinatorics, derived distributions, discrete and continuous Markov chains, and models requiring a computer experimental approach. The first book to deal with simplified versions of models encountered in the contemporary statistical or engineering literature, Algorithmic Probability emphasizes correct interpretation of numerical results and visualization of the dynamics of stochastic processes.
A significant contribution to the field of applied probability, Algorithmic Probability is ideal both as a secondary text in probability courses and as a reference. Engineers and operations analysts seeking solutions to practical problems will find it a valuable resource, as will advanced undergraduate and graduate students in mathematics, statistics, operations research, industrial and electrical engineering, and computer science.
A significant contribution to the field of applied probability, Algorithmic Probability is ideal both as a secondary text in probability courses and as a reference. Engineers and operations analysts seeking solutions to practical problems will find it a valuable resource, as will advanced undergraduate and graduate students in mathematics, statistics, operations research, industrial and electrical engineering, and computer science.
More details
Series
Language
English
Place of publication
London
United Kingdom
Publishing group
Bloomsbury Publishing PLC
Target group
Professional and scholarly
College/higher education
Professional
Dimensions
Height: 280 mm
Width: 210 mm
Weight
907 gr
ISBN-13
978-0-412-99691-7 (9780412996917)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Persons
Neuts, Marcel F.
Content
Preface. Computational Probability: An Introduction. Solving Equations. Functions of Random Variables. Discrete-Time Markov Chains. Continuous-Time Markov Chains. Experimentation and Visualization. References. Appendix 1: Some Topics from Matrix Analysis. Appendix 2: Phase-Type Distibutions. Appendix 3: The Markovian Arrival Process. Solution to Selected Problems. Index