“…To obtain a single PSN for each MD ensemble, we included, in the final graph, only those edges which were present in at least 20% of the simulation frames ( p crit = 20%), as previously applied in other cases of study (Papaleo et al, 2012a,b, 2014a; Jónsdóttir et al, 2014; Tiberti et al, 2014; Lambrughi et al, 2016a,b). For each pair of nodes in the PSN graph, a variant of the depth-first search algorithm was employed to identify the shortest path of communication.…”