最大流最小割定理及其在小世界和对偶无线电网络中的应用
A Max-Flow Min-Cut Theorem with Applications in Small Worlds and Dual Radio Networks
摘要：
随机网络的容量感兴趣，我们首先证明了一个最大流最小割定理，适用于任何随机图服从适当定义的独立切割属性。然后，我们表明，这个属性是满足相关类，包括小世界拓扑结构，这是普遍存在于人造和自然网络，和无线网络的双设备，利用多个无线电接口，以提高网络的连通性。在这两种情况下，我们能够应用我们的定理，并推导出网络信息流的最大流最小割界。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
