more combinatorics

On a call with Dan Foreman-Mackey we had an insight on our combinatoric-degeneracies toy problem: We can construct a more general family of models by considering every way we can put K (unique, identifiable) pigeons into M (unique, identifiable) holes, with or without exclusion of pigeons (but preferably with). I think we can still make an analytically integrable likelihood function in all these cases. That's the next generalization of the problem. I was trying to build code that deterministically sets all parameters; Foreman-Mackey encouraged me to just pull the parameters from sensible distributions.

No comments:

Post a Comment