Skip to main content
Figure 2 | EPJ Data Science

Figure 2

From: The geometry of suspicious money laundering activities in financial networks

Figure 2

Explicit examples of the reduction procedure (Step 1). (a) Replacement of the 2-degree node e and its edges by a simple (red) edge. (b) After elimination of node e, the resulting multiedge is replaced by a simple (red) edge. (c) After the elimination of the 2-degree node j, a (red) self-loop appears that is also discarded. (d) After the reduction, the two paths joining i and j become a simple (red) edge. (e) After the detection of a true clique in the reduced network (called reduced clique), the complete cycles connecting their member nodes are determined in Step 3, restoring all the original members of the group. The right-hand side shows what is called an “embedded clique” in the unreduced network. It is not a true clique but a group of intersecting cycles, and hence a candidate focus of suspicious activities

Back to article page