Multi-Community Detection in Signed Graphs Using Quantum Hardware
Quantum Physics
2019-01-16 v1 Physics and Society
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.
Cite
@article{arxiv.1901.04873,
title = {Multi-Community Detection in Signed Graphs Using Quantum Hardware},
author = {Ehsan Zahedinejad and Daniel Crawford and Clemens Adolphs and Jaspreet S. Oberoi},
journal= {arXiv preprint arXiv:1901.04873},
year = {2019}
}