The Minrank of Random Graphs

DOI10.1109/TIT.2018.2810384MaRDI QIDQ4559572zbMATH OpenOpenAlexFDO

Authors Alexander Golovnev, O. Weinstein, Oded Regev

Publication date 4 December 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1607.04842

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Source coding (94A29) Combinatorial probability (60C05)

Abstract: The minrank of a 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 information-theoretic 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 random ErdH{o}s-R'enyi graphs $G(n,p)$ for all regimes of $pin[0,1]$. In particular, for any constant $p$, we show that $mathsfminrk(G)=Theta(n/logn)$ 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 $Omega(sqrtn)$ (Haviv and Langberg, ISIT'12), and partially settles an open problem raised by Lubetzky and Stav (FOCS '07). Our lower bound matches the well-known 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.

Recommendations

• The minrank of random graphs
• The minrank of random graphs over arbitrary fields
• The rank of random graphs
• Kneser ranks of random graphs and minimum difference representations
• Kneser ranks of random graphs and minimum difference representations
• The rank of diluted random graphs
• The rank of diluted random graphs
• Rank-width of random graphs
• scientific article; zbMATH DE number 7651160
• Expected values of parameters associated with the minimum rank of a graph

Cited in

(10)

• Expected values of parameters associated with the minimum rank of a graph
• Minimal functions on the random graph
• On minrank and forbidden subgraphs
• scientific article; zbMATH DE number 7561683 (Why is no real title available?)
• Orthonormal representations of \(H\)-free graphs
• The (minimum) rank of typical fooling-set matrices
• The Min Mean-Weight Cycle in a Random Network
• Approximating the orthogonality dimension of graphs and hypergraphs
• On minrank and the Lovász theta-function
• Perfect and nearly perfect separation dimension of complete and random graphs

This page was built for publication: The Minrank of Random Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559572)