Multi-Community Detection in Signed Graphs Using Quantum Hardware
arXiv:1901.04873
Abstract
Signed graphs serve as a primary tool for modelling social networks. They can represent relationships between individuals (i.e., nodes) with the use of signed edges. Finding communities in a signed graph is of great importance in many areas, for example, targeted advertisement. We propose an algorithm to detect multiple communities in a signed graph. Our method reduces the multi-community detection problem to a quadratic binary unconstrained optimization problem and uses state-of-the-art quantum or classical optimizers to find an optimal assignment of each individual to a specific community.
References in corpus (9)
- Finding and evaluating community structure in networks
- Modularity and community structure in networks
- Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
- Detecting criminal organizations in mobile phone networks
- Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension
- Network Community Detection On Small Quantum Computers
- Mesoscopic analysis of online social networks - The role of negative ties
- From local to global ground states in Ising spin glasses
- borealis - A generalized global update algorithm for Boolean optimization problems