Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR24-013 | 26th January 2024 15:24

On locally-characterized expander graphs (a survey)

RSS-Feed




TR24-013
Authors: Oded Goldreich
Publication: 26th January 2024 15:24
Downloads: 125
Keywords: 


Abstract:

We consider the notion of a local-characterization of an infinite family of unlabeled bounded-degree graphs.
Such a local-characterization is defined in terms of a finite set of (marked) graphs yielding a generalized notion of subgraph-freeness, which extends the standard notions of induced and non-induced subgraph freeness.

We survey the work of Adler, Kohler and Peng (32nd SODA and 36th CCC, 2021), which is pivoted at constructing locally-characterized expander graphs.
The construction makes inherent use of the iterative and local nature of the Zig-Zag construction of Reingold, Vadhan, and Wigderson ({\em 41st FOCS}, 2000).
This yields a locally-characterizable graph property that cannot be tested (in the bounded-degree graph model) within a number of queries that does not depend on the size of the graph.



ISSN 1433-8092 | Imprint