arXiv 0709.21082007-09-13physics.data-ancond-mat.stat-mechphysics.soc-ph

Robustness of community structure in networks

Brian Karrer, Elizaveta Levina, M. E. J. Newman

备注：: 10 pages, 2 figures
发表信息：: Phys. Rev. E 77, 046119 (2008)
DOI：: 10.1103/PhysRevE.77.046119

英文摘要：

The discovery of community structure is a common challenge in the analysis of network data. Many methods have been proposed for finding community structure, but few have been proposed for determining whether the structure found is statistically significant or whether, conversely, it could have arisen purely as a result of chance. In this paper we show that the significance of community structure can be effectively quantified by measuring its robustness to small perturbations in network structure. We propose a suitable method for perturbing networks and a measure of the resulting change in community structure and use them to assess the significance of community structure in a variety of networks, both real and computer generated.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

浅层图嵌入方法在社区检测中的鲁棒性

Robustness of shallow graph embedding methods for community detection

Advanced Computing, Mathematics, and Data Division, Pacific Northwest National Laboratory（太平洋西北国家实验室高级计算、数学与数据部门）；Department of Mathematics, Indiana University（印第安纳大学数学系）；Computer Science and Mathematics Division, Oak Ridge National Laboratory（橡树岭国家实验室计算机科学与数学部门）

本研究通过节点删除扰动实验，比较了矩阵分解与随机游走两类浅层图嵌入方法在社区检测中的鲁棒性，发现node2vec和LLE表现最优，并指出网络规模、社区强度及扰动类型影响鲁棒性。

2026-09-10cs.LGcs.SIphysics.data-an

How to Measure Significance of Community Structure in Complex Networks

Community structure analysis is a powerful tool for complex networks, which can simplify their functional analysis considerably. Recently, many approaches were proposed to community structure detection, but few works were focused on the significance of community structure. Since real networks obtained from complex systems always contain error links, and most of the community detection algorithms have random factors, evaluate the significance of community structure is important and urgent. In this paper, we use the eigenvectors' stability to characterize the significance of community structures…

2010-02-10physics.data-anphysics.soc-ph

Robustness modularity in complex networks

Indiana University Network Science Institute（印第安纳大学网络科学研究所）；King Abdulaziz University（阿卜杜勒阿齐兹国王大学）；Luddy School of Informatics, Computing and Engineering, Indiana University（印第安纳大学拉迪信息学、计算与工程学院）

A basic question in network community detection is how modular a given network is. This is usually addressed by evaluating the quality of partitions detected in the network. The Girvan-Newman (GN) modularity function is the standard way to make this assessment, but it has a number of drawbacks. Most importantly, it is not clearly interpretable, given that the measure can take relatively large values on partitions of random networks without communities. Here we propose a new measure based on the concept of robustness: modularity is the probability to find trivial partitions when the structure o…

2021-10-05cs.LGcs.SIphysics.data-an

Stochastic blockmodels and community structure in networks

Stochastic blockmodels have been proposed as a tool for detecting community structure in networks as well as for generating synthetic networks for use as benchmarks. Most blockmodels, however, ignore variation in vertex degree, making them unsuitable for applications to real-world networks, which typically display broad degree distributions that can significantly distort the results. Here we demonstrate how the generalization of blockmodels to incorporate this missing element leads to an improved objective function for community detection in complex networks. We also propose a heuristic algori…

2010-08-23cond-mat.stat-mechcs.SIphysics.data-an

A dual assortative measure of community structure

Current community detection algorithms operate by optimizing a statistic called modularity, which analyzes the distribution of positively weighted edges in a network. Modularity does not account for negatively weighted edges. This paper introduces a dual assortative modularity measure (DAMM) that incorporates both positively and negatively weighted edges. We describe the the DAMM statistic and illustrate its utility in a community detection algorithm. We evaluate the efficacy of the algorithm on both computer generated and real-world networks, showing that DAMM broadens the domain of networks …

2008-01-21physics.data-anphysics.soc-ph

Opinion Divergence Reveals the Hierarchical and Overlapping Community Structure in Networks

Often exhibiting hierarchical and overlapping structures, communities or modular groups are fundamental and complex in network science. One of the most exploited tools to detect the mesoscopic structure is synchronization. Several phenomena including convergence rate and local convergence under constraints are studied to uncover the existence and features of communities. Here, employing a background of opinion dynamics, we study the divergence of agents' opinions, i.e. the state differences of nodes, in the progress of reaching global consensus and then reveal its connections with hierarchy an…

2018-07-03physics.data-anphysics.soc-ph

更多相关论文收起更多论文

Robust network community detection using balanced propagation

Label propagation has proven to be an extremely fast method for detecting communities in large complex networks. Furthermore, due to its simplicity, it is also currently one of the most commonly adopted algorithms in the literature. Despite various subsequent advances, an important issue of the algorithm has not yet been properly addressed. Random (node) update orders within the algorithm severely hamper its robustness, and consequently also the stability of the identified community structure. We note that an update order can be seen as increasing propagation preferences from certain nodes, an…

2011-06-27cs.SIphysics.data-anphysics.soc-ph

The way to uncover community structure with core and diversity

Communities are ubiquitous in nature and society. Individuals that share common properties often self-organize to form communities. Avoiding the shortages of computation complexity, pre-given information and unstable results in different run, in this paper, we propose a simple and effcient method to deepen our understanding of the emergence and diversity of communities in complex systems. By introducing the rational random selection, our method reveals the hidden deterministic and normal diverse community states of community structure. To demonstrate this method, we test it with real-world sys…

2017-06-28cs.SIphysics.data-anphysics.soc-ph

Finding missing edges in networks based on their community structure

Many edge prediction methods have been proposed, based on various local or global properties of the structure of an incomplete network. Community structure is another significant feature of networks: Vertices in a community are more densely connected than average. It is often true that vertices in the same community have "similar" properties, which suggests that missing edges are more likely to be found within communities than elsewhere. We use this insight to propose a strategy for edge prediction that combines existing edge prediction methods with community detection. We show that this metho…

2012-05-15cs.IRcs.SIphysics.data-an

Efficiently inferring community structure in bipartite networks

Bipartite networks are a common type of network data in which there are two types of vertices, and only vertices of different types can be connected. While bipartite networks exhibit community structure like their unipartite counterparts, existing approaches to bipartite community detection have drawbacks, including implicit parameter choices, loss of information through one-mode projections, and lack of interpretability. Here we solve the community detection problem for bipartite networks by formulating a bipartite stochastic block model, which explicitly includes vertex type information and …

2014-07-10cs.SIphysics.data-anphysics.soc-ph

Router-level community structure of the Internet Autonomous Systems

The Internet is composed of routing devices connected between them and organized into independent administrative entities: the Autonomous Systems. The existence of different types of Autonomous Systems (like large connectivity providers, Internet Service Providers or universities) together with geographical and economical constraints, turns the Internet into a complex modular and hierarchical network. This organization is reflected in many properties of the Internet topology, like its high degree of clustering and its robustness. In this work, we study the modular structure of the Internet rou…

2015-03-27cs.DScs.NIcs.SI

Enhanced Community Structure Detection in Complex Networks with Partial Background Information

Community structure detection in complex networks is important since it can help better understand the network topology and how the network works. However, there is still not a clear and widely-accepted definition of community structure, and in practice, different models may give very different results of communities, making it hard to explain the results. In this paper, different from the traditional methodologies, we design an enhanced semi-supervised learning framework for community detection, which can effectively incorporate the available prior information to guide the detection process a…

2013-05-13cs.SIphysics.comp-phphysics.data-an