#7 MST ReCom
Statement
Running ReCom with random minimal spanning trees (i.e., drawing trees using Kruskal's algorithm with random weights):
(a) Can we modify the algorithm so that we get a nice (approximate) description of the distribution we are sampling from?
(b) Can we at least calculate forward and backward probabilities so we can use Metropolis-Hastings?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.