A Max-Flow Min-Cut Theorem with Applications in Small Worlds and Dual Radio Networks

Rui A. Costa, Joao Barros

Intrigued by the capacity of random networks, we start by proving a max-flow min-cut theorem that is applicable to any random graph obeying a suitably defined independence-in-cut p…