Search

One of the most important problems in complex networks is the location of nodes that are essential or play a main role in the network. Nodes with main local roles are the centers of real communities. Communities are sets of nodes of complex networks and are densely connected internally. Choosing the right nodes as seeds of the communities is crucial in determining real communities. We propose a new centrality measure named density-based entropy centrality for the local identification of the most important nodes. It measures the entropy of the sum of the sizes of the maximal cliques to which each node and its neighbor nodes belong. The proposed centrality is a local measure for explaining the local influence of each node, which provides an efficient way to locally identify the most important nodes and for community detection because communities are local structures. It can be computed independently for individual vertices, for large networks, and for not well-specified networks. The use of the proposed density-based entropy centrality for community seed selection and community detection outperforms other centrality measures. [ABSTRACT FROM AUTHOR]

The paper reviews community detection methods used besides other partition algorithms for power grid partitioning. The power grid is a complex network. A complex network forms a community structure. There are many edges between community nodes and relatively few of those connecting the vertices of different communities. Community detection is an optimization problem. Its goal is to detect communities that belong to a network or graph in which nodes of a particular community in the same community share properties of the same characteristics or functional relationships. Power grids use adaptable community detection algorithms of various suitability rates used in power grid partitioning. The paper presents types and adaptations of various community detection algorithms used in power grid partitioning. [ABSTRACT FROM AUTHOR]

Automatic network clustering is an important method for mining the meaningful communities of complex networks. Uncovered communities help to understand the potential system structure and functionality. Many algorithms that use multiple optimization criteria and optimize a population of solutions are difficult to apply to real systems because they suffer a long optimization process. In this paper, in order to accelerate the optimization process and to uncover multiple significant community structures more effectively, a multi-objective evolutionary algorithm is proposed and evaluated using problem-specific genetic mutation and group crossover, and problem-specific initialization. Since crossover operators mainly contribute to performance of genetic algorithms, more problem-specific group crossover operators are introduced and evaluated for intelligent evolution of population. The experiments on both artificial and real-world networks demonstrate that the proposed evolutionary algorithm with problem-specific genetic operations has effective performance on discovering the community structure of networks. [ABSTRACT FROM AUTHOR]

Community detection in large networks has been a focus of recent research in many of fields, including biology, physics, social sciences, and computer science. Most community detection methods partition the entire network into communities, groups of nodes that have many connections within communities and few connections between them and do not identify different roles that nodes can have in communities. We propose a community detection model that integrates more different measures that can fast identify communities of different sizes and densities. We use node degree centrality, strong similarity with one node from community, maximal similarity of node to community, compactness of communities and separation between communities. Each measure has its own strength and weakness. Thus, combining different measures can benefit from the strengths of each one and eliminate encountered problems of using an individual measure. We present a fast local expansion algorithm for uncovering communities of different sizes and densities and reveals rich information on input networks. Experimental results show that the proposed algorithm is better or as effective as the other community detection algorithms for both real-world and synthetic networks while it requires less time. [ABSTRACT FROM AUTHOR]