Directed clustering in weighted networks: A new perspective

G.P. Clemente and R. Grassi

Chaos, Solitons & Fractals, 2018, vol. 107, issue C, 26-38

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.

Keywords: Complex networks; Clustering coefficient; Weighted networks; Directed graphs (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (45)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S096007791730509X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:107:y:2018:i:c:p:26-38

DOI: 10.1016/j.chaos.2017.12.007

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().