Fig. 10From: Probabilistic network sparsification with ego betweennessNormal distributions: relative entropy (column one), mean relative error of expected degree (column two) and mean relative error of expected ego betweenness (column three) of sparsified Erdős–Rényi graphs with 500 nodes and density \(\rho = 0.5\). Edge probabilities are assigned according to Normal distributions (row 1) \(\mathcal {N}(\mu = 0.2, \sigma = 0.3)\), and (row 2) \(\mathcal {N}(\mu = 0.7, \sigma = 0.3)\)Back to article page