Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Local Reconstructors and Tolerant Testers for Connectivity and Diameter

Local Reconstructors and Tolerant Testers for Connectivity and Diameter

Thumbnail Image
Download
Name

Rubinfeld_Local reconstructors.pdf

Size

236.87 KB

Format

Adobe PDF

Checksum (MD5)

46a3263284ee3c4e264f7e0d4e0fbac1

Author(s)
Campagna, Andrea
•
Rubinfeld, Ronitt
•
Guo, Alan Xinyu
Date Issued
2013
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
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/90839
DOI of Published Version
https://doi.org/10.1007/978-3-642-40328-6_29
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.