Find the durable center of a dense payments-risk graph without chasing every high-degree hub. k-core decomposition: peel away nodes below degree k to reveal nested resilient cores. The common shortcut is to inspect only the highest-degree node, which often finds generic infrastructure rather than coordinated risk. Start at scope Limit the graph to accounts, devices, cards, and addresses active in the last 14 days. Time scope matters. Old shared infrastructure can create dense but irrelevant residue. Peel weak ties Compute cores from k=1 upward. Nodes that cannot maintain k internal ties fall away at each level. The method asks whether…
Read the full lesson
Sign up free: one personalized lesson every day, matched to your role and goals.
Already have an account? Sign in