The participation of a node in more than one community is a common phenomenon in complex networks. However most existing methods, fail to identify nodes with multiple community affiliation, correctly. In this paper, a unique method to define overlapping community in complex networks is proposed,...

In this paper, we present a new approach to extract communities in the complex networks with considerable accuracy. We introduce the core-vertex and the intimate degree between the community and its neighboring vertices. First, we find the core-vertices as the initial community. These...

Although many successful algorithms have been designed to discover community structures in network, most of them are dedicated to disjoint and non-overlapping communities. Very few of them are intended to discover overlapping communities, particularly the detection of such communities have...

Cooperation in prisoner’s dilemma game can be promoted significantly by introducing memory effects. In this work, we assume that the changing probability of strategy is determined by the agents’ accumulative payoff in all time steps. We have numerically investigated robustness of cooperation...

In this paper, we propose a pinning synchronization control scheme in complex networks with non-delay and delay couplings, which uses two switched periods to provide intermittent control. Criteria ensuring global exponential synchronization are obtained based on strict mathematical proofs....

Detection of community structures in the weighted complex networks is significant to understand the network structures and analysis of the network properties. We present a unique algorithm to detect overlapping communities in the weighted complex networks with considerable accuracy. For a given...

In this paper, we present an alternate algorithm for detecting overlapping community structures in the complex network. Two concepts named the maximal sub-graph and the clustering coefficient between two neighboring communities are introduced. First, all the maximal sub-graphs are extracted from...

Community structure is a common phenomenon in complex networks, and it has been shown that some communities in complex networks often overlap each other. So in this paper we propose a new algorithm to detect overlapping community structure in complex networks. To identify the overlapping...

In this paper, a unique algorithm is proposed to detect overlapping communities in the un-weighted and weighted networks with considerable accuracy. The maximal cliques, overlapping vertex, bridge vertex and isolated vertex are introduced. First, all the maximal cliques are extracted by the...

This paper presents a four-dimension hyperchaotic Lorenz system, obtained by adding a nonlinear controller to Lorenz chaotic system. The hyperchaotic Lorenz system is studied by bifurcation diagram, Lyapunov exponents spectrum and phase diagram. Numerical simulations show that the new system’s...