Topological filters

[jacomyal]

Here are some usecases:

• Only keep the main connected component
• Only keep components with at least N nodes
• Only keep nodes with a degree over N (without having to write a new metric)

[Yomguithereal]

People often use k-core also in this context :)

[jacomyal]

Could you be more specific?

[Yomguithereal]

k-core is like the recursive version of a degree filter where you will drop nodes until you can guarantee a stable point where there is no node with a degree less than the threshold. Sometimes people want this, sometimes they don't and they only want to degree filter once, even if this will create a new situation where the degree filter is now "invalid". They might want the simple degree filter because in some graph topologies, the k-core will remove a looooot of nodes, making the filtering moot.

[jacomyal]

Do we have a graphology implementation yet?

[Yomguithereal]

Nope, but this shall come.