MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Local Reconstructors and Tolerant Testers for Connectivity and Diameter

Author(s)
Campagna, Andrea; Rubinfeld, Ronitt; Guo, Alan Xinyu
Thumbnail
DownloadRubinfeld_Local reconstructors.pdf (236.8Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
A local property reconstructor for a graph property is an algorithm which, given oracle access to the adjacency list of a graph that is “close” to having the property, provides oracle access to the adjacency matrix of a “correction” of the graph, i.e. a graph which has the property and is close to the given graph. For this model, we achieve local property reconstructors for the properties of connectivity and k-connectivity in undirected graphs, and the property of strong connectivity in directed graphs. Along the way, we present a method of transforming a local reconstructor (which acts as a “adjacency matrix oracle” for the corrected graph) into an “adjacency list oracle”. This allows us to recursively use our local reconstructor for (k − 1)-connectivity to obtain a local reconstructor for k-connectivity. We also extend this notion of local reconstruction to parametrized graph properties (for instance, having diameter at most D for some parameter D) and require that the corrected graph has the property with parameter close to the original. We obtain a local reconstructor for the low diameter property, where if the original graph is close to having diameter D, then the corrected graph has diameter roughly 2D. We also exploit a connection between local property reconstruction and property testing, observed by Brakerski, to obtain new tolerant property testers for all of the aforementioned properties. Except for the one for connectivity, these are the first tolerant property testers for these properties.
Date issued
2013
URI
http://hdl.handle.net/1721.1/90839
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Publisher
Springer-Verlag
Citation
Campagna, Andrea, Alan Guo, and Ronitt Rubinfeld. “Local Reconstructors and Tolerant Testers for Connectivity and Diameter.” Lecture Notes in Computer Science (2013): 411–424.
Version: Original manuscript
ISBN
978-3-642-40327-9
978-3-642-40328-6
ISSN
0302-9743
1611-3349

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.