Automatic Differentiation
 
Loading...
Searching...
No Matches
multinomial_rng.hpp
Go to the documentation of this file.
1#ifndef STAN_MATH_PRIM_PROB_MULTINOMIAL_RNG_HPP
2#define STAN_MATH_PRIM_PROB_MULTINOMIAL_RNG_HPP
3
8#include <vector>
9
10namespace stan {
11namespace math {
12
13template <class T_theta, class RNG,
14 require_eigen_col_vector_t<T_theta>* = nullptr>
15inline std::vector<int> multinomial_rng(const T_theta& theta, int N, RNG& rng) {
16 static constexpr const char* function = "multinomial_rng";
17 const auto& theta_ref = to_ref(theta);
18 check_simplex(function, "Probabilities parameter", theta_ref);
19 check_positive(function, "number of trials variables", N);
20
21 std::vector<int> result(theta.size(), 0);
22 double mass_left = 1.0;
23 int n_left = N;
24 for (int k = 0; n_left > 0 && k < theta.size(); ++k) {
25 double p = theta_ref.coeff(k) / mass_left;
26 if (p > 1.0) {
27 p = 1.0;
28 }
29 result[k] = binomial_rng(n_left, p, rng);
30 n_left -= result[k];
31 mass_left -= theta_ref(k);
32 }
33 return result;
34}
35
36} // namespace math
37} // namespace stan
38#endif
VectorBuilder< true, int, T_N, T_theta >::type binomial_rng(const T_N &N, const T_theta &theta, RNG &rng)
Return a pseudorandom binomial random variable for the given population size and chance of success pa...
std::vector< int > multinomial_rng(const T_theta &theta, int N, RNG &rng)
void check_simplex(const char *function, const char *name, const T &theta)
Throw an exception if the specified vector is not a simplex.
ref_type_t< T && > to_ref(T &&a)
This evaluates expensive Eigen expressions.
Definition to_ref.hpp:17
void check_positive(const char *function, const char *name, const T_y &y)
Check if y is positive.
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...
Definition fvar.hpp:9