Computer generation of generalized negative binomial deviates

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


The generalized negative binomial distribution (GNBD) has been found useful in many fields of study such as random walk, queueing theory, branching processes and polymerization reaction in chemistry. In this paper, some methods of sampling from the GNBD are presented. The inversion algorithm, rejection algorithm, and branching algorithm are compared. In one region of the parameter space, the branching algorithm is the fastest and in another region, the inversion algorithm provides the fastest times.

Original languageEnglish
Pages (from-to)107-122
Number of pages16
JournalJournal of Statistical Computation and Simulation
Issue number2
StatePublished - 1998


  • Algorithms
  • Branching process
  • Inversion method
  • Rejection method


Dive into the research topics of 'Computer generation of generalized negative binomial deviates'. Together they form a unique fingerprint.

Cite this