ALIBABA 2021 Problem 2
Consider a computer network consisting of servers and bi-directional communication channels among them. Unfortunately, not all channels operate. Each direction of each channel fails with probability and operates otherwise. (All of these stochastic events are mutually independent, and .) There is a root serve, denoted by . We call the network operational, if all serves can reach using only operating channels. Note that we do not require to be able to reach any servers.
Show that the probability of the network to be operational does not depend on the choice of . (In other words, for any two distinct root servers and , the operational probability is the same.)
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.