1 #ifndef STAN_MATH_PRIM_SCAL_PROB_BINOMIAL_LOGIT_LOG_HPP
2 #define STAN_MATH_PRIM_SCAL_PROB_BINOMIAL_LOGIT_LOG_HPP
4 #include <boost/random/binomial_distribution.hpp>
5 #include <boost/random/variate_generator.hpp>
32 template <
bool propto,
36 typename return_type<T_prob>::type
39 const T_prob& alpha) {
43 static const char*
function(
"stan::math::binomial_logit_log");
58 T_partials_return logp = 0;
63 "Successes variable", n,
64 "Population size parameter", N,
65 "Probability parameter", alpha);
84 for (
size_t i = 0; i <
size; ++i)
89 log_inv_logit_alpha(
length(alpha));
90 for (
size_t i = 0; i <
length(alpha); ++i)
94 log_inv_logit_neg_alpha(
length(alpha));
95 for (
size_t i = 0; i <
length(alpha); ++i)
98 for (
size_t i = 0; i <
size; ++i)
99 logp += n_vec[i] * log_inv_logit_alpha[i]
100 + (N_vec[i] - n_vec[i]) * log_inv_logit_neg_alpha[i];
103 T_partials_return temp1 = 0;
104 T_partials_return temp2 = 0;
105 for (
size_t i = 0; i <
size; ++i) {
107 temp2 += N_vec[i] - n_vec[i];
110 operands_and_partials.
d_x1[0]
116 for (
size_t i = 0; i <
size; ++i)
117 operands_and_partials.
d_x1[i]
123 return operands_and_partials.
to_var(logp, alpha);
126 template <
typename T_n,
133 const T_prob& alpha) {
134 return binomial_logit_log<false>(n, N, alpha);
fvar< T > binomial_coefficient_log(const fvar< T > &x1, const fvar< T > &x2)
T value_of(const fvar< T > &v)
Return the value of the specified variable.
fvar< T > inv_logit(const fvar< T > &x)
size_t length(const std::vector< T > &x)
bool check_bounded(const char *function, const char *name, const T_y &y, const T_low &low, const T_high &high)
Return true if the value is between the low and high values, inclusively.
T_return_type to_var(T_partials_return logp, const T1 &x1=0, const T2 &x2=0, const T3 &x3=0, const T4 &x4=0, const T5 &x5=0, const T6 &x6=0)
Template metaprogram to calculate whether a summand needs to be included in a proportional (log) prob...
boost::math::tools::promote_args< typename scalar_type< T1 >::type, typename scalar_type< T2 >::type, typename scalar_type< T3 >::type, typename scalar_type< T4 >::type, typename scalar_type< T5 >::type, typename scalar_type< T6 >::type >::type type
VectorView< T_partials_return, is_vector< T1 >::value, is_constant_struct< T1 >::value > d_x1
Metaprogram to determine if a type has a base scalar type that can be assigned to type double...
A variable implementation that stores operands and derivatives with respect to the variable...
size_t max_size(const T1 &x1, const T2 &x2)
bool check_finite(const char *function, const char *name, const T_y &y)
Return true if y is finite.
int size(const std::vector< T > &x)
bool check_consistent_sizes(const char *function, const char *name1, const T1 &x1, const char *name2, const T2 &x2)
Return true if the dimension of x1 is consistent with x2.
bool check_nonnegative(const char *function, const char *name, const T_y &y)
Return true if y is non-negative.
VectorView is a template metaprogram that takes its argument and allows it to be used like a vector...
fvar< T > log_inv_logit(const fvar< T > &x)
boost::math::tools::promote_args< typename partials_type< typename scalar_type< T1 >::type >::type, typename partials_type< typename scalar_type< T2 >::type >::type, typename partials_type< typename scalar_type< T3 >::type >::type, typename partials_type< typename scalar_type< T4 >::type >::type, typename partials_type< typename scalar_type< T5 >::type >::type, typename partials_type< typename scalar_type< T6 >::type >::type >::type type
return_type< T_prob >::type binomial_logit_log(const T_n &n, const T_N &N, const T_prob &alpha)