Combinatorial Methods

ISBN-13: 9780471680277 / Angielski / Twarda / 2005 / 440 str.

Charalambos A. Charalambides

Opis

Combinatorial Methods in Discrete Distributions provides the necessary combinatorial methods in the theory of discrete distributions, including basic enumerative techniques, finite differences, Stirling numbers, and partition polynomials. Exploiting the method of reduction of the joint distribution of the random occupancy numbers to the joint distribution of independent random variables, given their sum, the book presents elaborate and systematic treatment of occupancy distributions, convolutions of truncated discrete distributions and compound (generalized) discrete distributions.

Recenzje

"Highly recommended." ( CHOICE, January 2006)

" a valuable and up–to–date account on Sterling numbers and occupancy distributions." (Mathematical Reviews, 2006c)

Spis treści

Preface.

1. Basic Combinatorics and Probability.

2. Stirling Numbers.

3. Generalized Stirlized and LAH Numbers.

4. Occupancy Distributions.

5. Sequential Occupancy Distributions.

6. Convolutions of Truncated Distributions.

7. Compound and Mixture Distributions.

Appendix: Hints and Answers to Exercises.

References.

Author Index.

Subject Index.

O autorze

CHARALAMBOS A. CHARALAMBIDES, PHD, is a Professor in the Department of Mathematics, University of Athens, Greece. He is Associate Editor of Communications in Statistics, author of Enumerative Combinatorics, and an elected member of the International Statistical Institute.

Blurb

A unique approach illustrating discrete distribution theory through combinatorial methods

This book provides a unique approach by presenting combinatorial methods in tandem with discrete distribution theory. This method, particular to discreteness, allows readers to gain a deeper understanding of theory by using applications to solve problems. The author makes extensive use of the reduction approach to conditional distributions of independent random occupancy numbers, and provides excellent studies of occupancy and sequential occupancy distributions, convolutions of truncated discrete distributions, and compound and mixture distributions.

Combinatorial Methods in Discrete Distributions begins with a brief presentation of set theory followed by basic counting principles. Fundamental principles of combinatorics, finite differences, and discrete probability are included to give readers the necessary foundation to the topics presented in the text.

A thorough examination of the field is provided and features:

• Stirling numbers and generalized factorial coefficients
• Occupancy and sequential occupancy distributions
• n–fold convolutions of truncated distributions
• Compound and mixture distributions

Thoroughly worked examples aid readers in understanding complex theory and discovering how theory can be applied to solve practical problems. An appendix with hints and answers to the exercises helps readers work through the more complex sections. Reference notes are provided at the end of each chapter, and an extensive bibliography offers readers a resource for additional information on specialized topics.