clelidm / mincompspin_greedy Goto Github PK

double LogE_SubC_forMCM(map<__int128_t, unsigned int> Kset, uint32_t m, unsigned int N)
{
  double LogE = 0;

  map<__int128_t, unsigned int>::iterator it;
  unsigned int Ncontrol = 0; // for control
  unsigned int Ks = 0;

  for (it = Kset.begin(); it!=Kset.end(); ++it)
  {
    Ks = (it->second);  Ncontrol += Ks;
    LogE += lgamma(Ks + 0.5) - lgamma(0.5);
  }
  if (Ncontrol != N) { cout << "Error Likelihood function: Ncontrol != N" << endl;  }

  return LogE - lgamma( (double)( N + (1UL << (m-1)) ) ) + lgamma( (double)((1UL << (m-1)) ) ); 
}