Finding community structure in very large networks.
Reads0
Chats0
TLDR
A hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure.Abstract:
The discovery and analysis of community structure in networks is a topic of considerable recent interest within the physics community, but most methods proposed so far are unsuitable for very large networks because of their computational cost. Here we present a hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure. Many real-world networks are sparse and hierarchical, with m approximately n and d approximately log n, in which case our algorithm runs in essentially linear time, O (n log(2) n). As an example of the application of this algorithm we use it to analyze a network of items for sale on the web site of a large on-line retailer, items in the network being linked if they are frequently purchased by the same buyer. The network has more than 400 000 vertices and 2 x 10(6) edges. We show that our algorithm can extract meaningful communities from this network, revealing large-scale patterns present in the purchasing habits of customers.read more
Citations
More filters
Journal ArticleDOI
Community detection in complex networks
TL;DR: In this paper, a novel multi-objective discrete backtracking search optimization algorithm with decomposition is proposed for community detection in complex networks, where the updating rules of individuals are redesigned based on the network topology.
Journal ArticleDOI
An efficient community detection method based on rank centrality
Yawen Jiang,Caiyan Jia,Jian Yu +2 more
TL;DR: An efficient algorithm K-rank is proposed, which selects the top-K nodes with the highest rank centrality as the initial seeds, and updates these seeds by using an iterative technique like K-means, and is extended to partition directed, weighted networks, and to detect overlapping communities.
Journal ArticleDOI
Topological and functional comparison of community detection algorithms in biological networks
TL;DR: For Yeast and Human PPI networks, Louvain method is likely the best method to find communities in terms of detecting known core pathways in a reasonable time, and is the fastest method for community detection.
Book ChapterDOI
A New Genetic Algorithm for Community Detection
TL;DR: A new genetic algorithm for community detection is proposed that uses the fundamental measure criterion modularity Q as the fitness function and a special locus-based adjacency encoding scheme is applied to represent the community partition.
Journal ArticleDOI
Genetic and Proteomic Interrogation of Lower Confidence Candidate Genes Reveals Signaling Networks in β-Catenin-Active Cancers
Joseph Rosenbluh,Joseph Rosenbluh,Johnathan Mercer,Johnathan Mercer,Yashaswi Shrestha,Rachel A. Oliver,Rachel A. Oliver,Pablo Tamayo,John G. Doench,Itay Tirosh,Federica Piccioni,Ella Hartenian,Heiko Horn,Heiko Horn,Lola Fagbami,David E. Root,Jacob D. Jaffe,Kasper Lage,Kasper Lage,Jesse S. Boehm,William C. Hahn,William C. Hahn +21 more
TL;DR: These studies identify previously unreported regulators of β-catenin, define functional networks required for the survival ofβ- catenin-active cancers, and provide an experimental strategy that may be applied to define other signaling networks.
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.
疟原虫var基因转换速率变化导致抗原变异[英]/Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A
TL;DR: PfPMP1)与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用,在黏附及免疫逃避中起关键的作�ly.
Journal ArticleDOI
Statistical mechanics of complex networks
TL;DR: In this paper, a simple model based on the power-law degree distribution of real networks was proposed, which was able to reproduce the power law degree distribution in real networks and to capture the evolution of networks, not just their static topology.
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.