Chris@102
|
1 // Copyright 2014 Marco Guazzone (marco.guazzone@gmail.com)
|
Chris@102
|
2 //
|
Chris@102
|
3 // Use, modification and distribution are subject to the
|
Chris@102
|
4 // Boost Software License, Version 1.0. (See accompanying file
|
Chris@102
|
5 // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
Chris@102
|
6 //
|
Chris@102
|
7 // This module implements the Hyper-Exponential distribution.
|
Chris@102
|
8 //
|
Chris@102
|
9 // References:
|
Chris@102
|
10 // - "Queueing Theory in Manufacturing Systems Analysis and Design" by H.T. Papadopolous, C. Heavey and J. Browne (Chapman & Hall/CRC, 1993)
|
Chris@102
|
11 // - http://reference.wolfram.com/language/ref/HyperexponentialDistribution.html
|
Chris@102
|
12 // - http://en.wikipedia.org/wiki/Hyperexponential_distribution
|
Chris@102
|
13 //
|
Chris@102
|
14
|
Chris@102
|
15 #ifndef BOOST_MATH_DISTRIBUTIONS_HYPEREXPONENTIAL_HPP
|
Chris@102
|
16 #define BOOST_MATH_DISTRIBUTIONS_HYPEREXPONENTIAL_HPP
|
Chris@102
|
17
|
Chris@102
|
18
|
Chris@102
|
19 #include <boost/config.hpp>
|
Chris@102
|
20 #include <boost/math/distributions/complement.hpp>
|
Chris@102
|
21 #include <boost/math/distributions/detail/common_error_handling.hpp>
|
Chris@102
|
22 #include <boost/math/distributions/exponential.hpp>
|
Chris@102
|
23 #include <boost/math/policies/policy.hpp>
|
Chris@102
|
24 #include <boost/math/special_functions/fpclassify.hpp>
|
Chris@102
|
25 #include <boost/math/tools/precision.hpp>
|
Chris@102
|
26 #include <boost/math/tools/roots.hpp>
|
Chris@102
|
27 #include <boost/range/begin.hpp>
|
Chris@102
|
28 #include <boost/range/end.hpp>
|
Chris@102
|
29 #include <boost/range/size.hpp>
|
Chris@102
|
30 #include <boost/type_traits/has_pre_increment.hpp>
|
Chris@102
|
31 #include <cstddef>
|
Chris@102
|
32 #include <iterator>
|
Chris@102
|
33 #include <limits>
|
Chris@102
|
34 #include <numeric>
|
Chris@102
|
35 #include <utility>
|
Chris@102
|
36 #include <vector>
|
Chris@102
|
37
|
Chris@102
|
38 #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
|
Chris@102
|
39 # include <initializer_list>
|
Chris@102
|
40 #endif
|
Chris@102
|
41
|
Chris@102
|
42 #ifdef _MSC_VER
|
Chris@102
|
43 # pragma warning (push)
|
Chris@102
|
44 # pragma warning(disable:4127) // conditional expression is constant
|
Chris@102
|
45 # pragma warning(disable:4389) // '==' : signed/unsigned mismatch in test_tools
|
Chris@102
|
46 #endif // _MSC_VER
|
Chris@102
|
47
|
Chris@102
|
48 namespace boost { namespace math {
|
Chris@102
|
49
|
Chris@102
|
50 namespace detail {
|
Chris@102
|
51
|
Chris@102
|
52 template <typename Dist>
|
Chris@102
|
53 typename Dist::value_type generic_quantile(const Dist& dist, const typename Dist::value_type& p, const typename Dist::value_type& guess, bool comp, const char* function);
|
Chris@102
|
54
|
Chris@102
|
55 } // Namespace detail
|
Chris@102
|
56
|
Chris@102
|
57
|
Chris@102
|
58 template <typename RealT, typename PolicyT>
|
Chris@102
|
59 class hyperexponential_distribution;
|
Chris@102
|
60
|
Chris@102
|
61
|
Chris@102
|
62 namespace /*<unnamed>*/ { namespace hyperexp_detail {
|
Chris@102
|
63
|
Chris@102
|
64 template <typename T>
|
Chris@102
|
65 void normalize(std::vector<T>& v)
|
Chris@102
|
66 {
|
Chris@102
|
67 if(!v.size())
|
Chris@102
|
68 return; // Our error handlers will get this later
|
Chris@102
|
69 const T sum = std::accumulate(v.begin(), v.end(), static_cast<T>(0));
|
Chris@102
|
70 T final_sum = 0;
|
Chris@102
|
71 const typename std::vector<T>::iterator end = --v.end();
|
Chris@102
|
72 for (typename std::vector<T>::iterator it = v.begin();
|
Chris@102
|
73 it != end;
|
Chris@102
|
74 ++it)
|
Chris@102
|
75 {
|
Chris@102
|
76 *it /= sum;
|
Chris@102
|
77 final_sum += *it;
|
Chris@102
|
78 }
|
Chris@102
|
79 *end = 1 - final_sum; // avoids round off errors, ensures the probs really do sum to 1.
|
Chris@102
|
80 }
|
Chris@102
|
81
|
Chris@102
|
82 template <typename RealT, typename PolicyT>
|
Chris@102
|
83 bool check_probabilities(char const* function, std::vector<RealT> const& probabilities, RealT* presult, PolicyT const& pol)
|
Chris@102
|
84 {
|
Chris@102
|
85 BOOST_MATH_STD_USING
|
Chris@102
|
86 const std::size_t n = probabilities.size();
|
Chris@102
|
87 RealT sum = 0;
|
Chris@102
|
88 for (std::size_t i = 0; i < n; ++i)
|
Chris@102
|
89 {
|
Chris@102
|
90 if (probabilities[i] < 0
|
Chris@102
|
91 || probabilities[i] > 1
|
Chris@102
|
92 || !(boost::math::isfinite)(probabilities[i]))
|
Chris@102
|
93 {
|
Chris@102
|
94 *presult = policies::raise_domain_error<RealT>(function,
|
Chris@102
|
95 "The elements of parameter \"probabilities\" must be >= 0 and <= 1, but at least one of them was: %1%.",
|
Chris@102
|
96 probabilities[i],
|
Chris@102
|
97 pol);
|
Chris@102
|
98 return false;
|
Chris@102
|
99 }
|
Chris@102
|
100 sum += probabilities[i];
|
Chris@102
|
101 }
|
Chris@102
|
102
|
Chris@102
|
103 //
|
Chris@102
|
104 // We try to keep phase probabilities correctly normalized in the distribution constructors,
|
Chris@102
|
105 // however in practice we have to allow for a very slight divergence from a sum of exactly 1:
|
Chris@102
|
106 //
|
Chris@102
|
107 if (fabs(sum - 1) > tools::epsilon<RealT>() * 2)
|
Chris@102
|
108 {
|
Chris@102
|
109 *presult = policies::raise_domain_error<RealT>(function,
|
Chris@102
|
110 "The elements of parameter \"probabilities\" must sum to 1, but their sum is: %1%.",
|
Chris@102
|
111 sum,
|
Chris@102
|
112 pol);
|
Chris@102
|
113 return false;
|
Chris@102
|
114 }
|
Chris@102
|
115
|
Chris@102
|
116 return true;
|
Chris@102
|
117 }
|
Chris@102
|
118
|
Chris@102
|
119 template <typename RealT, typename PolicyT>
|
Chris@102
|
120 bool check_rates(char const* function, std::vector<RealT> const& rates, RealT* presult, PolicyT const& pol)
|
Chris@102
|
121 {
|
Chris@102
|
122 const std::size_t n = rates.size();
|
Chris@102
|
123 for (std::size_t i = 0; i < n; ++i)
|
Chris@102
|
124 {
|
Chris@102
|
125 if (rates[i] <= 0
|
Chris@102
|
126 || !(boost::math::isfinite)(rates[i]))
|
Chris@102
|
127 {
|
Chris@102
|
128 *presult = policies::raise_domain_error<RealT>(function,
|
Chris@102
|
129 "The elements of parameter \"rates\" must be > 0, but at least one of them is: %1%.",
|
Chris@102
|
130 rates[i],
|
Chris@102
|
131 pol);
|
Chris@102
|
132 return false;
|
Chris@102
|
133 }
|
Chris@102
|
134 }
|
Chris@102
|
135 return true;
|
Chris@102
|
136 }
|
Chris@102
|
137
|
Chris@102
|
138 template <typename RealT, typename PolicyT>
|
Chris@102
|
139 bool check_dist(char const* function, std::vector<RealT> const& probabilities, std::vector<RealT> const& rates, RealT* presult, PolicyT const& pol)
|
Chris@102
|
140 {
|
Chris@102
|
141 BOOST_MATH_STD_USING
|
Chris@102
|
142 if (probabilities.size() != rates.size())
|
Chris@102
|
143 {
|
Chris@102
|
144 *presult = policies::raise_domain_error<RealT>(function,
|
Chris@102
|
145 "The parameters \"probabilities\" and \"rates\" must have the same length, but their size differ by: %1%.",
|
Chris@102
|
146 fabs(static_cast<RealT>(probabilities.size())-static_cast<RealT>(rates.size())),
|
Chris@102
|
147 pol);
|
Chris@102
|
148 return false;
|
Chris@102
|
149 }
|
Chris@102
|
150
|
Chris@102
|
151 return check_probabilities(function, probabilities, presult, pol)
|
Chris@102
|
152 && check_rates(function, rates, presult, pol);
|
Chris@102
|
153 }
|
Chris@102
|
154
|
Chris@102
|
155 template <typename RealT, typename PolicyT>
|
Chris@102
|
156 bool check_x(char const* function, RealT x, RealT* presult, PolicyT const& pol)
|
Chris@102
|
157 {
|
Chris@102
|
158 if (x < 0 || (boost::math::isnan)(x))
|
Chris@102
|
159 {
|
Chris@102
|
160 *presult = policies::raise_domain_error<RealT>(function, "The random variable must be >= 0, but is: %1%.", x, pol);
|
Chris@102
|
161 return false;
|
Chris@102
|
162 }
|
Chris@102
|
163 return true;
|
Chris@102
|
164 }
|
Chris@102
|
165
|
Chris@102
|
166 template <typename RealT, typename PolicyT>
|
Chris@102
|
167 bool check_probability(char const* function, RealT p, RealT* presult, PolicyT const& pol)
|
Chris@102
|
168 {
|
Chris@102
|
169 if (p < 0 || p > 1 || (boost::math::isnan)(p))
|
Chris@102
|
170 {
|
Chris@102
|
171 *presult = policies::raise_domain_error<RealT>(function, "The probability be >= 0 and <= 1, but is: %1%.", p, pol);
|
Chris@102
|
172 return false;
|
Chris@102
|
173 }
|
Chris@102
|
174 return true;
|
Chris@102
|
175 }
|
Chris@102
|
176
|
Chris@102
|
177 template <typename RealT, typename PolicyT>
|
Chris@102
|
178 RealT quantile_impl(hyperexponential_distribution<RealT, PolicyT> const& dist, RealT const& p, bool comp)
|
Chris@102
|
179 {
|
Chris@102
|
180 // Don't have a closed form so try to numerically solve the inverse CDF...
|
Chris@102
|
181
|
Chris@102
|
182 typedef typename policies::evaluation<RealT, PolicyT>::type value_type;
|
Chris@102
|
183 typedef typename policies::normalise<PolicyT,
|
Chris@102
|
184 policies::promote_float<false>,
|
Chris@102
|
185 policies::promote_double<false>,
|
Chris@102
|
186 policies::discrete_quantile<>,
|
Chris@102
|
187 policies::assert_undefined<> >::type forwarding_policy;
|
Chris@102
|
188
|
Chris@102
|
189 static const char* function = comp ? "boost::math::quantile(const boost::math::complemented2_type<boost::math::hyperexponential_distribution<%1%>, %1%>&)"
|
Chris@102
|
190 : "boost::math::quantile(const boost::math::hyperexponential_distribution<%1%>&, %1%)";
|
Chris@102
|
191
|
Chris@102
|
192 RealT result = 0;
|
Chris@102
|
193
|
Chris@102
|
194 if (!check_probability(function, p, &result, PolicyT()))
|
Chris@102
|
195 {
|
Chris@102
|
196 return result;
|
Chris@102
|
197 }
|
Chris@102
|
198
|
Chris@102
|
199 const std::size_t n = dist.num_phases();
|
Chris@102
|
200 const std::vector<RealT> probs = dist.probabilities();
|
Chris@102
|
201 const std::vector<RealT> rates = dist.rates();
|
Chris@102
|
202
|
Chris@102
|
203 // A possible (but inaccurate) approximation is given below, where the
|
Chris@102
|
204 // quantile is given by the weighted sum of exponential quantiles:
|
Chris@102
|
205 RealT guess = 0;
|
Chris@102
|
206 if (comp)
|
Chris@102
|
207 {
|
Chris@102
|
208 for (std::size_t i = 0; i < n; ++i)
|
Chris@102
|
209 {
|
Chris@102
|
210 const exponential_distribution<RealT,PolicyT> exp(rates[i]);
|
Chris@102
|
211
|
Chris@102
|
212 guess += probs[i]*quantile(complement(exp, p));
|
Chris@102
|
213 }
|
Chris@102
|
214 }
|
Chris@102
|
215 else
|
Chris@102
|
216 {
|
Chris@102
|
217 for (std::size_t i = 0; i < n; ++i)
|
Chris@102
|
218 {
|
Chris@102
|
219 const exponential_distribution<RealT,PolicyT> exp(rates[i]);
|
Chris@102
|
220
|
Chris@102
|
221 guess += probs[i]*quantile(exp, p);
|
Chris@102
|
222 }
|
Chris@102
|
223 }
|
Chris@102
|
224
|
Chris@102
|
225 // Fast return in case the Hyper-Exponential is essentially an Exponential
|
Chris@102
|
226 if (n == 1)
|
Chris@102
|
227 {
|
Chris@102
|
228 return guess;
|
Chris@102
|
229 }
|
Chris@102
|
230
|
Chris@102
|
231 value_type q;
|
Chris@102
|
232 q = detail::generic_quantile(hyperexponential_distribution<RealT,forwarding_policy>(probs, rates),
|
Chris@102
|
233 p,
|
Chris@102
|
234 guess,
|
Chris@102
|
235 comp,
|
Chris@102
|
236 function);
|
Chris@102
|
237
|
Chris@102
|
238 result = policies::checked_narrowing_cast<RealT,forwarding_policy>(q, function);
|
Chris@102
|
239
|
Chris@102
|
240 return result;
|
Chris@102
|
241 }
|
Chris@102
|
242
|
Chris@102
|
243 }} // Namespace <unnamed>::hyperexp_detail
|
Chris@102
|
244
|
Chris@102
|
245
|
Chris@102
|
246 template <typename RealT = double, typename PolicyT = policies::policy<> >
|
Chris@102
|
247 class hyperexponential_distribution
|
Chris@102
|
248 {
|
Chris@102
|
249 public: typedef RealT value_type;
|
Chris@102
|
250 public: typedef PolicyT policy_type;
|
Chris@102
|
251
|
Chris@102
|
252
|
Chris@102
|
253 public: hyperexponential_distribution()
|
Chris@102
|
254 : probs_(1, 1),
|
Chris@102
|
255 rates_(1, 1)
|
Chris@102
|
256 {
|
Chris@102
|
257 RealT err;
|
Chris@102
|
258 hyperexp_detail::check_dist("boost::math::hyperexponential_distribution<%1%>::hyperexponential_distribution",
|
Chris@102
|
259 probs_,
|
Chris@102
|
260 rates_,
|
Chris@102
|
261 &err,
|
Chris@102
|
262 PolicyT());
|
Chris@102
|
263 }
|
Chris@102
|
264
|
Chris@102
|
265 // Four arg constructor: no ambiguity here, the arguments must be two pairs of iterators:
|
Chris@102
|
266 public: template <typename ProbIterT, typename RateIterT>
|
Chris@102
|
267 hyperexponential_distribution(ProbIterT prob_first, ProbIterT prob_last,
|
Chris@102
|
268 RateIterT rate_first, RateIterT rate_last)
|
Chris@102
|
269 : probs_(prob_first, prob_last),
|
Chris@102
|
270 rates_(rate_first, rate_last)
|
Chris@102
|
271 {
|
Chris@102
|
272 hyperexp_detail::normalize(probs_);
|
Chris@102
|
273 RealT err;
|
Chris@102
|
274 hyperexp_detail::check_dist("boost::math::hyperexponential_distribution<%1%>::hyperexponential_distribution",
|
Chris@102
|
275 probs_,
|
Chris@102
|
276 rates_,
|
Chris@102
|
277 &err,
|
Chris@102
|
278 PolicyT());
|
Chris@102
|
279 }
|
Chris@102
|
280
|
Chris@102
|
281 // Two arg constructor from 2 ranges, we SFINAE this out of existance if
|
Chris@102
|
282 // either argument type is incrementable as in that case the type is
|
Chris@102
|
283 // probably an iterator:
|
Chris@102
|
284 public: template <typename ProbRangeT, typename RateRangeT>
|
Chris@102
|
285 hyperexponential_distribution(ProbRangeT const& prob_range,
|
Chris@102
|
286 RateRangeT const& rate_range,
|
Chris@102
|
287 typename boost::disable_if_c<boost::has_pre_increment<ProbRangeT>::value || boost::has_pre_increment<RateRangeT>::value>::type* = 0)
|
Chris@102
|
288 : probs_(boost::begin(prob_range), boost::end(prob_range)),
|
Chris@102
|
289 rates_(boost::begin(rate_range), boost::end(rate_range))
|
Chris@102
|
290 {
|
Chris@102
|
291 hyperexp_detail::normalize(probs_);
|
Chris@102
|
292
|
Chris@102
|
293 RealT err;
|
Chris@102
|
294 hyperexp_detail::check_dist("boost::math::hyperexponential_distribution<%1%>::hyperexponential_distribution",
|
Chris@102
|
295 probs_,
|
Chris@102
|
296 rates_,
|
Chris@102
|
297 &err,
|
Chris@102
|
298 PolicyT());
|
Chris@102
|
299 }
|
Chris@102
|
300
|
Chris@102
|
301 // Two arg constructor for a pair of iterators: we SFINAE this out of
|
Chris@102
|
302 // existance if neither argument types are incrementable.
|
Chris@102
|
303 // Note that we allow different argument types here to allow for
|
Chris@102
|
304 // construction from an array plus a pointer into that array.
|
Chris@102
|
305 public: template <typename RateIterT, typename RateIterT2>
|
Chris@102
|
306 hyperexponential_distribution(RateIterT const& rate_first,
|
Chris@102
|
307 RateIterT2 const& rate_last,
|
Chris@102
|
308 typename boost::enable_if_c<boost::has_pre_increment<RateIterT>::value || boost::has_pre_increment<RateIterT2>::value>::type* = 0)
|
Chris@102
|
309 : probs_(std::distance(rate_first, rate_last), 1), // will be normalized below
|
Chris@102
|
310 rates_(rate_first, rate_last)
|
Chris@102
|
311 {
|
Chris@102
|
312 hyperexp_detail::normalize(probs_);
|
Chris@102
|
313
|
Chris@102
|
314 RealT err;
|
Chris@102
|
315 hyperexp_detail::check_dist("boost::math::hyperexponential_distribution<%1%>::hyperexponential_distribution",
|
Chris@102
|
316 probs_,
|
Chris@102
|
317 rates_,
|
Chris@102
|
318 &err,
|
Chris@102
|
319 PolicyT());
|
Chris@102
|
320 }
|
Chris@102
|
321
|
Chris@102
|
322 #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
|
Chris@102
|
323 // Initializer list constructor: allows for construction from array literals:
|
Chris@102
|
324 public: hyperexponential_distribution(std::initializer_list<RealT> l1, std::initializer_list<RealT> l2)
|
Chris@102
|
325 : probs_(l1.begin(), l1.end()),
|
Chris@102
|
326 rates_(l2.begin(), l2.end())
|
Chris@102
|
327 {
|
Chris@102
|
328 hyperexp_detail::normalize(probs_);
|
Chris@102
|
329
|
Chris@102
|
330 RealT err;
|
Chris@102
|
331 hyperexp_detail::check_dist("boost::math::hyperexponential_distribution<%1%>::hyperexponential_distribution",
|
Chris@102
|
332 probs_,
|
Chris@102
|
333 rates_,
|
Chris@102
|
334 &err,
|
Chris@102
|
335 PolicyT());
|
Chris@102
|
336 }
|
Chris@102
|
337
|
Chris@102
|
338 public: hyperexponential_distribution(std::initializer_list<RealT> l1)
|
Chris@102
|
339 : probs_(l1.size(), 1),
|
Chris@102
|
340 rates_(l1.begin(), l1.end())
|
Chris@102
|
341 {
|
Chris@102
|
342 hyperexp_detail::normalize(probs_);
|
Chris@102
|
343
|
Chris@102
|
344 RealT err;
|
Chris@102
|
345 hyperexp_detail::check_dist("boost::math::hyperexponential_distribution<%1%>::hyperexponential_distribution",
|
Chris@102
|
346 probs_,
|
Chris@102
|
347 rates_,
|
Chris@102
|
348 &err,
|
Chris@102
|
349 PolicyT());
|
Chris@102
|
350 }
|
Chris@102
|
351 #endif // !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
|
Chris@102
|
352
|
Chris@102
|
353 // Single argument constructor: argument must be a range.
|
Chris@102
|
354 public: template <typename RateRangeT>
|
Chris@102
|
355 hyperexponential_distribution(RateRangeT const& rate_range)
|
Chris@102
|
356 : probs_(boost::size(rate_range), 1), // will be normalized below
|
Chris@102
|
357 rates_(boost::begin(rate_range), boost::end(rate_range))
|
Chris@102
|
358 {
|
Chris@102
|
359 hyperexp_detail::normalize(probs_);
|
Chris@102
|
360
|
Chris@102
|
361 RealT err;
|
Chris@102
|
362 hyperexp_detail::check_dist("boost::math::hyperexponential_distribution<%1%>::hyperexponential_distribution",
|
Chris@102
|
363 probs_,
|
Chris@102
|
364 rates_,
|
Chris@102
|
365 &err,
|
Chris@102
|
366 PolicyT());
|
Chris@102
|
367 }
|
Chris@102
|
368
|
Chris@102
|
369 public: std::vector<RealT> probabilities() const
|
Chris@102
|
370 {
|
Chris@102
|
371 return probs_;
|
Chris@102
|
372 }
|
Chris@102
|
373
|
Chris@102
|
374 public: std::vector<RealT> rates() const
|
Chris@102
|
375 {
|
Chris@102
|
376 return rates_;
|
Chris@102
|
377 }
|
Chris@102
|
378
|
Chris@102
|
379 public: std::size_t num_phases() const
|
Chris@102
|
380 {
|
Chris@102
|
381 return rates_.size();
|
Chris@102
|
382 }
|
Chris@102
|
383
|
Chris@102
|
384
|
Chris@102
|
385 private: std::vector<RealT> probs_;
|
Chris@102
|
386 private: std::vector<RealT> rates_;
|
Chris@102
|
387 }; // class hyperexponential_distribution
|
Chris@102
|
388
|
Chris@102
|
389
|
Chris@102
|
390 // Convenient type synonym for double.
|
Chris@102
|
391 typedef hyperexponential_distribution<double> hyperexponential;
|
Chris@102
|
392
|
Chris@102
|
393
|
Chris@102
|
394 // Range of permissible values for random variable x
|
Chris@102
|
395 template <typename RealT, typename PolicyT>
|
Chris@102
|
396 std::pair<RealT,RealT> range(hyperexponential_distribution<RealT,PolicyT> const&)
|
Chris@102
|
397 {
|
Chris@102
|
398 if (std::numeric_limits<RealT>::has_infinity)
|
Chris@102
|
399 {
|
Chris@102
|
400 return std::make_pair(static_cast<RealT>(0), std::numeric_limits<RealT>::infinity()); // 0 to +inf.
|
Chris@102
|
401 }
|
Chris@102
|
402
|
Chris@102
|
403 return std::make_pair(static_cast<RealT>(0), tools::max_value<RealT>()); // 0 to +<max value>
|
Chris@102
|
404 }
|
Chris@102
|
405
|
Chris@102
|
406 // Range of supported values for random variable x.
|
Chris@102
|
407 // This is range where cdf rises from 0 to 1, and outside it, the pdf is zero.
|
Chris@102
|
408 template <typename RealT, typename PolicyT>
|
Chris@102
|
409 std::pair<RealT,RealT> support(hyperexponential_distribution<RealT,PolicyT> const&)
|
Chris@102
|
410 {
|
Chris@102
|
411 return std::make_pair(tools::min_value<RealT>(), tools::max_value<RealT>()); // <min value> to +<max value>.
|
Chris@102
|
412 }
|
Chris@102
|
413
|
Chris@102
|
414 template <typename RealT, typename PolicyT>
|
Chris@102
|
415 RealT pdf(hyperexponential_distribution<RealT, PolicyT> const& dist, RealT const& x)
|
Chris@102
|
416 {
|
Chris@102
|
417 BOOST_MATH_STD_USING
|
Chris@102
|
418 RealT result = 0;
|
Chris@102
|
419
|
Chris@102
|
420 if (!hyperexp_detail::check_x("boost::math::pdf(const boost::math::hyperexponential_distribution<%1%>&, %1%)", x, &result, PolicyT()))
|
Chris@102
|
421 {
|
Chris@102
|
422 return result;
|
Chris@102
|
423 }
|
Chris@102
|
424
|
Chris@102
|
425 const std::size_t n = dist.num_phases();
|
Chris@102
|
426 const std::vector<RealT> probs = dist.probabilities();
|
Chris@102
|
427 const std::vector<RealT> rates = dist.rates();
|
Chris@102
|
428
|
Chris@102
|
429 for (std::size_t i = 0; i < n; ++i)
|
Chris@102
|
430 {
|
Chris@102
|
431 const exponential_distribution<RealT,PolicyT> exp(rates[i]);
|
Chris@102
|
432
|
Chris@102
|
433 result += probs[i]*pdf(exp, x);
|
Chris@102
|
434 //result += probs[i]*rates[i]*exp(-rates[i]*x);
|
Chris@102
|
435 }
|
Chris@102
|
436
|
Chris@102
|
437 return result;
|
Chris@102
|
438 }
|
Chris@102
|
439
|
Chris@102
|
440 template <typename RealT, typename PolicyT>
|
Chris@102
|
441 RealT cdf(hyperexponential_distribution<RealT, PolicyT> const& dist, RealT const& x)
|
Chris@102
|
442 {
|
Chris@102
|
443 RealT result = 0;
|
Chris@102
|
444
|
Chris@102
|
445 if (!hyperexp_detail::check_x("boost::math::cdf(const boost::math::hyperexponential_distribution<%1%>&, %1%)", x, &result, PolicyT()))
|
Chris@102
|
446 {
|
Chris@102
|
447 return result;
|
Chris@102
|
448 }
|
Chris@102
|
449
|
Chris@102
|
450 const std::size_t n = dist.num_phases();
|
Chris@102
|
451 const std::vector<RealT> probs = dist.probabilities();
|
Chris@102
|
452 const std::vector<RealT> rates = dist.rates();
|
Chris@102
|
453
|
Chris@102
|
454 for (std::size_t i = 0; i < n; ++i)
|
Chris@102
|
455 {
|
Chris@102
|
456 const exponential_distribution<RealT,PolicyT> exp(rates[i]);
|
Chris@102
|
457
|
Chris@102
|
458 result += probs[i]*cdf(exp, x);
|
Chris@102
|
459 }
|
Chris@102
|
460
|
Chris@102
|
461 return result;
|
Chris@102
|
462 }
|
Chris@102
|
463
|
Chris@102
|
464 template <typename RealT, typename PolicyT>
|
Chris@102
|
465 RealT quantile(hyperexponential_distribution<RealT, PolicyT> const& dist, RealT const& p)
|
Chris@102
|
466 {
|
Chris@102
|
467 return hyperexp_detail::quantile_impl(dist, p , false);
|
Chris@102
|
468 }
|
Chris@102
|
469
|
Chris@102
|
470 template <typename RealT, typename PolicyT>
|
Chris@102
|
471 RealT cdf(complemented2_type<hyperexponential_distribution<RealT,PolicyT>, RealT> const& c)
|
Chris@102
|
472 {
|
Chris@102
|
473 RealT const& x = c.param;
|
Chris@102
|
474 hyperexponential_distribution<RealT,PolicyT> const& dist = c.dist;
|
Chris@102
|
475
|
Chris@102
|
476 RealT result = 0;
|
Chris@102
|
477
|
Chris@102
|
478 if (!hyperexp_detail::check_x("boost::math::cdf(boost::math::complemented2_type<const boost::math::hyperexponential_distribution<%1%>&, %1%>)", x, &result, PolicyT()))
|
Chris@102
|
479 {
|
Chris@102
|
480 return result;
|
Chris@102
|
481 }
|
Chris@102
|
482
|
Chris@102
|
483 const std::size_t n = dist.num_phases();
|
Chris@102
|
484 const std::vector<RealT> probs = dist.probabilities();
|
Chris@102
|
485 const std::vector<RealT> rates = dist.rates();
|
Chris@102
|
486
|
Chris@102
|
487 for (std::size_t i = 0; i < n; ++i)
|
Chris@102
|
488 {
|
Chris@102
|
489 const exponential_distribution<RealT,PolicyT> exp(rates[i]);
|
Chris@102
|
490
|
Chris@102
|
491 result += probs[i]*cdf(complement(exp, x));
|
Chris@102
|
492 }
|
Chris@102
|
493
|
Chris@102
|
494 return result;
|
Chris@102
|
495 }
|
Chris@102
|
496
|
Chris@102
|
497
|
Chris@102
|
498 template <typename RealT, typename PolicyT>
|
Chris@102
|
499 RealT quantile(complemented2_type<hyperexponential_distribution<RealT, PolicyT>, RealT> const& c)
|
Chris@102
|
500 {
|
Chris@102
|
501 RealT const& p = c.param;
|
Chris@102
|
502 hyperexponential_distribution<RealT,PolicyT> const& dist = c.dist;
|
Chris@102
|
503
|
Chris@102
|
504 return hyperexp_detail::quantile_impl(dist, p , true);
|
Chris@102
|
505 }
|
Chris@102
|
506
|
Chris@102
|
507 template <typename RealT, typename PolicyT>
|
Chris@102
|
508 RealT mean(hyperexponential_distribution<RealT, PolicyT> const& dist)
|
Chris@102
|
509 {
|
Chris@102
|
510 RealT result = 0;
|
Chris@102
|
511
|
Chris@102
|
512 const std::size_t n = dist.num_phases();
|
Chris@102
|
513 const std::vector<RealT> probs = dist.probabilities();
|
Chris@102
|
514 const std::vector<RealT> rates = dist.rates();
|
Chris@102
|
515
|
Chris@102
|
516 for (std::size_t i = 0; i < n; ++i)
|
Chris@102
|
517 {
|
Chris@102
|
518 const exponential_distribution<RealT,PolicyT> exp(rates[i]);
|
Chris@102
|
519
|
Chris@102
|
520 result += probs[i]*mean(exp);
|
Chris@102
|
521 }
|
Chris@102
|
522
|
Chris@102
|
523 return result;
|
Chris@102
|
524 }
|
Chris@102
|
525
|
Chris@102
|
526 template <typename RealT, typename PolicyT>
|
Chris@102
|
527 RealT variance(hyperexponential_distribution<RealT, PolicyT> const& dist)
|
Chris@102
|
528 {
|
Chris@102
|
529 RealT result = 0;
|
Chris@102
|
530
|
Chris@102
|
531 const std::size_t n = dist.num_phases();
|
Chris@102
|
532 const std::vector<RealT> probs = dist.probabilities();
|
Chris@102
|
533 const std::vector<RealT> rates = dist.rates();
|
Chris@102
|
534
|
Chris@102
|
535 for (std::size_t i = 0; i < n; ++i)
|
Chris@102
|
536 {
|
Chris@102
|
537 result += probs[i]/(rates[i]*rates[i]);
|
Chris@102
|
538 }
|
Chris@102
|
539
|
Chris@102
|
540 const RealT mean = boost::math::mean(dist);
|
Chris@102
|
541
|
Chris@102
|
542 result = 2*result-mean*mean;
|
Chris@102
|
543
|
Chris@102
|
544 return result;
|
Chris@102
|
545 }
|
Chris@102
|
546
|
Chris@102
|
547 template <typename RealT, typename PolicyT>
|
Chris@102
|
548 RealT skewness(hyperexponential_distribution<RealT,PolicyT> const& dist)
|
Chris@102
|
549 {
|
Chris@102
|
550 BOOST_MATH_STD_USING
|
Chris@102
|
551 const std::size_t n = dist.num_phases();
|
Chris@102
|
552 const std::vector<RealT> probs = dist.probabilities();
|
Chris@102
|
553 const std::vector<RealT> rates = dist.rates();
|
Chris@102
|
554
|
Chris@102
|
555 RealT s1 = 0; // \sum_{i=1}^n \frac{p_i}{\lambda_i}
|
Chris@102
|
556 RealT s2 = 0; // \sum_{i=1}^n \frac{p_i}{\lambda_i^2}
|
Chris@102
|
557 RealT s3 = 0; // \sum_{i=1}^n \frac{p_i}{\lambda_i^3}
|
Chris@102
|
558 for (std::size_t i = 0; i < n; ++i)
|
Chris@102
|
559 {
|
Chris@102
|
560 const RealT p = probs[i];
|
Chris@102
|
561 const RealT r = rates[i];
|
Chris@102
|
562 const RealT r2 = r*r;
|
Chris@102
|
563 const RealT r3 = r2*r;
|
Chris@102
|
564
|
Chris@102
|
565 s1 += p/r;
|
Chris@102
|
566 s2 += p/r2;
|
Chris@102
|
567 s3 += p/r3;
|
Chris@102
|
568 }
|
Chris@102
|
569
|
Chris@102
|
570 const RealT s1s1 = s1*s1;
|
Chris@102
|
571
|
Chris@102
|
572 const RealT num = (6*s3 - (3*(2*s2 - s1s1) + s1s1)*s1);
|
Chris@102
|
573 const RealT den = (2*s2 - s1s1);
|
Chris@102
|
574
|
Chris@102
|
575 return num / pow(den, static_cast<RealT>(1.5));
|
Chris@102
|
576 }
|
Chris@102
|
577
|
Chris@102
|
578 template <typename RealT, typename PolicyT>
|
Chris@102
|
579 RealT kurtosis(hyperexponential_distribution<RealT,PolicyT> const& dist)
|
Chris@102
|
580 {
|
Chris@102
|
581 const std::size_t n = dist.num_phases();
|
Chris@102
|
582 const std::vector<RealT> probs = dist.probabilities();
|
Chris@102
|
583 const std::vector<RealT> rates = dist.rates();
|
Chris@102
|
584
|
Chris@102
|
585 RealT s1 = 0; // \sum_{i=1}^n \frac{p_i}{\lambda_i}
|
Chris@102
|
586 RealT s2 = 0; // \sum_{i=1}^n \frac{p_i}{\lambda_i^2}
|
Chris@102
|
587 RealT s3 = 0; // \sum_{i=1}^n \frac{p_i}{\lambda_i^3}
|
Chris@102
|
588 RealT s4 = 0; // \sum_{i=1}^n \frac{p_i}{\lambda_i^4}
|
Chris@102
|
589 for (std::size_t i = 0; i < n; ++i)
|
Chris@102
|
590 {
|
Chris@102
|
591 const RealT p = probs[i];
|
Chris@102
|
592 const RealT r = rates[i];
|
Chris@102
|
593 const RealT r2 = r*r;
|
Chris@102
|
594 const RealT r3 = r2*r;
|
Chris@102
|
595 const RealT r4 = r3*r;
|
Chris@102
|
596
|
Chris@102
|
597 s1 += p/r;
|
Chris@102
|
598 s2 += p/r2;
|
Chris@102
|
599 s3 += p/r3;
|
Chris@102
|
600 s4 += p/r4;
|
Chris@102
|
601 }
|
Chris@102
|
602
|
Chris@102
|
603 const RealT s1s1 = s1*s1;
|
Chris@102
|
604
|
Chris@102
|
605 const RealT num = (24*s4 - 24*s3*s1 + 3*(2*(2*s2 - s1s1) + s1s1)*s1s1);
|
Chris@102
|
606 const RealT den = (2*s2 - s1s1);
|
Chris@102
|
607
|
Chris@102
|
608 return num/(den*den);
|
Chris@102
|
609 }
|
Chris@102
|
610
|
Chris@102
|
611 template <typename RealT, typename PolicyT>
|
Chris@102
|
612 RealT kurtosis_excess(hyperexponential_distribution<RealT,PolicyT> const& dist)
|
Chris@102
|
613 {
|
Chris@102
|
614 return kurtosis(dist) - 3;
|
Chris@102
|
615 }
|
Chris@102
|
616
|
Chris@102
|
617 template <typename RealT, typename PolicyT>
|
Chris@102
|
618 RealT mode(hyperexponential_distribution<RealT,PolicyT> const& /*dist*/)
|
Chris@102
|
619 {
|
Chris@102
|
620 return 0;
|
Chris@102
|
621 }
|
Chris@102
|
622
|
Chris@102
|
623 }} // namespace boost::math
|
Chris@102
|
624
|
Chris@102
|
625 #ifdef BOOST_MSVC
|
Chris@102
|
626 #pragma warning (pop)
|
Chris@102
|
627 #endif
|
Chris@102
|
628 // This include must be at the end, *after* the accessors
|
Chris@102
|
629 // for this distribution have been defined, in order to
|
Chris@102
|
630 // keep compilers that support two-phase lookup happy.
|
Chris@102
|
631 #include <boost/math/distributions/detail/derived_accessors.hpp>
|
Chris@102
|
632 #include <boost/math/distributions/detail/generic_quantile.hpp>
|
Chris@102
|
633
|
Chris@102
|
634 #endif // BOOST_MATH_DISTRIBUTIONS_HYPEREXPONENTIAL
|