Triangles
In graph theory, finding vertices that are well-connected to each other is important for the purpose of analysis. One technique is to try to identify triangles, which are a subgraph that consists of three nodes directly connected to each other, in the network.
Let's look at the use case of fraud detection, which we have also used as a case study towards the end of this chapter. If an egonet of a node, m, consists of three vertices, including vertex m, then this egonet is a triangle. Vertex m will be the ego and the two connected vertices will be alters, say vertex A and vertex B. If both alters are known fraudulent cases, we can safely declare vertex m as fraudulent as well. If one of the alters is involved in fraud, we cannot ...
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