Clustering networks' heterogeneous data in defining a comprehensive closeness centrality index

DOI10.1155/2014/202350zbMath1407.91197OpenAlexW2078296583WikidataQ59063737 ScholiaQ59063737MaRDI QIDQ1717854

B. Hoda Ali-Ahmadi, S. Golamreza Jalali Naini, Somayeh Alizadeh, Farnaz Barzinpour

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/202350

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items (2)

Comparison of communities detection algorithms for multiplex ⋮ Multidimensional dynamic programming algorithm for \(N\)-level batching with hierarchical clustering structure

Uses Software

• SA-cluster
• GenLouvain

Cites Work

• Synchronization analysis for complex networks with coupling delay based on TâS fuzzy theory
• Measuring the flow of information among cities using the diffusion power
• Centrality and power in social networks: A game theoretic approach.
• Random walk centrality in interconnected multilayer networks
• Community detection based on network communicability
• Navigability of interconnected networks under random failures
• Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
• Eigenvector centrality of nodes in multiplex networks
• On clustering validation techniques

This page was built for publication: Clustering networks' heterogeneous data in defining a comprehensive closeness centrality index