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

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

2008-09-08

arxiv.org/abs/0809.1379v2

Computer Science

Information Theory

22 pages, 4 figures, Submitted to JSAC Special Issue on Stochastic Geometry and Random Graphs for Wireless Networks

Scientific paper

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 property. We then show that this property is satisfied by relevant classes, including small world topologies, which are pervasive in both man-made and natural networks, and wireless networks of dual devices, which exploit multiple radio interfaces to enhance the connectivity of the network. In both cases, we are able to apply our theorem and derive max-flow min-cut bounds for network information flow.

Affiliated with

Also associated with

No associations

Rating

A Max-Flow Min-Cut Theorem with Applications in Small Worlds and Dual Radio Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Max-Flow Min-Cut Theorem with Applications in Small Worlds and Dual Radio Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Max-Flow Min-Cut Theorem with Applications in Small Worlds and Dual Radio Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-31016