Combinatorial Methods in Discrete Distrbutions

Charalambos A. Charalambides - Collection Wiley-Interscience

416 pages, parution le 20/06/2005

Ajouter à une liste

Indisponible

Résumé

Commencing with an introductory chapter on combinatorial, finite differences and probabilistic fundamental background, this book provides a self-contained reference for the area. This volume provides the necessary combinatorial methods in the theory of discrete distributions, including basic enumerative techniques, finite differences, Stirling numbers and partition polynomials. Key features include:

Numerous worked examples
Provides a rich collection of exercises of varying difficulty, which help to consolidate the concepts and results being presented, while others complement, extend or generalize some of the results
An extensive bibliography refers readers to multiple sources of interest
Reference notes are included at the end of each chapter to inform on the original contribution

L'auteur - Charalambos A. Charalambides

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.

Sommaire

Preface
Basic Combinatorics and Probability
Stirling Numbers
Generalized Stirlized and LAH Numbers
Occupancy Distributions
Sequential Occupancy Distributions
Convolutions of Truncated Distributions
Compound and Mixture Distributions
Appendix: Hints and Answers to Exercises
References
Author Index
Subject Index

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Wiley
Auteur(s)	Charalambos A. Charalambides
Collection	Wiley-Interscience
Parution	20/06/2005
Nb. de pages	416
Format	16 x 24
Couverture	Relié
Poids	689g
Intérieur	Noir et Blanc
EAN13	9780471680277
ISBN13	978-0-471-68027-7