Abstract
In the last decades of the twientieth century an area has developed studying the properties and uses of large random structures. Probability naturally plays a central role in these investigations but it is probability of a somewhat special sort. First of all, the objects are finite. This removes questions of measurability that so bedevil many probabilists. Second of all, the objects are large. One is interested in the asymptotics as the size (here n) of the random object goes to infinity. Thus one is rarely interested [and can rarely obtain] exact forms for the relevant probabilities but instead is very interested in their asymptotics. Indeed, even the asymptotics can prove to be difficult in which case one struggles with improving lower and upper bounds.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Noga Alon, Joel Spencer: The Probabilistic Method, 2nd Edition. John Wiley, 2000
Béla Bollobás: Random Graphs. Academic Press, 1985
Svante Janson, Tomasz Luczak, Andrzej Rucinski: Random Graphs. John Wiley, 2000
Rajeev Motwani, Prabakar Raghavan: Randomized Algorithms. Cambridge University Press, 1995
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Spencer, J. (2001). Discrete Probability. In: Engquist, B., Schmid, W. (eds) Mathematics Unlimited — 2001 and Beyond. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56478-9_56
Download citation
DOI: https://doi.org/10.1007/978-3-642-56478-9_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63114-6
Online ISBN: 978-3-642-56478-9
eBook Packages: Springer Book Archive