Automatic Differentiation
 
Loading...
Searching...
No Matches
neg_binomial_2_rng.hpp
Go to the documentation of this file.
1#ifndef STAN_MATH_PRIM_PROB_NEG_BINOMIAL_2_RNG_HPP
2#define STAN_MATH_PRIM_PROB_NEG_BINOMIAL_2_RNG_HPP
3
9#include <boost/random/gamma_distribution.hpp>
10#include <boost/random/poisson_distribution.hpp>
11#include <boost/random/variate_generator.hpp>
12
13namespace stan {
14namespace math {
15
34template <typename T_loc, typename T_prec, class RNG>
36neg_binomial_2_rng(const T_loc& mu, const T_prec& phi, RNG& rng) {
37 using boost::gamma_distribution;
38 using boost::variate_generator;
39 using boost::random::poisson_distribution;
40 using T_mu_ref = ref_type_t<T_loc>;
41 using T_phi_ref = ref_type_t<T_prec>;
42 static constexpr const char* function = "neg_binomial_2_rng";
43 check_consistent_sizes(function, "Location parameter", mu,
44 "Precision parameter", phi);
45 T_mu_ref mu_ref = mu;
46 T_phi_ref phi_ref = phi;
47 check_positive_finite(function, "Location parameter", mu_ref);
48 check_positive_finite(function, "Precision parameter", phi_ref);
49
50 scalar_seq_view<T_mu_ref> mu_vec(mu_ref);
51 scalar_seq_view<T_phi_ref> phi_vec(phi_ref);
52 size_t N = max_size(mu, phi);
54
55 for (size_t n = 0; n < N; ++n) {
56 double mu_div_phi = static_cast<double>(mu_vec[n]) / phi_vec[n];
57
58 // gamma_rng params must be positive and finite
59 check_positive_finite(function,
60 "Location parameter divided by the "
61 "precision parameter",
62 mu_div_phi);
63
64 double rng_from_gamma = variate_generator<RNG&, gamma_distribution<> >(
65 rng, gamma_distribution<>(phi_vec[n], mu_div_phi))();
66
67 // same as the constraints for poisson_rng
68 check_less(function, "Random number that came from gamma distribution",
69 rng_from_gamma, POISSON_MAX_RATE);
70 check_not_nan(function, "Random number that came from gamma distribution",
71 rng_from_gamma);
72 check_nonnegative(function,
73 "Random number that came from gamma distribution",
74 rng_from_gamma);
75
76 output[n] = variate_generator<RNG&, poisson_distribution<> >(
77 rng, poisson_distribution<>(rng_from_gamma))();
78 }
79
80 return output.data();
81}
82
83} // namespace math
84} // namespace stan
85#endif
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_loc, T_prec >::type neg_binomial_2_rng(const T_loc &mu, const T_prec &phi, RNG &rng)
Return a negative binomial random variate with the specified location and precision parameters using ...
size_t max_size(const T1 &x1, const Ts &... xs)
Calculate the size of the largest input.
Definition max_size.hpp:19
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.
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
Definition ref_type.hpp:55
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...
Definition fvar.hpp:9