2005
DOI: 10.1103/physreve.71.065103
|View full text |Cite
|
Sign up to set email alerts
|

Intensity and coherence of motifs in weighted complex networks

Abstract: The local structure of unweighted networks can be characterized by the number of times a subgraph appears in the network. The clustering coefficient, reflecting the local configuration of triangles, can be seen as a special case of this approach. In this paper we generalize this method for weighted networks. We introduce subgraph "intensity" as the geometric mean of its link weights "coherence" as the ratio of the geometric to the corresponding arithmetic mean. Using these measures, motif scores and clustering… 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

5
735
0
9

Year Published

2006
2006
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 922 publications
(771 citation statements)
references
References 27 publications
5
735
0
9
Order By: Relevance
“…These fractions at each node are then averaged over the network to give the overall network CC. Each node's CC can also be weighted by the product of the relevant edge weights to obtain a weighted version of this measure [57,39]. This weighted CC is what is calculated in our study.…”
Section: Network Analysismentioning
confidence: 99%
“…These fractions at each node are then averaged over the network to give the overall network CC. Each node's CC can also be weighted by the product of the relevant edge weights to obtain a weighted version of this measure [57,39]. This weighted CC is what is calculated in our study.…”
Section: Network Analysismentioning
confidence: 99%
“…To evaluate network topologies for these regions, we chose the graph theoretical measure of node strength. Strength reflects how functionally connected a given region is to other regions in the analyzed network 54, 55…”
Section: Methodsmentioning
confidence: 99%
“…Weighted functional networks were analyzed and compared based on five different measures of network connectivity, namely the modularity M (Newman, 2006;Rubinov & Sporns, 2010), clustering coefficient C (Onnela et al, 2005;Rubinov & Sporns, 2010), characteristic path length L (Rubinov & Sporns, 2010), edge density D and the mean edge-weight W . We have chosen these measures, because they signify seizure characteristics that have previously been reported in the literature (Kramer et al, 2008;Schindler et al, 2008;Kramer et al, 2010).…”
Section: Analysis and Comparison Of Functional Networkmentioning
confidence: 99%