A graph has N nodes, and each node is connected to exactly M other nodes. Which nodes are connected is randomly determined.
.04N of these nodes are red, and the remaining .96N are black, and a node's color is randomly determined. How would one determine the value of M such that, on average for any black node, the shortest distance to a red node is two edges?
This is my first time posting in this StackExchange and I'm not normally a math person, so apologies if the question is phrased poorly.