Community detection based on network communicability

DOI10.1063/1.3552144MaRDI QIDQ2821519zbMATH OpenOpenAlexWikidataFDO

Authors Ernesto Estrada

Publication date 21 September 2016

Published in Chaos (Search for Journal in Brave)

Full work available at URL https://strathprints.strath.ac.uk/29070/

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Social networks; opinion dynamics (91D30)

Recommendations

• Communicability graph and community structures in complex networks
• Detecting network communities: a new systematic and efficient algorithm
• A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks
• Finding community structure in networks using a shortest-path-based k-means algorithm
• Community structure in social and biological networks

Cites work

• A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks
• An Efficient Heuristic Procedure for Partitioning Graphs
• Cluster validation techniques for genome expression data
• Collective dynamics of `small-world' networks
• Communicability graph and community structures in complex networks
• Community structure in social and biological networks
• Emergence of Scaling in Random Networks
• Graph clustering
• Mathematical analysis of urban spatial networks
• Network properties revealed through matrix functions
• Network science. Complexity in nature and technology
• Networks. An introduction.
• Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
• On clusterings: good, bad and spectral
• Quadrature rule-based bounds for functions of adjacency matrices
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• Spectral partitioning with multiple eigenvectors
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks

Cited in

(16)

• Matrix functions in network analysis
• A DC Programming Approach for Finding Communities in Networks
• COMMUNITY DETECTION IN SOCIAL NETWORKS EMPLOYING COMPONENT INDEPENDENCY
• Generalized modularity matrices
• A dynamic evolutionary clustering perspective: community detection in signed networks by reconstructing neighbor sets
• Clustering networks' heterogeneous data in defining a comprehensive closeness centrality index
• Spectra of Laplacian matrices of weighted graphs: structural genericity properties
• Multi-attribute community detection in international trade network
• scientific article; zbMATH DE number 5533285 (Why is no real title available?)
• Schur reduction of trees and extremal entries of the Fiedler vector
• A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks
• Algorithms and Models for the Web-Graph
• Communicability graph and community structures in complex networks
• Motif-based communities in complex networks
• A spectral method to detect community structure based on the communicability modularity
• scientific article; zbMATH DE number 7234180 (Why is no real title available?)

This page was built for publication: Community detection based on network communicability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2821519)