Debian Codegraph @

src/Multinomial.cpp

raw
1 #include "Multinomial.h"
2 #include "Sum.h"
3 #include "Product.h"
4
5
6 long double multinomialSamplingProb(const vector<long double>& probs, const vector<int>& obs) {
7 vector<long double> factorials;
8 vector<long double> probsPowObs;
9 factorials.resize(obs.size());
10 transform(obs.begin(), obs.end(), factorials.begin(), factorial);
11 vector<long double>::const_iterator p = probs.begin();
12 vector<int>::const_iterator o = obs.begin();
13 for (; p != probs.end() && o != obs.end(); ++p, ++o) {
14 probsPowObs.push_back(pow(*p, *o));
15 }
16 return factorial(sum(obs)) / product(factorials) * product(probsPowObs);
17 }
18
19 // TODO rename to reflect the fact that this is the multinomial sampling
20 // probability for obs counts given probs probabilities
21 long double multinomialSamplingProbLn(const vector<long double>& probs, const vector<int>& obs) {
22 vector<long double> factorials;
23 vector<long double> probsPowObs;
24 factorials.resize(obs.size());
25 transform(obs.begin(), obs.end(), factorials.begin(), factorialln);
26 vector<long double>::const_iterator p = probs.begin();
27 vector<int>::const_iterator o = obs.begin();
28 for (; p != probs.end() && o != obs.end(); ++p, ++o) {
29 probsPowObs.push_back(powln(log(*p), *o));
30 }
31 return factorialln(sum(obs)) - sum(factorials) + sum(probsPowObs);
32 }
33
34 long double multinomialCoefficientLn(int n, const vector<int>& counts) {
35 vector<long double> count_factorials;
36 count_factorials.resize(counts.size());
37 transform(counts.begin(), counts.end(), count_factorials.begin(), factorialln);
38 return factorialln(n) - sum(count_factorials);
39 }
40
41 long double samplingProbLn(const vector<long double>& probs, const vector<int>& obs) {
42 vector<long double>::const_iterator p = probs.begin();
43 vector<int>::const_iterator o = obs.begin();
44 long double r = 0;
45 for (; p != probs.end() && o != obs.end(); ++p, ++o) {
46 r += powln(log(*p), *o);
47 }
48 return r;
49 }