arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0807.1496cs.DMcs.NI
收藏

基于随机生成树的扩展器

Expanders via Random Spanning Trees

Navin Goyal, Luis Rademacher, Santosh Vempala

摘要:

出于在图中可靠地和可扩展地路由的问题,我们引入了拼接器的概念,图的生成树的联合。我们证明了,对于任何有界度的n-顶点图,两个随机生成树的联盟近似的扩展的每一个削减的图内的一个因素的O(log n)。对于随机图G_{n,p},当p> c log{n}/n时,两棵生成树给出一个扩张器.这是建议的情况下,完全图,我们证明了两个随机生成树给一个扩展。拼接器的构造是基本的-每个生成树可以使用Aldous和Broder的算法独立生成:图中的随机行走,其边缘导致树中包含的先前未访问的顶点。拼接器的第二个重要应用是图稀疏化,其目标是仅使用原始图的一个小子图来近似每个切割(更一般地是拉普拉斯算子的二次形式)。Benczur-Karger和Spielman-Srivastava已经证明了具有O(n log n/eps^2)$边的稀疏算子,它们在因子1+eps和1-eps内实现了近似。他们的方法基于边的独立采样,需要Omega(n log n)个边来获得任何近似(否则子图可能是不连通的),并留下了线性尺寸稀疏器的问题。拼接器通过提供大小为O(n)的稀疏化器来解决随机图的这个问题,该稀疏化器将每个切割近似为O(log n)的因子。

英文摘要:

Motivated by the problem of routing reliably and scalably in a graph, we introduce the notion of a splicer, the union of spanning trees of a graph. We prove that for any bounded-degree n-vertex graph, the union of two random spanning trees approximates the expansion of every cut of the graph to within a factor of O(log n). For the random graph G_{n,p}, for p> c log{n}/n, two spanning trees give an expander. This is suggested by the case of the complete graph, where we prove that two random spanning trees give an expander. The construction of the splicer is elementary -- each spanning tree can be produced independently using an algorithm by Aldous and Broder: a random walk in the graph with edges leading to previously unvisited vertices included in the tree. A second important application of splicers is to graph sparsification where the goal is to approximate every cut (and more generally the quadratic form of the Laplacian) using only a small subgraph of the original graph. Benczur-Karger as well as Spielman-Srivastava have shown sparsifiers with O(n log n/eps^2)$ edges that achieve approximation within factors 1+eps and 1-eps. Their methods, based on independent sampling of edges, need Omega(n log n) edges to get any approximation (else the subgraph could be disconnected) and leave open the question of linear-size sparsifiers. Splicers address this question for random graphs by providing sparsifiers of size O(n) that approximate every cut to within a factor of O(log n).

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

↑