Community detection in signed networks has been studied widely in recent years. In this paper, a discrete difference equation is proposed to imitate the consistently changing phases of the nodes. During the interaction, each node will update its phase based on the difference equation. Each node has many different nodes connected with it, and these neighbors have different influences on it. The similarity between two nodes is applied to describe the influences between them. Nodes with high positive similarities will get together and nodes with negative similarities will be far away from each other.Communities are detected ultimately when the phases of the nodes are stable. Experiments on real world and synthetic signed networks show the efficiency of detection performance. Moreover, the presented method gains better detection performance than two existing good algorithms.
The eigenvalue problem of a class of fourth-order Hamiltonian operators is studied. We first obtain the geometric multiplicity, the algebraic index and the algebraic multiplicity of each eigenvalue of the Hamiltonian operators. Then, some necessary and sufficient conditions for the completeness of the eigen or root vector system of the Hamiltonian operators are given, which is characterized by that of the vector system consisting of the first components of all eigenvectors. Moreover, the results are applied to the plate bending problem.
