Picture 1 of 1

Stock photo

Probability, Markov Chains, Queues, and Simulation: The Mathematical Basis of - Picture 1 of 1

Probability, Markov Chains, Queues, and Simulation : The Mathematical Basis of Performance Modeling by William J. Stewart (2009, Hardcover)

AlibrisBooks (485638)

99% positive Feedback

Price:

US $159.74

Approximately£119.87

+ $22.86 postage

Estimated delivery Tue, 11 Nov - Tue, 18 Nov

Returns:

30 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount.

Condition:

New

New Hard cover

About this product

Product Identifiers

PublisherPrinceton University Press

ISBN-100691140626

ISBN-139780691140629

eBay Product ID (ePID)70956573

Product Key Features

Number of Pages776 Pages

LanguageEnglish

Publication NameProbability, Markov Chains, Queues, and Simulation : the Mathematical Basis of Performance Modeling

SubjectData Modeling & Design, Probability & Statistics / Stochastic Processes, Probability & Statistics / General, Applied

Publication Year2009

TypeTextbook

Subject AreaMathematics, Computers

AuthorWilliam J. Stewart

FormatHardcover

Dimensions

Item Height2 in

Item Weight52.1 Oz

Item Length10.3 in

Item Width7.4 in

Additional Product Features

Intended AudienceCollege Audience

LCCN2008-041122

Dewey Edition22

ReviewsThe book represents a valuable text for courses in statistics and stochastic processes, so it is strongly recommended to libraries. ---Hassan S. Bakouch, Journal of Applied Statistics, "Clear and pleasant to read, this book distinguishes itself from comparable textbooks by its inclusion of the computational aspects of the material." --Richard R. Muntz, University of California, Los Angeles, The book represents a valuable text for courses in statistics and stochastic processes, so it is strongly recommended to libraries. -- Hassan S. Bakouch, Journal of Applied Statistics, "The book represents a valuable text for courses in statistics and stochastic processes, so it is strongly recommended to libraries."-- Hassan S. Bakouch, Journal of Applied Statistics, "This is an excellent book on the topics of probability, Markov chains, and queuing theory. Extremely well-written, the contents range from elementary topics to quite advanced material and include plenty of well-chosen examples." --Adarsh Sethi, University of Delaware, "The book represents a valuable text for courses in statistics and stochastic processes, so it is strongly recommended to libraries." --Hassan S. Bakouch, Journal of Applied Statistics, The book represents a valuable text for courses in statistics and stochastic processes, so it is strongly recommended to libraries.

IllustratedYes

Dewey Decimal519.201/13

SynopsisProbability, Markov Chains, Queues, and Simulation provides a modern and authoritative treatment of the mathematical processes that underlie performance modeling. The detailed explanations of mathematical derivations and numerous illustrative examples make this textbook readily accessible to graduate and advanced undergraduate students taking courses in which stochastic processes play a fundamental role. The textbook is relevant to a wide variety of fields, including computer science, engineering, operations research, statistics, and mathematics. The textbook looks at the fundamentals of probability theory, from the basic concepts of set-based probability, through probability distributions, to bounds, limit theorems, and the laws of large numbers. Discrete and continuous-time Markov chains are analyzed from a theoretical and computational point of view. Topics include the Chapman-Kolmogorov equations; irreducibility; the potential, fundamental, and reachability matrices; random walk problems; reversibility; renewal processes; and the numerical computation of stationary and transient distributions.The M/M/1 queue and its extensions to more general birth-death processes are analyzed in detail, as are queues with phase-type arrival and service processes. The M/G/1 and G/M/1 queues are solved using embedded Markov chains; the busy period, residual service time, and priority scheduling are treated. Open and closed queueing networks are analyzed. The final part of the book addresses the mathematical basis of simulation. Each chapter of the textbook concludes with an extensive set of exercises. An instructor's solution manual, in which all exercises are completely worked out, is also available (to professors only). * Numerous examples illuminate the mathematical theories * Carefully detailed explanations of mathematical derivations guarantee a valuable pedagogical approach * Each chapter concludes with an extensive set of exercises, Offers a modern and authoritative treatment of the mathematical processes that underlie performance modeling. This book looks at the fundamentals of probability theory, from the basic concepts of set-based probability, through probability distributions, to bounds, limit theorems, and the laws of large numbers., Probability, Markov Chains, Queues, and Simulation provides a modern and authoritative treatment of the mathematical processes that underlie performance modeling. The detailed explanations of mathematical derivations and numerous illustrative examples make this textbook readily accessible to graduate and advanced undergraduate students taking courses in which stochastic processes play a fundamental role. The textbook is relevant to a wide variety of fields, including computer science, engineering, operations research, statistics, and mathematics. The textbook looks at the fundamentals of probability theory, from the basic concepts of set-based probability, through probability distributions, to bounds, limit theorems, and the laws of large numbers. Discrete and continuous-time Markov chains are analyzed from a theoretical and computational point of view. Topics include the Chapman-Kolmogorov equations; irreducibility; the potential, fundamental, and reachability matrices; random walk problems; reversibility; renewal processes; and the numerical computation of stationary and transient distributions. The M/M/1 queue and its extensions to more general birth-death processes are analyzed in detail, as are queues with phase-type arrival and service processes. The M/G/1 and G/M/1 queues are solved using embedded Markov chains; the busy period, residual service time, and priority scheduling are treated. Open and closed queueing networks are analyzed. The final part of the book addresses the mathematical basis of simulation. Each chapter of the textbook concludes with an extensive set of exercises. An instructor's solution manual, in which all exercises are completely worked out, is also available (to professors only). Numerous examples illuminate the mathematical theories Carefully detailed explanations of mathematical derivations guarantee a valuable pedagogical approach Each chapter concludes with an extensive set of exercises

LC Classification NumberQA273.S7532 2009