Edge Filtering

In a graph, edges represent a set of relevant interactions of crucial importance to obtain parsimonious descriptions of complex networks. Filtering valid edges can be highly challenging due to the lack of ground truth of the human brain connectome. To provide a reliable way of building candidate edges, we sampled the following 12 schemes on edge filtering and applied them to the connectivity matrices.

• Absolute Weight Thresholding (ABS)
• Proportional Thresholding (PROP)
• Degree Thresholding (DEG)
• Global Cost Efficiency Optimization (GCE)
• Overall Efficiency Cost Optimization (ECO)
• Minimum Spanning Tree (MST)
• Planar Maximally Filtered Graph (PMFG)
• Triangulated Maximally Filtered Graph (TMFG)
• Orthogonal Minimum Spanning Tree (OMST)
• Orthogonal TMF Graph (OTMFG)