Graph-based multi-threading group detection

A method comprising:

• accessing, by one or more hardware processors, a graph comprising a plurality of nodes and a plurality of edges connecting the plurality of nodes, wherein each node in the plurality of nodes represents a user account with a service provider;
• and
• instantiating, by the one or more hardware processors, a corresponding thread for each node in the plurality of nodes to perform tasks related to a group detection process, wherein a first corresponding thread corresponding to a first node in the plurality of nodes comprises executable instructions configured to:
• determine a first set of nodes having one degree of separation from the first node;
• determine, for the first node, a first neighbor count representing a first number of nodes within the first set of nodes;
• identify, from the first set of nodes, a first subset of nodes and a second subset of nodes, wherein each node in the first subset of nodes has less neighbor nodes than the first node, and wherein each node in the second subset of nodes has more neighbor nodes than the first node;
• and
• perform a neighbor node comparison between the first node and each of the first subset of nodes, but not the second subset of nodes.

A non-transitory machine-readable medium having stored thereon machine-readable instructions executable to cause a machine to perform operations comprising:

• accessing a graph comprising a plurality of nodes and a plurality of edges connecting the plurality of nodes, wherein each node in the plurality of nodes represents a user account with a service provider;
• instantiating a plurality of threads for performing tasks related to a group detection process based on the plurality of nodes, wherein each thread in the plurality of threads corresponds to a distinct node in the plurality of nodes, and wherein each thread in the plurality of threads includes stored executable instructions configured to perform the tasks based on a corresponding node in the plurality of nodes;
• determining, by a first thread from the plurality of threads that corresponds to a first node in the plurality of nodes, a first neighbor count representing a number of neighbor nodes having one degree of separation from the first node within the graph;
• obtaining, by the first thread, a plurality of neighbor counts from a set of threads corresponding to the neighbor nodes of the first node;
• determining, by the first thread for the first node, a first subset of the neighbor nodes having first neighbor counts more than the first neighbor count and a second subset of the neighbor nodes having second neighbor counts less than the first neighbor count;
• generating, by the first thread, a first list comprising a first identity of the first node and identities of the neighbor nodes of the first node;
• and
• transmitting, by the first thread, the first list to a first subset of the set of threads corresponding to the first subset of the neighbor nodes, but not a second subset of the set of threads corresponding to the second subset of the neighbor nodes.