Abstract
This chapter introduces the data structures necessary to define a discrete random variable in APPL and surveys some simple algorithms associated with discrete random variables. The first section will show that the nature of the support of discrete random variables makes the data structures required much more complicated than for continuous random variables.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Benford F (1938) The law of anomalous numbers. Proc Am Philos Soc 78: 551–572
Hogg RV, McKean JW, Craig AT (2005) Introduction to the mathematical statistics, 6th edn. Prentice-Hall, Upper Saddle River, New Jersey
Karian ZA, Tanis EA (1999) Probability and statistics: explorations with Maple, 2nd edn. Prentice-Hall, Upper Saddle River, New Jersey
Leemis L (1995) Reliability: probabilistic models and statistical methods. Prentice-Hall, Upper Saddle River, New Jersey
Ross S (2006) A first course in probability, 7th edn. Prentice Hall, Upper Saddle River, New Jersey
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Drew, J.H., Evans, D.L., Glen, A.G., Leemis, L.M. (2017). Data Structures and Simple Algorithms. In: Computational Probability. International Series in Operations Research & Management Science, vol 246. Springer, Cham. https://doi.org/10.1007/978-3-319-43323-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-43323-3_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-43321-9
Online ISBN: 978-3-319-43323-3
eBook Packages: Business and ManagementBusiness and Management (R0)