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
Resilience of networks with community structure behaves as if under an external field
Gaogao Dong,Gaogao Dong,Jingfang Fan,Louis M. Shekhtman,Saray Shai,Ruijin Du,Ruijin Du,Lixin Tian,Lixin Tian,Xiaosong Chen,H. Eugene Stanley,H. Eugene Stanley,Shlomo Havlin,Shlomo Havlin +13 more
TL;DR: In this paper, the authors use percolation theory to develop a framework for studying the resilience of networks with a community structure, and they find both analytically and numerically that interlinks (the connections among communities) affect the Percolation phase transition in a way similar to an external field in a ferromagnetic-paramagnetic spin system.
Journal ArticleDOI
Enhance the Performance of Network Computation by a Tunable Weighting Strategy
TL;DR: A new two-modes weighting strategy based on the concept of communication neighbor graph, which takes use of both the local and global topological properties, e.g., degreecentrality, betweenness centrality, and closeness centrality is proposed.
Journal ArticleDOI
Aberrant cerebral network topology and mild cognitive impairment in early Parkinson's disease
Joana B. Pereira,Dag Aarsland,Dag Aarsland,Cedric E. Ginestet,Alexander V. Lebedev,Lars-Olof Wahlund,Andrew Simmons,Andrew Simmons,Giovanni Volpe,Eric Westman +9 more
TL;DR: It is shown that the earliest stages of cognitive decline in PD are associated with a disruption in the large‐scale coordination of the brain network and with a decrease of the efficiency of parallel information processing.
Journal ArticleDOI
An Efficient Memetic Algorithm for Influence Maximization in Social Networks
TL;DR: The proposed memetic algorithm optimizes the 2-hop influence spread to find the most influential nodes to extract a small set of nodes from a social network which influences the propagation maximally under a cascade model.
Journal ArticleDOI
News Frame Analysis: An Inductive Mixed-method Computational Approach
Dror Walter,Yotam Ophir +1 more
TL;DR: It is argued and demonstrated that frame elements could be identified using topic modeling, and thatframe elements can then be automatically grouped into frame “packages” using community detection techniques applied to the topic network.
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.