Overlapping Community Detection Through Threshold Analysis on Disjoint Network Structures

Distributed approach in a network is a prime attribute to achieve quality throughput. Many real-life infrastructures share such distributed network structures. Recently, researchers are focusing on different prime attributes of these distributed networks and meaningfully analyzing them to retrieve essential information toward throughput enhancement. These structures exhibit different constructs. Some of those are static and some are dynamic. They also contain strategic groups within it. Appropriately, identifying these groups is the key essence of community detection. Present work applies a novel mechanism for graphical analysis of network structures to detect overlapping communities. Experimental findings and comparative analysis with existing methods show efficacy of the present algorithm.