Finding community structure in very large networks.
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
Proceedings ArticleDOI
OASNET: an optimal allocation approach to influence maximization in modular social networks
TL;DR: It is proved that finding an optimal allocation in a modular social network is NP-hard and a new optimal dynamic programming algorithm is proposed to solve the problem, which is named OASNET (Optimal Allocation in a Social NETwork).
Book ChapterDOI
Single-Cell RNA Sequencing Analysis: A Step-by-Step Overview
Shaked Slovin,Annamaria Carissimo,Francesco Panariello,Antonio M. Grimaldi,Valentina Bouché,Gennaro Gambardella,Gennaro Gambardella,Davide Cacchiarelli,Davide Cacchiarelli +8 more
TL;DR: In this paper, the authors provide an overview of the currently available single-cell technologies for cell isolation and library preparation and a step by step guide that covers the entire canonical analytic workflow to analyse scRNA-seq data including read mapping, quality controls, gene expression quantification, normalization, feature selection, dimensionality reduction, and cell clustering useful for trajectory inference and differential expression.
Journal ArticleDOI
Water Distribution System Clustering and Partitioning Based on Social Network Algorithms
Armando Di Nardo,Michele Di Natale,Carlo Giudicianni,Dino Musmarra,Giovanni Francesco Santonastaso,Antonietta De Simone +5 more
TL;DR: Different clustering procedures based on social network community detection and on graph partitioning algorithms were compared using a real water system and a large battery of performance indices.
Proceedings ArticleDOI
Software systems through complex networks science: review, analysis and applications
Lovro Šubelj,Marko Bajec +1 more
TL;DR: The study reveals that network theory can provide a prominent set of techniques for the exploratory analysis of large complex software system, and proposes different network-based quality indicators that address software design, efficiency, reusability, vulnerability, controllability and other.
Journal ArticleDOI
Role Discovery in Networks
Ryan A. Rossi,Nesreen K. Ahmed +1 more
TL;DR: In this article, a taxonomy of three general classes of techniques for discovering roles is proposed, including graph-based, feature-based and hybrid roles, and a flexible framework for discovering role using the notion of similarity on a feature based representation.
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.