Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Community-detection is a porful approach to uncover important structures in large networks. Since networks often describe flow of some entity, flow-based community-detection methods are particularly interesting. One such algorithm is called Info map, which optimizes the objective function known as the map equation. While Info map is known to be an effective algorithm, its serial implementation cannot take advantage of multicore processing in modern computers. ,  propose a novel parallel generalization of Info map called Relax Map. This algorithm relaxes concurrency assumptions to avoid lock overhead, achieving 70% parallel efficiency in shared-memory multicore experiments while exhibiting similar convergence properties and finding similar community structures as the serial algorithm.  evaluate our approach on a variety of real graph datasets as ll as synthetic graphs produced by a popular graph generator used for benchmarking community detection algorithms.  describe the algorithm, the experiments, and some emerging research directions in high-performance community detection on massive graphs.
['Seung-Hee Bae', 'Daniel Halperin', 'Jevin D. West', 'Martin Rosvall', 'Bill Howe']
I am writing a research paper on a idea Scalable Flow-Based Community Detection for Large-Scale Network Analysis
[{"from": "human", "value": "I am writing a research paper on a idea Scalable Flow-Based Community Detection for Large-Scale Network Analysis"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Community-detection is a porful approach to uncover important structures in large networks. Since networks often describe flow of some entity, flow-based community-detection methods are particularly interesting. One such algorithm is called Info map, which optimizes the objective function known as the map equation. While Info map is known to be an effective algorithm, its serial implementation cannot take advantage of multicore processing in modern computers. ,  propose a novel parallel generalization of Info map called Relax Map. This algorithm relaxes concurrency assumptions to avoid lock overhead, achieving 70% parallel efficiency in shared-memory multicore experiments while exhibiting similar convergence properties and finding similar community structures as the serial algorithm.  evaluate our approach on a variety of real graph datasets as ll as synthetic graphs produced by a popular graph generator used for benchmarking community detection algorithms.  describe the algorithm, the experiments, and some emerging research directions in high-performance community detection on massive graphs."}]