• Corpus ID: 220250504

Non-backtracking Operator for Community Detection in Signed Networks

  title={Non-backtracking Operator for Community Detection in Signed Networks},
  author={Zhaoyue Zhong and Xiangrong Wang and Cunquan Qu and Guanghui Wang},
Community detection or clustering is crucial for understanding the structure of complex systems. In some networks, nodes are allowed to be linked by either 'positive' or 'negative' edges. Such networks are called signed networks. Discovering communities in signed networks is more challenging. In this article, we innovatively propose a non-backtracking matrix for signed networks, and theoretically derive a detectability threshold and prove the feasibility in community detection. Furthermore, we… 

Figures from this paper



Communities and Balance in Signed Networks: A Spectral Approach

This work develops a spectral approach augmented with iterative optimization that indicates that modularity based communities are distinct from structurally balanced communities.

Graph Comparison via the Non-backtracking Spectrum

This work defines a new pseudometric based on the spectrum of the nonbacktracking graph operator and shows that it cannot only be used to compare graphs generated through different mechanisms but can reliably compare graphs of varying size.

Spectral redemption in clustering sparse networks

A way of encoding sparse data using a “nonbacktracking” matrix, and it is shown that the corresponding spectral algorithm performs optimally for some popular generative models, including the stochastic block model.

Community structure in social and biological networks

  • M. GirvanM. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.


A non-backtracking walk on a graph, H, is a directed path of directed edges of H such that no edge is the inverse of its preceding edge. Non-backtracking walks of a given length can be counted using

Community detectability and structural balance dynamics in signed networks

The spectrum of the adjacency matrix generated by a stochastic block model with two equal-size communities shows detectability transitions in which the community structure becomes manifest when its signal eigenvalue appears outside the main spectral band and "sociality" transitions involving the homogeneous structure representing the average tie value.

Balance in signed networks

In a series of cross-validation tests, two measures of balance in signed networks based on the established notions of weak and strong balance are found to be able to predict signs substantially better than chance.

Community detection in graphs

Modularity Based Community Detection with Deep Learning

This work proposes a novel nonlinear reconstruction method by adopting deep neural networks for representation and extends the method to a semi-supervised community detection algorithm by incorporating pairwise constraints among graph nodes.

Spectral properties of networks with community structure.

It is shown that in many cases, the spectrum of eigenvalues of the adjacency matrix of a network with community structure gives a clear indication of the number of communities in the network.