2018
DOI: 10.1016/j.chaos.2017.12.007
|View full text |Cite
|
Sign up to set email alerts
|

Directed clustering in weighted networks: A new perspective

Abstract: In this paper, we consider the problem of assessing local clustering in complex networks. Various definitions for this measure have been proposed for the cases of networks having weighted edges, 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 existing in the literature for the weighted and undirected case. Furthermore, we extract from our coefficient four specific components, in order to separa… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
54
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 85 publications
(56 citation statements)
references
References 39 publications
(113 reference statements)
2
54
0
Order By: Relevance
“…where c in = [c in i ] i∈V and c out = [c out i ] i∈V are vectors with entries c in i and c out i , respectively, that represent the in and out weighted local clustering coefficients of node i, while c all is the vector of local clustering coefficient for graph D (see [11]).…”
Section: The High Order Clustering Coefficientmentioning
confidence: 99%
See 2 more Smart Citations
“…where c in = [c in i ] i∈V and c out = [c out i ] i∈V are vectors with entries c in i and c out i , respectively, that represent the in and out weighted local clustering coefficients of node i, while c all is the vector of local clustering coefficient for graph D (see [11]).…”
Section: The High Order Clustering Coefficientmentioning
confidence: 99%
“…Since the graph is directed, we can refer to different kind of geodesics (depending on whether the direction of the arcs is considered or not). We first compute the vector c all of coefficients as provided in [11]. We remind that each coefficient c all i includes all kind of triangles which a node belongs to.…”
Section: Simulated Examplementioning
confidence: 99%
See 1 more Smart Citation
“…For instance, money transfers between clients and sellers are best modeled by weighted bipartite directed stream graphs. The concepts we discussed then have to be extended even further, like what has already been done for graphs for instance with the directed strength s + (v) = u∈N + (v) ω(u, v) [39], the directed weighted clustering coefficient [14,19], or for the study of weighted bipartite graphs [22].…”
Section: Resultsmentioning
confidence: 99%
“…It is worth noting the alternatives presented inOnnela et al (2005) as well as the extended versions of the clustering coefficient inFagiolo (2007);Clemente and Grassi (2018).…”
mentioning
confidence: 99%