medium Probability
A release-checked medium problem for training Expected Value.
We have an undirected graph with $11$ nodes. For every node, you are able to access any other node (not including itself), all with an equal probability of $1/10$. Given this graph what is the expected number of steps to reach all nodes at least once (rounded to the nearest step)?
This Probability problem is tagged Expected Value. State the random variables and conditioning information explicitly, then check the result against boundary cases before opening hints or a solution.
Probability · Akuna
Probability
Probability
Probability · SIG, DE Shaw
Probability · SIG, Jane Street
Probability · Jane Street