首页> 美国卫生研究院文献>other >Markov Dynamics as a Zooming Lens for Multiscale Community Detection: Non Clique-Like Communities and the Field-of-View Limit
【2h】

Markov Dynamics as a Zooming Lens for Multiscale Community Detection: Non Clique-Like Communities and the Field-of-View Limit

机译:马尔科夫动力学的镜头变焦多尺度社区发现:非派像社区和现场的视图的限制

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In recent years, there has been a surge of interest in community detection algorithms for complex networks. A variety of computational heuristics, some with a long history, have been proposed for the identification of communities or, alternatively, of good graph partitions. In most cases, the algorithms maximize a particular objective function, thereby finding the ‘right’ split into communities. Although a thorough comparison of algorithms is still lacking, there has been an effort to design benchmarks, i.e., random graph models with known community structure against which algorithms can be evaluated. However, popular community detection methods and benchmarks normally assume an implicit notion of community based on clique-like subgraphs, a form of community structure that is not always characteristic of real networks. Specifically, networks that emerge from geometric constraints can have natural non clique-like substructures with large effective diameters, which can be interpreted as long-range communities. In this work, we show that long-range communities escape detection by popular methods, which are blinded by a restricted ‘field-of-view’ limit, an intrinsic upper scale on the communities they can detect. The field-of-view limit means that long-range communities tend to be overpartitioned. We show how by adopting a dynamical perspective towards community detection , , in which the evolution of a Markov process on the graph is used as a zooming lens over the structure of the network at all scales, one can detect both clique- or non clique-like communities without imposing an upper scale to the detection. Consequently, the performance of algorithms on inherently low-diameter, clique-like benchmarks may not always be indicative of equally good results in real networks with local, sparser connectivity. We illustrate our ideas with constructive examples and through the analysis of real-world networks from imaging, protein structures and the power grid, where a multiscale structure of non clique-like communities is revealed.
机译:近年来,对复杂网络的社区检测算法有兴趣激增。已经提出了各种计算启发式,其中一些具有悠久的历史,以识别社区,或者是良好的图形分区。在大多数情况下,该算法最大化特定的目标函数,从而找到了“右”分为社区。尽管仍然缺乏算法的彻底比较,但是努力设计基准,即随机图模型,其中具有已知的社区结构,可以根据可以评估算法。然而,流行的社区检测方法和基准通常假设基于Clique的子图的社区的隐含概念,这是一种非始终是真实网络的特征的社区结构的形式。具体地,从几何约束中出现的网络可以具有具有大有效直径的自然非群体状子结构,其可以被解释为远程社区。在这项工作中,我们表明,通过受限制的“视野”限制,广泛的社区通过流行的方法偏见,它们可以检测到社区的内部大规模。视野视野限制意味着远程社区往往是过分的。我们展示如何采用动态视角对社区检测,其中,图表上的马尔可夫过程的演变用作在所有尺度的网络结构上用作缩放镜头,可以检测到Clique-或非集团像社区一样,没有向检测施加大规模。因此,算法对固有的低直径,Clique等基准的性能可能并不总是指示具有局部稀疏连接的真实网络中的同等良好的结果。我们用建设性的例子和通过对成像,蛋白质结构和电网的实际网络分析来说明我们的想法,其中揭示了非集团相同的社区的多尺度结构。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号