1#ifndef STAN_MATH_PRIM_PROB_NEG_BINOMIAL_RNG_HPP
2#define STAN_MATH_PRIM_PROB_NEG_BINOMIAL_RNG_HPP
9#include <boost/random/gamma_distribution.hpp>
10#include <boost/random/poisson_distribution.hpp>
11#include <boost/random/variate_generator.hpp>
34template <
typename T_shape,
typename T_inv,
class RNG>
36 const T_shape& alpha,
const T_inv&
beta, RNG& rng) {
37 using boost::gamma_distribution;
38 using boost::variate_generator;
39 using boost::random::poisson_distribution;
42 static constexpr const char* function =
"neg_binomial_rng";
44 "Inverse scale Parameter",
beta);
45 T_alpha_ref alpha_ref = alpha;
46 T_beta_ref beta_ref =
beta;
55 for (
size_t n = 0; n < N; ++n) {
56 double rng_from_gamma = variate_generator<RNG&, gamma_distribution<> >(
57 rng, gamma_distribution<>(alpha_vec[n], 1.0 / beta_vec[n]))();
60 check_less(function,
"Random number that came from gamma distribution",
62 check_not_nan(function,
"Random number that came from gamma distribution",
65 "Random number that came from gamma distribution",
68 output[n] = variate_generator<RNG&, poisson_distribution<> >(
69 rng, poisson_distribution<>(rng_from_gamma))();
typename helper::type type
VectorBuilder allocates type T1 values to be used as intermediate values.
scalar_seq_view provides a uniform sequence-like wrapper around either a scalar or a sequence of scal...
VectorBuilder< true, int, T_shape, T_inv >::type neg_binomial_rng(const T_shape &alpha, const T_inv &beta, RNG &rng)
Return a negative binomial random variate with the specified shape and inverse scale parameters using...
void check_nonnegative(const char *function, const char *name, const T_y &y)
Check if y is non-negative.
const double POISSON_MAX_RATE
Largest rate parameter allowed in Poisson RNG.
void check_consistent_sizes(const char *)
Trivial no input case, this function is a no-op.
void check_not_nan(const char *function, const char *name, const T_y &y)
Check if y is not NaN.
void check_less(const char *function, const char *name, const T_y &y, const T_high &high, Idxs... idxs)
Throw an exception if y is not strictly less than high.
int64_t max_size(const T1 &x1, const Ts &... xs)
Calculate the size of the largest input.
fvar< T > beta(const fvar< T > &x1, const fvar< T > &x2)
Return fvar with the beta function applied to the specified arguments and its gradient.
void check_positive_finite(const char *function, const char *name, const T_y &y)
Check if y is positive and finite.
typename ref_type_if< true, T >::type ref_type_t
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...