To compute the clustering coefficient C and the characteristic path length L from the PLI of the ECoG data, we used the methods described by [25]. The first step in applying graph theoretical analysis to synchronization matrices is to convert the N×N PLI matrix into a binary graph, with N as the number of channels used. A binary graph is a network that consists of vertices and edges (undirected connections between elements). The PLI matrix can be converted to an unweighted graph by considering a threshold T. If the PLI between a pair of channels i and j exceeds T, an edge is said to exist between i and j; otherwise no edge exists between i and j.
