MathDB1 problem
- 0 votes0 replies1 view
Conjecture that the complete-graph payment-failure upper bound can be improved
For the random payment-failure process on a complete graph with all edges having the same capacity, let the currently known upper and lower bounds on the time until the first payme…