papers
Publications (2)
cs.SI2020
Market Graph Clustering Via QUBO and Digital Annealing
Seo Hong, Pierre Miasnikof, Roy Kwon +1
Our goal is to find representative nodes of a market graph that best replicate the returns of a broader market graph (index), a common task in the financial industry. We model our…
cs.SI2020
Graph Clustering Via QUBO and Digital Annealing
Pierre Miasnikof, Seo Hong, Yuri Lawryshyn
This article empirically examines the computational cost of solving a known hard problem, graph clustering, using novel purpose-built computer hardware. We express the graph cluste…