Fig 5.

(a) The size of the maximum matching n _max increases monotonically with the average degree ⟨k⟩ in different networks. (b) The number of matched couples n increases monotonically with the average degree ⟨k⟩ in different networks. (c) The ratio between the number of matched couples and the size of the maximum matching (R = n/n _max) varies non-monotonically with the average degree ⟨k⟩. (d) Different behaviors of R in Erdős-Rényi networks where the correlation between degree and the attractiveness varies. Negative correlation between the degree and the attractiveness yields the largest R while positive correlation between the degree and the attractiveness results in the smallest R. Networks tested in all cases are with size 2N (N = 10,000).