arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1105.3383cs.DMmath.CO
收藏

图的笛卡尔积的割

Cuts in Cartesian Products of Graphs

Sushant Sachdeva, Madhur Tulsiani

摘要:

图G的k重笛卡尔积被定义为一个k元组图,其中两个元组连通,如果它们在其中一个位置形成边,并且在其余位置相等。从G作为一条边开始,G^k作为一个k维超立方体。我们研究了G^k中的一个割所穿过的边在G的不同位置的拷贝上的分布。这是超立方体上切割影响概念的推广。我们展示了类似的结果Kahn,Kalai和Linial(KKL定理[KahnKL 88])和Friedgut(Friedgut的Junta定理[Friedgut 98]),为设置任意图的笛卡尔积。我们的证明扩展了Rossignol [Rossignol06]和Falik和Samorodnitsky [FalikS07]的论点,到任意笛卡尔积的情况。我们还将研究这些图的等周常数的工作[HoudreT96,ChungT98]扩展到边扩张的半定松弛的值。对于G和G^k,我们将由各种半定族给出的用于计算展开的松弛的最优值连接起来。

英文摘要:

The k-fold Cartesian product of a graph G is defined as a graph on k-tuples of vertices, where two tuples are connected if they form an edge in one of the positions and are equal in the rest. Starting with G as a single edge gives G^k as a k-dimensional hypercube. We study the distributions of edges crossed by a cut in G^k across the copies of G in different positions. This is a generalization of the notion of influences for cuts on the hypercube. We show the analogues of results of Kahn, Kalai, and Linial (KKL Theorem [KahnKL88]) and that of Friedgut (Friedgut's Junta theorem [Friedgut98]), for the setting of Cartesian products of arbitrary graphs. Our proofs extend the arguments of Rossignol [Rossignol06] and of Falik and Samorodnitsky [FalikS07], to the case of arbitrary Cartesian products. We also extend the work on studying isoperimetric constants for these graphs [HoudreT96, ChungT98] to the value of semidefinite relaxations for edge-expansion. We connect the optimal values of the relaxations for computing expansion, given by various semidefinite hierarchies, for G and G^k.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑