A Computationally Efficient, Exploratory Approach to Brain Connectivity Incorporating False Discovery Rate Control, A Priori Knowledge, and Group Inference
Figure 1
Simulation results for the algorithm. (a) Simulation results for the network with 10 nodes and 23 edges. (b) Simulation results for the network with 20 nodes and 56 edges. In the networks, solid arrows represent edges from time to , and dashed arrows represent edges with no time lag (i.e., from time to ). For the FDR and detection power curves, the blue solid lines represent the PCfdr algorithm, the red solid lines represent the algorithm, the -axis means the sample sizes, and the -axis means the FDR or detection power.
