A common practice to control the number of edges is to connect each node to at most k other nodes (k-nearest neigh-bor).
finding the top-k nearest nodes to each node requires considering its similarity to all the other nodes which requires O(n 2 ) computations and since n is usually very large, doing such is practically intractable.