Two connections joining two nodes, a and b, are redundant when the only shared nodes are a and b.
Requirement: SageMath
To calculate the number of redundant connections between nodes a and b in a network G with N nodes, first use G.vertex_disjoint_paths(a,b) to list redundant connections.
To calculate the number of redundant connections, use len(G.vertex_disjoint_paths(a,b)).
To calculate the minimum number of redundant connections between every pair of nodes in G, use G.vertex_connectivity().
Maryam Ghanbari, Guoshi Li, Li-Ming Hsu, and Pew-Thian Yap, "Accumulation of Network Redundancy Marks the Early Stage of Alzheimer’s Disease," Human Brain Mapping, 2023.