K-cores
In the previous section, we saw that cliques often form the cores of networks and communities, but that they are computationally difficult to find. In larger networks, k-cores can be a practical alternative for finding dense regions. A k-core is created by removing all nodes of degree less than k from a network. The number k can be anything you choose. The larger k is, the more nodes will be stripped away.
The nodes that remain in a k-core are highly connected to their neighbors. However, different parts of the network might become disconnected from each other after low-degree nodes are removed. The result is that a k-core consists of islands of highly connected nodes. These islands form the core of the network (hence the name k-core). ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access