Communicability graph and community structures in complex networks

DOI10.1016/j.amc.2009.04.024zbMath1284.05253arXiv1412.7388OpenAlexW2024529797MaRDI QIDQ833142

Naomichi Hatano, Ernesto Estrada

Publication date: 12 August 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.7388

zbMATH Keywords

complex networksgraph spectrumcommunicabilitynetwork communitiesall-cliques problem

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (22)

Updating and Downdating Techniques for Optimizing Network Communicability ⋮ A spectral method to detect community structure based on the communicability modularity ⋮ Minimising Entropy Changes in Dynamic Network Evolution ⋮ Predicting Triadic Closure in Networks Using Communicability Distance Functions ⋮ A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks ⋮ Redundancy as a graph-based index of frequency specific MEG functional connectivity ⋮ Matrix functions in network analysis ⋮ Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds ⋮ A UNIFIED COMMUNITY DETECTION ALGORITHM IN LARGE-SCALE COMPLEX NETWORKS ⋮ Localization in Matrix Computations: Theory and Applications ⋮ Risk-Dependent Centrality in Economic and Financial Networks ⋮ Modeling systemic risk with Markov switching graphical SUR models ⋮ A divide-and-link algorithm for hierarchical clustering in networks ⋮ Eigenvector-Based Centrality Measures for Temporal Networks ⋮ Quadrature rule-based bounds for functions of adjacency matrices ⋮ Edge Modification Criteria for Enhancing the Communicability of Digraphs ⋮ Community detection based on network communicability ⋮ Estimating the Largest Elements of a Matrix ⋮ Communicability Angle and the Spatial Efficiency of Networks ⋮ Computing exponentials of essentially non-negative matrices entrywise to high relative accuracy ⋮ Dissecting graph measure performance for node clustering in LFR parameter space ⋮ Where to cut to delay a pandemic with minimum disruption? mathematical analysis based on the SIS model

Uses Software

• Pajek
• Pajek datasets
• Algorithm 457

Cites Work

• Unnamed Item
• Unnamed Item
• The worst-case time complexity for generating all maximal cliques and computational experiments
• The maximum clique problem
• Parallel concepts in graph theory
• Enumerating all connected maximal common subgraphs in two graphs
• A survey of kernel and spectral methods for clustering
• Communities in Networks
• An Efficient Heuristic Procedure for Partitioning Graphs
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• Algorithm 457: finding all cliques of an undirected graph
• Data Clustering: Theory, Algorithms, and Applications

This page was built for publication: Communicability graph and community structures in complex networks