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
Posted ContentDOI
Community Detection via Semi-Synchronous Label Propagation Algorithms
Gennaro Cordasco,Luisa Gargano +1 more
TL;DR: A semi-synchronous version of LPA which aims to combine the advantages of both synchronous and asynchronous models is presented and it is proved that the models always converge to a stable labeling.
Posted Content
Network Representation Learning: A Survey.
TL;DR: A comprehensive review of the current literature on network representation learning in the data mining and machine learning field, proposing new taxonomies to categorize and summarize the state-of-the-art network representationLearning techniques according to the underlying learning mechanisms, the network information intended to preserve, as well as the algorithmic designs and methodologies.
Posted Content
Coarse-Grained Topology Estimation via Graph Sampling
TL;DR: In this article, the authors proposed a method to estimate the global topology of a graph from a probability sample of nodes, where nodes are partitioned into categories (e.g., countries or work/study places in OSNs), which naturally defines a weighted category graph.
Journal ArticleDOI
Link Prediction Adversarial Attack Via Iterative Gradient Attack
TL;DR: The results on comprehensive experiments of different real-world graphs indicate that most deep models and even the state-of-the-art link prediction algorithms cannot escape the adversarial attack, such as GAE.
Journal ArticleDOI
Modularity and robustness of bone networks.
TL;DR: The results indicate that the modular structure improves the robustness of the bone network when compared to a regular network with the same average degree and number of nodes.
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.