Automatic Differentiation
 
Loading...
Searching...
No Matches
pareto_rng.hpp
Go to the documentation of this file.
1#ifndef STAN_MATH_PRIM_PROB_PARETO_RNG_HPP
2#define STAN_MATH_PRIM_PROB_PARETO_RNG_HPP
3
10#include <boost/random/exponential_distribution.hpp>
11#include <boost/random/variate_generator.hpp>
12#include <cmath>
13
14namespace stan {
15namespace math {
16
35template <typename T_shape, typename T_scale, class RNG>
37 const T_scale& y_min, const T_shape& alpha, RNG& rng) {
38 using boost::exponential_distribution;
39 using boost::variate_generator;
40 static constexpr const char* function = "pareto_rng";
41 check_consistent_sizes(function, "Scale Parameter", y_min, "Shape parameter",
42 alpha);
43 if (size_zero(y_min, alpha)) {
44 return {};
45 }
46 const auto& y_min_ref = to_ref(y_min);
47 const auto& alpha_ref = to_ref(alpha);
48 check_positive_finite(function, "Scale parameter", y_min_ref);
49 check_positive_finite(function, "Shape parameter", alpha_ref);
50
51 scalar_seq_view<T_scale> y_min_vec(y_min_ref);
52 scalar_seq_view<T_shape> alpha_vec(alpha_ref);
53 size_t N = max_size(y_min, alpha);
55
56 for (size_t n = 0; n < N; ++n) {
57 variate_generator<RNG&, exponential_distribution<> > exp_rng(
58 rng, exponential_distribution<>(alpha_vec[n]));
59 output[n] = y_min_vec[n] * std::exp(exp_rng());
60 }
61
62 return output.data();
63}
64
65} // namespace math
66} // namespace stan
67#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, double, T_shape, T_scale >::type pareto_rng(const T_scale &y_min, const T_shape &alpha, RNG &rng)
Return a Pareto random variate for the given shape and scale parameters using the specified random nu...
bool size_zero(const T &x)
Returns 1 if input is of length 0, returns 0 otherwise.
Definition size_zero.hpp:19
void check_consistent_sizes(const char *)
Trivial no input case, this function is a no-op.
ref_type_t< T && > to_ref(T &&a)
This evaluates expensive Eigen expressions.
Definition to_ref.hpp:18
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.
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...