b b b b
Solutions Manual b
Third Edition b
cb Peterb Wb Jonesb andb Peterb Smith
⃝
SchoolbofbComputingbandbMathematics,bKeelebUniversity,bUK
, Preface
Thebwebsitebincludesbanswersbandbsolutionsbofballbthebend-of-
chapterbproblemsbinbthebtextbookbStochasticbProcesses:bAnbIntroduction,bthirdbedition.b Webho
pebthatbtheybwillbprovebhelpfulbtoblecturersbinb designingbcourses,b andb tob studentsb asb ab sourcebofbmo
delb examples.b Theb originalbproblemsbasbnumberedbinbthebtextbarebalsobincluded.
Therebarebobviouslybreferencesbtobresultsbandbexamplesbfrombthebtextbook,bandbthebmanualbsho
uldbbebviewedbasbabsupplementbtobthebbook.b Tobhelpbidentifybthebsectionsbandbchapters,bthebfullbco
ntentsbofbStochasticbProcessesbfollowbthisbpreface.
Everybeffortbhasbbeenbmadebtobeliminatebmisprintsborberrorsb(orbworse),bandbthebauthors,bwhob
werebresponsiblebforbthebLaTeXbcode,bapologisebinbadvancebforbanybwhichboccur.
Peterb W.b Jones
Peterb Smith Keele,b 2017
1
, Contents of Stochastic Processes
b b b
Chapterb 1:b Someb Backgroundb inb Probability
1.1 Introduction
1.2 Probability
1.3 Conditionalb probabilityb andb independence
1.4 Discreteb randomb variables
1.5 Continuousb randomb variables
1.6 Meanb andb variance
1.7 Someb standardb discreteb probabilityb distributions
1.8 Someb standardb continuousb probabilityb distributions
1.9 Generatingb functions
1.10 Conditionalbexpectation
bProblems
Chapterb 2:b Someb Gamblingb Problems
2.1 Gambler’sb ruin
2.2 Probabilitybofb ruin
2.3 Someb numericalbsimulations
2.4 Expectedb durationb ofb theb game
2.5 Someb variationsbofbgambler’sbruin
2.5.1 Theb infinitelyb richb opponent
2.5.2 Theb generousb gambler
2.5.3 Changingbthebstakes
bProblems
Chapterb 3:b Randomb Walks
3.1 Introduction
3.2 Unrestrictedb randomb walks
3.3 Probabilitybdistributionb afterbnb steps
3.4 Firstbreturnsbofbthebsymmetricbrandombwalkb
Problems
Chapterb 4:b Markovb Chains
4.1 Statesb andb transitions
4.2 Transitionb probabilities
4.3 Generalb two-stateb Markovb chain
4.4 Powersb ofb theb transitionb matrixb forb theb m-stateb chain
4.5 Gambler’sb ruinb asb ab Markovb chain
4.6 Classificationb ofb states
4.7 Classificationb ofb chains
4.8 AbwildlifebMarkovbchainbmodel
bProblems
Chapterb 5:b Poissonb Processes
5.1 Introduction
5.2 Theb Poissonb process
5.3 Partitionb theoremb approach
5.4 Iterativeb method
5.5 Theb generatingb function
5.6 Varianceb forb theb Poissonb process
2
, 5.7 Arrivalb times
5.8 SummarybofbthebPoissonbprocess
bProblems
Chapterb 6:b Birthb andb Deathb Processes
6.1 Introduction
6.2 Theb birthb process
6.3 Birthb process:b generatingb functionb equation
6.4 Theb deathb process
6.5 Theb combinedb birthb andb deathb process
6.6 Generalbpopulationbprocesses
bProblems
Chapterb 7:b Queues
7.1 Introduction
7.2 Theb singleb serverb queue
7.3 Theb stationaryb process
7.4 Queuesb withb multipleb servers
7.5 Queuesb withb fixedb serviceb times
7.6 Classificationbofbqueues
bProblems
Chapterb 8:b Reliabilityb andb Renewal
8.1 Introduction
8.2 Theb reliabilityb function
8.3 Theb exponentialb distributionb andb reliability
8.4 Meanb timeb tob failure
8.5 Reliabilityb ofb seriesb andb parallelb systems
8.6 Renewalb processes
8.7 Expectedbnumberbofbrenewalsb
Problems
Chapterb 9:b Branchingb andb Otherb Randomb Processes
9.1 Introduction
9.2 Generationalb growth
9.3 Meanb andb variance
9.4 Probabilityb ofb extinction
9.5 Branchingb processesb andb martingales
9.6 Stoppingb rules
9.7 Abcontinuousbtimebepidemic
9.8 Ab discreteb timeb epidemicb model
9.9 Deterministicb epidemicb models
9.10 Anbiterativebschemebforbthebsimplebepidemic
bProblems
Chapterb 10:b Brownianb Motion:b Wienerb Process
10.1 Introduction
10.2 Brownianb motion
10.3 Wienerb processb asb ab limitb ofb ab randomb walk
10.4 Brownianb motionb withb drift
10.5 Scaling
10.6 Firstb visitb times
3