Automatic Differentiation
 
Loading...
Searching...
No Matches
neg_binomial_2_log_rng.hpp
Go to the documentation of this file.
1#ifndef STAN_MATH_PRIM_PROB_NEG_BINOMIAL_2_LOG_RNG_HPP
2#define STAN_MATH_PRIM_PROB_NEG_BINOMIAL_2_LOG_RNG_HPP
3
10#include <boost/random/gamma_distribution.hpp>
11#include <boost/random/poisson_distribution.hpp>
12#include <boost/random/variate_generator.hpp>
13#include <cmath>
14
15namespace stan {
16namespace math {
17
36template <typename T_loc, typename T_inv, class RNG>
38neg_binomial_2_log_rng(const T_loc& eta, const T_inv& phi, RNG& rng) {
39 using boost::gamma_distribution;
40 using boost::variate_generator;
41 using boost::random::poisson_distribution;
42 using T_eta_ref = ref_type_t<T_loc>;
43 using T_phi_ref = ref_type_t<T_inv>;
44 static constexpr const char* function = "neg_binomial_2_log_rng";
45 check_consistent_sizes(function, "Log-location parameter", eta,
46 "Inverse dispersion parameter", phi);
47 if (size_zero(eta, phi)) {
48 return {};
49 }
50 T_eta_ref eta_ref = eta;
51 T_phi_ref phi_ref = phi;
52 check_finite(function, "Log-location parameter", eta_ref);
53 check_positive_finite(function, "Inverse dispersion parameter", phi_ref);
54
55 scalar_seq_view<T_eta_ref> eta_vec(eta_ref);
56 scalar_seq_view<T_phi_ref> phi_vec(phi_ref);
57 size_t N = max_size(eta, phi);
59
60 for (size_t n = 0; n < N; ++n) {
61 double exp_eta_div_phi
62 = std::exp(static_cast<double>(eta_vec[n])) / phi_vec[n];
63
64 // gamma_rng params must be positive and finite
65 check_positive_finite(function,
66 "Exponential of the log-location parameter "
67 "divided by the precision parameter",
68 exp_eta_div_phi);
69
70 double rng_from_gamma = variate_generator<RNG&, gamma_distribution<> >(
71 rng, gamma_distribution<>(phi_vec[n], exp_eta_div_phi))();
72
73 // same as the constraints for poisson_rng
74 check_less(function, "Random number that came from gamma distribution",
75 rng_from_gamma, POISSON_MAX_RATE);
76 check_not_nan(function, "Random number that came from gamma distribution",
77 rng_from_gamma);
78 check_nonnegative(function,
79 "Random number that came from gamma distribution",
80 rng_from_gamma);
81
82 output[n] = variate_generator<RNG&, poisson_distribution<> >(
83 rng, poisson_distribution<>(rng_from_gamma))();
84 }
85
86 return output.data();
87}
88
89} // namespace math
90} // namespace stan
91#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_inv >::type neg_binomial_2_log_rng(const T_loc &eta, const T_inv &phi, RNG &rng)
Return a negative binomial random variate with the specified log-location and inverse dispersion para...
void check_nonnegative(const char *function, const char *name, const T_y &y)
Check if y is non-negative.
bool size_zero(const T &x)
Returns 1 if input is of length 0, returns 0 otherwise.
Definition size_zero.hpp:19
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_finite(const char *function, const char *name, const T_y &y)
Return true if all values in y are finite.
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.
Definition max_size.hpp:20
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:56
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...