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

无标度网络上的分布式极大独立集

Distributed Maximal Independent Set on Scale-Free Networks

Hasan Heydari, S. Mahmoud Taheri, Kaveh Kavousi

摘要:

研究了具有幂律权值的非齐次随机图上的分布最大独立集问题,利用该问题可以构造无标度网络。这样一个特定的问题已经解决了图形与$n$顶点的最先进的算法的时间复杂度为$O(\log{n})$。证明了对于幂律指数为$β> 3$的无标度网络,其导出子图由度大于$\log{n}\log^{*}{n}$的顶点构成,几乎必然(a.s.)是幂律指数为$β' = 2$的无标度网络.然后,我们提出了一个新的算法,计算无标度网络上的MIS的时间复杂度为$O(\frac{\log{n}}{\log{\log{n}}})$ a.s.,其优于$O(\log{n})$。进一步证明了在具有$β\geq 3$的无标度网络上,荫度和简并度以高概率(w.h.p.)小于$2^{log^{1/3}n}$.最后证明了用$β\geq 3$在无标度网络上寻找MIS的时间复杂度为$O(log^{2/3}n)$ w.h.p.

英文摘要:

The problem of distributed maximal independent set (MIS) is investigated on inhomogeneous random graphs with power-law weights by which the scale-free networks can be produced. Such a particular problem has been solved on graphs with $n$ vertices by state-of-the-art algorithms with the time complexity of $O(\log{n})$. We prove that for a scale-free network with power-law exponent $β> 3$, the induced subgraph is constructed by vertices with degrees larger than $\log{n}\log^{*}{n}$ is a scale-free network with $β' = 2$, almost surely (a.s.). Then, we propose a new algorithm that computes an MIS on scale-free networks with the time complexity of $O(\frac{\log{n}}{\log{\log{n}}})$ a.s., which is better than $O(\log{n})$. Furthermore, we prove that on scale-free networks with $β\geq 3$, the arboricity and degeneracy are less than $2^{log^{1/3}n}$ with high probability (w.h.p.). Finally, we prove that the time complexity of finding an MIS on scale-free networks with $β\geq 3$ is $O(log^{2/3}n)$ w.h.p.

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

↑