Home
Scholarly Works
Type Graphs and Small-Set Expansion
Conference

Type Graphs and Small-Set Expansion

Abstract

In this paper, we study the type graph, namely a bipartite graph induced by a joint type. We study the maximum edge density of induced bipartite subgraphs of this graph having a number of vertices on each side on an exponential scale. This can be seen as an isoperimetric problem. We provide asymptotically sharp bounds for the exponent of the maximum edge density as the blocklength goes to infinity. We also study the biclique rate region of the type graph, which is defined as the set of ($R_{1}, R_{2}$) such that there exists a biclique of the type graph which has respectively $e^{nR_{1}}$ and $e^{nR_{2}}$ vertices on the two sides. We provide asymptotically sharp bounds for the biclique rate region as well. We also apply similar techniques to strengthen small-set expansion theorems.

Authors

Yu L; Anantharam V; Chen J

Volume

00

Pagination

pp. 993-998

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Publication Date

July 20, 2021

DOI

10.1109/isit45174.2021.9517992

Name of conference

2021 IEEE International Symposium on Information Theory (ISIT)
View published work (Non-McMaster Users)

Contact the Experts team