1 #ifndef STAN_MATH_PRIM_MAT_PROB_ORDERED_LOGISTIC_RNG_HPP 2 #define STAN_MATH_PRIM_MAT_PROB_ORDERED_LOGISTIC_RNG_HPP 5 #include <boost/random/variate_generator.hpp> 16 double eta,
const Eigen::Matrix<double, Eigen::Dynamic, 1>& c, RNG& rng) {
17 using boost::variate_generator;
19 static const char*
function =
"ordered_logistic";
22 check_greater(
function,
"Size of cut points parameter", c.size(), 0);
23 for (
int i = 1; i < c.size(); ++i) {
24 check_greater(
function,
"Cut points parameter", c(i), c(i - 1));
26 check_finite(
function,
"Cut points parameter", c(c.size() - 1));
29 Eigen::VectorXd cut(c.rows() + 1);
31 for (
int j = 1; j < c.rows(); j++)
33 cut(c.rows()) =
inv_logit(eta - c(c.rows() - 1));
void check_finite(const char *function, const char *name, const T_y &y)
Check if y is finite.
int ordered_logistic_rng(double eta, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &c, RNG &rng)
fvar< T > inv_logit(const fvar< T > &x)
Returns the inverse logit function applied to the argument.
int categorical_rng(const Eigen::Matrix< double, Eigen::Dynamic, 1 > &theta, RNG &rng)
void check_greater(const char *function, const char *name, const T_y &y, const T_low &low)
Check if y is strictly greater than low.