Determining the Shannon Capacity of Graphs: A New Graph Limit Approach

The Shannon capacity of a graph, which quantifies the maximum rate of information transmission over a noisy communication channel, is a long-standing open problem in information theory, graph theory, and combinatorial optimization. This paper develops a new graph limit approach to the Shannon capacity problem, building on the theory of asymptotic spectrum duality.