The minrank of a directed graph G is the minimum rank of a matrix M that can be obtained from the adjacency matrix of G by switching some ones to zeros (i.e., deleting edges) and then setting all diagonal entries to one. This quantity is closely related to the fundamental informationtheoretic problems of (linear) index coding (Bar-Yossef et al., FOCS'06), network coding and distributed storage, and to Valiant's approach for proving superlinear circuit lower bounds (Valiant, Boolean Function Complexity '92). We prove tight bounds on the minrank of directed Erdos-Rényi random graphs G(n, p) for all regimes of p 2 [0, 1]. In particular, for any constant p, we show that minrk(G) = (n/ log n) with high probability, where G is chosen from G(n, p). This bound gives a near quadratic improvement over the previous best lower bound of (p n) (Haviv and Langberg, ISIT'12), and partially settles an open problem raised by Lubetzky and Stav (FOCS '07). Our lower bound matches the wellknown upper bound obtained by the "clique covering" solution, and settles the linear index coding problem for random graphs. Finally, our result suggests a new avenue of attack, via derandomization, on Valiant's approach for proving superlinear lower bounds for logarithmic-depth semilinear circuits.
|Original language||American English|
|Title of host publication||Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017|
|Editors||Jose D. P. Rolim, Klaus Jansen, David P. Williamson, Santosh S. Vempala|
|Publisher||Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing|
|State||Published - 1 Aug 2017|
|Event||20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2017 and the 21st International Workshop on Randomization and Computation, RANDOM 2017 - Berkeley, United States|
Duration: 16 Aug 2017 → 18 Aug 2017
|Name||Leibniz International Proceedings in Informatics, LIPIcs|
|Conference||20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2017 and the 21st International Workshop on Randomization and Computation, RANDOM 2017|
|Period||16/08/17 → 18/08/17|
Bibliographical noteFunding Information:
∗ This work was partially supported by the Simons Collaboration on Algorithms and Geometry and by the National Science Foundation (NSF) under Grant No. CCF-1320188. The work was done when Omri Weinstein was supported by a Simons Junior fellowship. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the NSF.
© Alexander Golovnev, Oded Regev, and Omri Weinstein.
- Circuit complexity
- Index coding
- Information theory