Their description seems like a fairly good take. The main idea is that in graph you are more likely to be connected to an outlier when it comes to connexions by

Their description seems like a fairly good take. The main idea is that in graph you are more likely to be connected to an outlier when it comes to connexions by virtue of them being more connected and these outliers skew the average. Of course you might yourself be the outlier. If you think about it, this is not far from saying that: if you know a distribution is non homogenous with a limited number of elements skewed - like say a normal distribution - and pick an element at random, it is more likely to be average than exceptional which is pretty trivial when you think about it.