Data Structures and Simple Algorithms

John H. Drew, Diane L. Evans, Andrew G. Glen and Lawrence M. Leemis
Additional contact information
John H. Drew: The College of William and Mary
Diane L. Evans: Rose-Hulman Institute of Technology
Andrew G. Glen: Colorado College
Lawrence M. Leemis: The College of William and Mary

Chapter 7 in Computational Probability, 2017, pp 89-109 from Springer

Abstract: 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.

Keywords: Probability Density Function; Cumulative Distribution Function; Hazard Function; Survivor Function; Minimum Support (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-319-43323-3_7

Ordering information: This item can be ordered from
http://www.springer.com/9783319433233

DOI: 10.1007/978-3-319-43323-3_7

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().