Directed clustering in weighted networks: A new perspective.

Saved in:
Bibliographic Details
Title: Directed clustering in weighted networks: A new perspective.
Authors: Clemente, G.P.1 gianpaolo.clemente@unicatt.it, Grassi, R.2 rosanna.grassi@unimib.it
Source: Chaos, Solitons & Fractals. Feb2018, Vol. 107, p26-38. 13p.
Subjects: Coefficients (Statistics), Cluster analysis (Statistics), Directed graphs, Weighted graphs, Weighted residual method
Abstract: Several definitions of clustering coefficient for weighted networks have been proposed in literature, but less attention has been paid to both weighted and directed networks. We provide a new local clustering coefficient for this kind of networks, starting from those already existing in the literature for the weighted and undirected case. Furthermore, we extract from our coefficient four specific components, in order to separately consider different link patterns of triangles. Empirical applications on several real networks from different frameworks and with different order are provided. The performance of our coefficient is also compared with that of existing coefficients. [ABSTRACT FROM AUTHOR]
Copyright of Chaos, Solitons & Fractals is the property of Pergamon Press - An Imprint of Elsevier Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Several definitions of clustering coefficient for weighted networks have been proposed in literature, but less attention has been paid to both weighted and directed networks. We provide a new local clustering coefficient for this kind of networks, starting from those already existing in the literature for the weighted and undirected case. Furthermore, we extract from our coefficient four specific components, in order to separately consider different link patterns of triangles. Empirical applications on several real networks from different frameworks and with different order are provided. The performance of our coefficient is also compared with that of existing coefficients. [ABSTRACT FROM AUTHOR]
ISSN:09600779
DOI:10.1016/j.chaos.2017.12.007