arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2510.23913cs.DS
收藏

面向非均匀顶点测度的扩展器分解

Expander Decomposition for Non-Uniform Vertex Measures

Tel Aviv University(特拉维夫大学);Max Planck Institute for Informatics(马克斯·普朗克计算机科学研究所)

Daniel Agassy, Dani Dorfman, Haim Kaplan

AI总结:

本文针对非均匀顶点测度下的广义扩展度概念,将ADK的扩展器分解算法推广,提出了随机化Õ(m)时间的对应分解算法,为广义扩展器分解提供参考。

摘要:

含n个顶点、m条边的图G的(ϕ,ε)-扩展器分解,是将顶点集V划分为若干簇V₁,…,V_k,满足每个诱导子图G[V_i]的传导率Φ(G[V_i])≥ϕ,且簇间边数为O(εm),这类分解在诸多图算法中发挥关键作用。Agassy、Dorman与Kaplan于ICALP 2023提出的ADK算法给出了随机化Õ(m)时间复杂度的(ϕ, ϕlog²n)-扩展器分解计算方法。本文将该结果推广到更宽泛的扩展度概念上:设μ∈ℝⁿ≥0为顶点测度,割(S,S̄)传导率的标准推广形式为其μ-扩展度Φ^μ_G(S,S̄)=|E(S,S̄)|/min{μ(S),μ(S̄)},其中μ(S)=∑_{v∈S}μ(v)。本文提出一种随机化Õ(m)时间算法,可计算关于μ-扩展度的(ϕ, ϕlog²n·μ(V)/m)-扩展器分解,本文阐述内容大量适配自ADK工作,可为广义扩展器分解提供便捷参考。

英文摘要:

A $(ϕ,ε)$-expander-decomposition of a graph $G$ (with $n$ vertices and $m$ edges) is a partition of $V$ into clusters $V_1,\ldots,V_k$ with conductance $Φ(G[V_i]) \ge ϕ$, such that there are $O(εm)$ inter-cluster edges. Such a decomposition plays a crucial role in many graph algorithms. [Agassy, Dorman, and Kaplan, ICALP 2023] (ADK) gave a randomized $\tilde{O}(m)$ time algorithm for computing a $(ϕ, ϕ\log^2 {n})$-expander decomposition. In this paper we generalize this result for a broader notion of expansion. Let $μ\in \mathbb{R}_{\ge 0 }^n$ be a vertex measure. A standard generalization of conductance of a cut $(S,\overline{S})$ is its $μ$-expansion $Φ^μ_G(S,\overline{S}) = |E(S,\overline{S})|/\min \{μ(S),μ(\overline{S})\}$, where $μ(S) = \sum_{v\in S} μ(v)$. We present a randomized $\tilde{O}(m)$ time algorithm for computing a $(ϕ, ϕ\log^2 {n}\cdot\frac{μ(V)}{m})$-expander decomposition with respect to $μ$-expansion. A substantial portion of the exposition is adapted from ADK, and this work serves as a convenient reference for generalized expander decomposition.

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

↑