Combinatorics

Randolph Nelson
Additional contact information
Randolph Nelson: OTA Limited Partnership

Chapter 3 in Probability, Stochastic Processes, and Queueing Theory, 1995, pp 45-99 from Springer

Abstract: Abstract Probabilistic arguments can often be reduced to techniques where one enumerates all possibilities. These techniques are based on the Law of Total Probability and are most useful when there is a set of equally probable basic events and when events of interest consist of combinations of these basic events. In this chapter we focus on such enumerative techniques and derive formal counting techniques collectively called combinatorics. We define four different counting paradigms in Section 3.2,which are expressed in terms of selecting distinguishable balls from an urn or, equivalently, in terms of allocating indistinguishable balls to different urns. To derive expressions for the number of different possibilities for each counting paradigm, we establish recurrence relationships between the number of possibilities in the initial problem to that of a similar, but smaller, problem. This type of argument corresponds to partitioning the counting space into disjoint sets, which are smaller and easier to count.

Keywords: Generate Function; Power Series; Service Center; Power Series Expansion; Replacement Policy (search for similar items in EconPapers)
Date: 1995
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:sprchp:978-1-4757-2426-4_3

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

DOI: 10.1007/978-1-4757-2426-4_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().