Find Your Place: Simple Distributed Algorithms for Community Detection

Find Your Place: Simple Distributed Algorithms for Community Detection
复制标题

找到你的位置:用于社区检测的简单分布式算法

DOI:
10.1137/1.9781611974782.59
复制
发表时间:
2017
期刊:
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA
影响因子:
--
通讯作者:
Trevisan, Luca
Trevisan, Luca
中科院分区:
--
文献类型:
--
作者:
Beeehetti, Luca;Clementi, Andrea;Natale, Emanuele;Pasquale, Francesco;Trevisan, Luca

文献摘要

参考文献

被引文献

相似文献

给定一个底层图,我们考虑以下动态:最初,每个节点在本地均匀随机且独立于其他节点选择一个值。然后,在每个连续的回合中,每个节点将其本地值更新为其邻居所持有的值的平均值,同时应用仅取决于节点所持有的当前值和先前值的基本本地聚类规则。我们证明,在表现出稀疏平衡切割的各种图模型(包括随机块模型)下,这种动态产生的过程会产生精确或近似(取决于图)反映对数时间的基础切割的聚类。我们还证明,这种动态的自然扩展可以在具有多个社区的随机块模型的正则化版本上执行社区检测。令人惊讶的是,我们的结果为极其简单和自然的动态执行社区检测的能力提供了严格的证据,即使在集中式环境中,这个计算问题也不是微不足道的。
Given an underlying graph, we consider the followingdynamics: Initially, each node locally chooses a value in, uniformly at random and independently of other nodes. Then, in each consecutive round, every node updates its local value to the average of the values held by its neighbors, at the same time applying an elementary, local clustering rule that only depends on the current and the previous values held by the node. We prove that the process resulting from this dynamics produces a clustering that exactly or approximately (depending on the graph) reflects the underlying cut in logarithmic time, under various graph models that exhibit a sparse balanced cut, including the stochastic block model. We also prove that a natural extension of this dynamics performs community detection on a regularized version of the stochastic block model with multiple communities. Rather surprisingly, our results provide rigorous evidence for the ability of an extremely simple and natural dynamics to perform community detection, a computational problem which is nontrivial even in a centralized setting.
DOI: 10.1038/srep00656
发表时间: 2012
期刊: SCIENTIFIC REPORTS
影响因子: 4.6
作者:
Cardelli, Luca;Csikasz-Nagy, Attila
通讯作者: Csikasz-Nagy, Attila
DOI: 10.1214/15-aap1145
发表时间: 2013-09
期刊: --
影响因子: --
作者:
Elchanan Mossel;Joe Neeman;A. Sly
通讯作者: Elchanan Mossel;Joe Neeman;A. Sly
随机图覆盖 I:一般理论和图连通性
DOI: --
发表时间: 2002
期刊: Comb.
影响因子: --
作者:
Alon Amit;N. Linial
通讯作者: N. Linial
Graft:Apache Giraph 的调试工具
DOI: --
发表时间: 2015
期刊: SIGMOD Conference
影响因子: --
作者:
S. Salihoglu;Jaeho Shin;V. Khanna;Ba Quan Truong;J. Widom
通讯作者: J. Widom
DOI: 10.1007/s00446-010-0121-5
发表时间: 2011-04-01
影响因子: 1.3
作者:
Metivier, Y.;Robson, J. M.;Zemmari, A.
通讯作者: Zemmari, A.