Independent sets in graph powers are almost contained in juntas

Irit Dinur, Ehud Friedgut, Oded Regev

Research output: Contribution to journalArticle

Abstract

Let G = (V,E) be a simple undirected graph. Define G n , the n-th power of G, as the graph on the vertex set V n in which two vertices (u 1, . . . , u n ) and (v 1, . . . , v n ) are adjacent if and only if u i is adjacent to v i in G for every i. We give a characterization of all independent sets in such graphs whenever G is connected and non-bipartite. Consider the stationary measure of the simple random walk on G n . We show that every independent set is almost contained with respect to this measure in a junta, a cylinder of constant co-dimension. Moreover we show that the projection of that junta defines a nearly independent set, i.e. it spans few edges (this also guarantees that it is not trivially the entire vertex-set). Our approach is based on an analog of Fourier analysis for product spaces combined with spectral techniques and on a powerful invariance principle presented in [MoOO]. This principle has already been shown in [DiMR] to imply that independent sets in such graph products have an influential coordinate. In this work we prove that in fact there is a set of few coordinates and a junta on them that capture the independent set almost completely.

Original languageEnglish (US)
Pages (from-to)77-97
Number of pages21
JournalGeometric and Functional Analysis
Volume18
Issue number1
DOIs
StatePublished - Apr 2008

Fingerprint

Graph Powers
Independent Set
Adjacent
Graph Products
Stationary Measure
Simple Random Walk
Invariance Principle
Product Space
Fourier Analysis
Graph in graph theory
Vertex of a graph
Simple Graph
Undirected Graph
Codimension
Entire
Projection
If and only if
Analogue
Imply

Keywords

  • Discrete Fourier analysis
  • Independent sets
  • Intersecting families
  • Product graphs

ASJC Scopus subject areas

  • Mathematics(all)
  • Analysis

Cite this

Independent sets in graph powers are almost contained in juntas. / Dinur, Irit; Friedgut, Ehud; Regev, Oded.

In: Geometric and Functional Analysis, Vol. 18, No. 1, 04.2008, p. 77-97.

Research output: Contribution to journalArticle

@article{02bcca80fab149eba5490ac410d26d6a,
title = "Independent sets in graph powers are almost contained in juntas",
abstract = "Let G = (V,E) be a simple undirected graph. Define G n , the n-th power of G, as the graph on the vertex set V n in which two vertices (u 1, . . . , u n ) and (v 1, . . . , v n ) are adjacent if and only if u i is adjacent to v i in G for every i. We give a characterization of all independent sets in such graphs whenever G is connected and non-bipartite. Consider the stationary measure of the simple random walk on G n . We show that every independent set is almost contained with respect to this measure in a junta, a cylinder of constant co-dimension. Moreover we show that the projection of that junta defines a nearly independent set, i.e. it spans few edges (this also guarantees that it is not trivially the entire vertex-set). Our approach is based on an analog of Fourier analysis for product spaces combined with spectral techniques and on a powerful invariance principle presented in [MoOO]. This principle has already been shown in [DiMR] to imply that independent sets in such graph products have an influential coordinate. In this work we prove that in fact there is a set of few coordinates and a junta on them that capture the independent set almost completely.",
keywords = "Discrete Fourier analysis, Independent sets, Intersecting families, Product graphs",
author = "Irit Dinur and Ehud Friedgut and Oded Regev",
year = "2008",
month = "4",
doi = "10.1007/s00039-008-0651-1",
language = "English (US)",
volume = "18",
pages = "77--97",
journal = "Geometric and Functional Analysis",
issn = "1016-443X",
publisher = "Birkhauser Verlag Basel",
number = "1",

}

TY - JOUR

T1 - Independent sets in graph powers are almost contained in juntas

AU - Dinur, Irit

AU - Friedgut, Ehud

AU - Regev, Oded

PY - 2008/4

Y1 - 2008/4

N2 - Let G = (V,E) be a simple undirected graph. Define G n , the n-th power of G, as the graph on the vertex set V n in which two vertices (u 1, . . . , u n ) and (v 1, . . . , v n ) are adjacent if and only if u i is adjacent to v i in G for every i. We give a characterization of all independent sets in such graphs whenever G is connected and non-bipartite. Consider the stationary measure of the simple random walk on G n . We show that every independent set is almost contained with respect to this measure in a junta, a cylinder of constant co-dimension. Moreover we show that the projection of that junta defines a nearly independent set, i.e. it spans few edges (this also guarantees that it is not trivially the entire vertex-set). Our approach is based on an analog of Fourier analysis for product spaces combined with spectral techniques and on a powerful invariance principle presented in [MoOO]. This principle has already been shown in [DiMR] to imply that independent sets in such graph products have an influential coordinate. In this work we prove that in fact there is a set of few coordinates and a junta on them that capture the independent set almost completely.

AB - Let G = (V,E) be a simple undirected graph. Define G n , the n-th power of G, as the graph on the vertex set V n in which two vertices (u 1, . . . , u n ) and (v 1, . . . , v n ) are adjacent if and only if u i is adjacent to v i in G for every i. We give a characterization of all independent sets in such graphs whenever G is connected and non-bipartite. Consider the stationary measure of the simple random walk on G n . We show that every independent set is almost contained with respect to this measure in a junta, a cylinder of constant co-dimension. Moreover we show that the projection of that junta defines a nearly independent set, i.e. it spans few edges (this also guarantees that it is not trivially the entire vertex-set). Our approach is based on an analog of Fourier analysis for product spaces combined with spectral techniques and on a powerful invariance principle presented in [MoOO]. This principle has already been shown in [DiMR] to imply that independent sets in such graph products have an influential coordinate. In this work we prove that in fact there is a set of few coordinates and a junta on them that capture the independent set almost completely.

KW - Discrete Fourier analysis

KW - Independent sets

KW - Intersecting families

KW - Product graphs

UR - http://www.scopus.com/inward/record.url?scp=42749093780&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=42749093780&partnerID=8YFLogxK

U2 - 10.1007/s00039-008-0651-1

DO - 10.1007/s00039-008-0651-1

M3 - Article

VL - 18

SP - 77

EP - 97

JO - Geometric and Functional Analysis

JF - Geometric and Functional Analysis

SN - 1016-443X

IS - 1

ER -