Motif-based communities in complex networks

Abstract

Community definitions usually focus on edges, inside and between the communities. However, the high density of edges within a community determines correlations between nodes going beyond nearest-neighbours, and which are indicated by the presence of motifs. We show how motifs can be used to define general classes of nodes, including communities, by extending the mathematical expression of Newman-Girvan modularity. We construct then a general framework and apply it to some synthetic and real networks.

References in corpus (14)

• Community structure in social and biological networks
• Finding and evaluating community structure in networks
• Modularity and community structure in networks
• Finding community structure in very large networks
• Fast algorithm for detecting community structure in networks
• Finding community structure in networks using the eigenvectors of matrices
• Cooperative Game Theory Approaches for Network Partitioning
• Functional cartography of complex metabolic networks
• Resolution limit in community detection
• Analysis of weighted networks
• Community detection in complex networks using Extremal Optimization
• Modularity and community detection in bipartite networks
• Module identification in bipartite and directed networks
• Size reduction of complex networks preserving modularity

Cited by in corpus (27)

• Community detection in graphs
• Synchronization in complex networks
• Community detection in networks: A user guide
• Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
• Community structure and scale-free collections of Erdös-Rényi graphs
• EdMot: An Edge Enhancement Approach for Motif-aware Community Detection
• MODEL: Motif-based Deep Feature Learning for Link Prediction
• A Parameterized Centrality Metric for Network Analysis
• Communities in Networks
• Efficient modeling of higher-order dependencies in networks: from algorithm to application for anomaly detection
• Detecting communities of triangles in complex networks using spectral optimization
• Homological percolation transitions in growing simplicial complexes
• Triangular clustering in document networks
• Versatility of nodal affiliation to communities
• Structure of Heterogeneous Networks
• Social nucleation: Group formation as a phase transition
• Higher-order Spectral Clustering for Heterogeneous Graphs
• Walk modularity and community structure in networks
• HONEM: Learning Embedding for Higher Order Networks
• Approximate Triangle Counting
• Understanding Complex Systems: From Networks to Optimal Higher-Order Models
• Degree correlations in graphs with clique clustering
• Emergence of Long-Range Correlations in Random Networks
• The Atlas for the Aspiring Network Scientist
• Metrics for Community Analysis: A Survey
• Semi-Supervised Classification Through the Bag-of-Paths Group Betweenness
• Block-corrected Modularity for Community Detection