4 ms·
That seems irrelevant since then there would be no path in the lower graph either. This must be true because deletions are based on probability and the correspo
by torstenvl 2y ago
That seems irrelevant since then there would be no path in the lower graph either. This must be true because deletions are based on probability and the corresponding edges between upper graph and lower graph are required to have the same probability.
- TheRealPomax 2y agoEach edge is independent from each other edge: you don't roll a die and then go "4: remove every edge that's 4 or less", you make a separate roll for each edge.
- arjvik 2y agoSame probability, but still independently sampled.
- calfuris 2y agoHaving the same probability of deletion doesn't mean that they will necessarily share the same fate.
- torstenvl 2y agoAh. The Wikipedia description of the conjecture does not say that each edge is independently randomly deleted (or not) based on the probability assigned to that edge. I just assumed the probabilities were the weights in a weighted graph and had some other effect (e.g., likelihood of success traversing that edge, comparative likelihood of choosing that edge vs another when traversing the graph, etc.).