Finding community structure in networks using the eigenvectors of matrices
Reads0
Chats0
TLDR
A modularity matrix plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations, and a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong are proposed.Abstract:
We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as ``modularity'' over possible divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a number of possible algorithms for detecting community structure, as well as several other results, including a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong. The algorithms and measures proposed are illustrated with applications to a variety of real-world complex networks.read more
Citations
More filters
Community detection in complex networks
TL;DR: This work combines classic ideas in topic modeling with a variant of the mixed-membership block model recently developed in the statistical physics community, which has the advantage that its parameters can be inferred with a simple and scalable expectation-maximization algorithm.
Posted Content
Emergent Community Structure in Social Tagging Systems
TL;DR: In this article, the authors leverage the social aspects of collaborative tagging and introduce a notion of resource distance based on the collective tagging activity of users, which can be used to build a weighted network of resources with a detectable community structure.
Journal ArticleDOI
Refining Social Graph Connectivity via Shortcut Edge Addition
TL;DR: This paper considers the problem of adding a small set of nonexisting edges (shortcuts) in a social graph with the main objective of minimizing its characteristic path length, which determines the average distance between pairs of vertices and essentially controls how broadly information can propagate through a network.
Journal ArticleDOI
Partisan Asymmetries in Online Political Activity
TL;DR: The authors examined partisan differences in the behavior, communication patterns and social interactions of more than 18,000 politically active Twitter users to produce evidence that points to changing levels of partisan engagement with the American online political landscape.
Journal ArticleDOI
Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient
TL;DR: An alternate algorithm for detecting overlapping community structures in the complex network using the maximal sub-graph and the clustering coefficient and a new extended modularity is proposed to quantify this algorithm.
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI
The Strength of Weak Ties
TL;DR: In this paper, it is argued that the degree of overlap of two individuals' friendship networks varies directly with the strength of their tie to one another, and the impact of this principle on diffusion of influence and information, mobility opportunity, and community organization is explored.
Journal ArticleDOI
Emergence of Scaling in Random Networks
TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A
TL;DR: PfPMP1）与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作�ly.
Journal ArticleDOI
The Structure and Function of Complex Networks
TL;DR: Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.