ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Finding pseudorandom colorings of pseudorandom graphs

Kumar, A and Louis, A and Tulsiani, M (2018) Finding pseudorandom colorings of pseudorandom graphs. In: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017), 12 - 14 December 2017, Kanpur.

[img] PDF
IARCS_FSTTCS_93_2018.pdf - Published Version
Restricted to Registered users only

Download (492kB) | Request a copy
Official URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2017.37


We consider the problem of recovering a planted pseudorandom 3-coloring in expanding and low threshold-rank graphs. Alon and Kahale SICOMP 1997 gave a spectral algorithm to recover the coloring for a random graph with a planted random 3-coloring. We show that their analysis can be adapted to work when coloring is pseudorandom i.e., all color classes are of equal size and the size of the intersection of the neighborhood of a random vertex with each color class has small variance. We also extend our results to partial colorings and low threshold-rank graphs to show the following: For graphs on n vertices with threshold-rank r, for which there exists a 3-coloring that is e-pseudorandom and properly colors the induced subgraph on (1 - ?) · n vertices, we show how to recover the coloring for (1 - O(? + e)) · n vertices in time (r · n)O(r). For expanding graphs on n vertices, which admit a pseudorandom 3-coloring properly coloring all the vertices, we show how to recover such a coloring in polynomial time. Our results are obtained by combining the method of Alon and Kahale, with eigenspace enumeration methods used for solving constraint satisfaction problems on low threshold-rank graphs.

Item Type: Conference Paper
Publication: Leibniz International Proceedings in Informatics, LIPIcs
Publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Additional Information: The copyright for this article belongs to Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Keywords: Color; Coloring; Constraint satisfaction problems; Graphic methods; Polynomial approximation; Recovery; Software engineering, Enumeration method; Expanders; Graph colorings; Induced subgraphs; Partial coloring; Polynomial-time; Pseudorandom graph; Spectral algorithm, Graph theory
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 22 Aug 2022 09:00
Last Modified: 22 Aug 2022 09:00
URI: https://eprints.iisc.ac.in/id/eprint/76110

Actions (login required)

View Item View Item