Download Graph theory for TLE lateralization: Supporting Information

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project

Document related concepts

Distributed operating system wikipedia , lookup

Recursive InterNetwork Architecture (RINA) wikipedia , lookup

CAN bus wikipedia , lookup

Airborne Networking wikipedia , lookup

IEEE 802.1aq wikipedia , lookup

Kademlia wikipedia , lookup

Routing in delay-tolerant networking wikipedia , lookup

Dijkstra's algorithm wikipedia , lookup

Transcript
Graph theory for TLE lateralization: Supporting Information 2
3. Small-World Index (σ)
Small-world index (σ) is a measure of the network’s balance between network
segregation and integration (4), and was calculated as the ratio of clustering coefficient to
path length:


.

[3]
Small-world networks typically have γ>1, λ≈1, σ>1 (1). Because noise reduction and
better class separation can potentially be achieved through the inclusion of redundant
variables (5), small-world index was included along with clustering coefficient and path
length as a feature input.
4. Local efficiency (LE) and Global Efficiency (GE)
The local efficiency (LE) of node i was calculated as the mean of the inverse shortest path
length from node i to all other nodes:
LEi 
1
N

jG: j i
1
di, j
,
[4]
where di,j denotes the shortest path length between nodes i and j and N denotes the
number of nodes in the graph. Global efficiency (GE), which measures the average level
of efficiency in interregional communication, was calculated as the average local
efficiency over all nodes:
GE 
1
N
 LE
iG
i
.
[5]
4. Connectivity Strength (CS)
Connectivity strength provides a measure of the network’s average level of connectivity,
and was calculated as the mean of all pairwise correlations (6):