[Gravityloss]

Indeed. Say you have a graph where nodes have different amounts of connections. You pick a random node, and from there, go on a random walk, always picking a random edge to another random "friend" node. After some amount of jumps, it's more likely that you've ended up on a node which has a higher than average amount of connections.