1 #ifndef STAN_MATH_PRIM_MAT_PROB_ORDERED_LOGISTIC_RNG_HPP
2 #define STAN_MATH_PRIM_MAT_PROB_ORDERED_LOGISTIC_RNG_HPP
4 #include <boost/random/uniform_01.hpp>
5 #include <boost/random/variate_generator.hpp>
24 const Eigen::Matrix<double, Eigen::Dynamic, 1>& c,
26 using boost::variate_generator;
28 static const char*
function(
"ordered_logistic");
31 check_greater(
function,
"Size of cut points parameter", c.size(), 0);
32 for (
int i = 1; i < c.size(); ++i) {
33 check_greater(
function,
"Cut points parameter", c(i), c(i - 1));
35 check_finite(
function,
"Cut points parameter", c(c.size()-1));
38 Eigen::VectorXd cut(c.rows()+1);
40 for (
int j = 1; j < c.rows(); j++)
42 cut(c.rows()) =
inv_logit(eta - c(c.rows() - 1));
fvar< T > inv_logit(const fvar< T > &x)
int categorical_rng(const Eigen::Matrix< double, Eigen::Dynamic, 1 > &theta, RNG &rng)
bool check_finite(const char *function, const char *name, const T_y &y)
Return true if y is finite.
int ordered_logistic_rng(const double eta, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &c, RNG &rng)
bool check_greater(const char *function, const char *name, const T_y &y, const T_low &low)
Return true if y is strictly greater than low.