Implementation of the DEMON Algorithm

The ego network in which the ego node has been removed, together with all its attached edges.

// Function to extract ego network minus ego node function egoMinusEgo(node, graph) { const egoNetwork = graph.neighbors(node); egoNetwork.delete(node); // Remove ego node return egoNetwork; }

// Function to apply Label Propagation algorithm for community detection function labelPropagation(graph) { // Implementation of Label Propagation algorithm // This function returns a mapping of nodes to their community labels // You can replace this with your own implementation of Label Propagation // Placeholder implementation const communityLabels = new Map(); graph.nodes.forEach(node => { communityLabels.set(node, Math.floor(Math.random() * 10)); // Assign random community label }); return communityLabels; }

// Function to discover communities using DEMON algorithm function DEMON(graph) { const communities = new Set(); // External loop: cycle over each individual node graph.nodes.forEach(node => { // Step 1: Compute ego network minus ego node const egoNetwork = egoMinusEgo(node, graph); // Step 2: Compute communities in ego network using Label Propagation const communityLabels = labelPropagation(egoNetwork); // Add discovered communities to the set communityLabels.forEach(label => communities.add(label)); }); return communities; }

// Example usage: // Assuming you have a graph object called 'graph' with nodes and edges const discoveredCommunities = DEMON(graph); console.log("Discovered Communities:", discoveredCommunities);

~