  In this paper, through thinking on the modularity function that measures the
standard of community division, a new algorithm for dividing communities is
proposed, called the Connect Intensity Iteration algorithm, or CIIA for short.
In this algorithm, a new indicator is proposed.This indicator is the difference
between the actual number of edges between two nodes and the number of edges
when the edges are randomly placed. It can reflect more information between the
nodes. The larger the value of this index, the greater the possibility that the
two nodes are divided into the same community, and vice versa. This paper also
verifies the algorithm through numerical simulations and real cases, and the
results show the feasibility of the algorithm.
