activity
20192025
most citedA Statistical Density-Based Analysis of Graph Clustering Algorithm Performance

4 citations · 15 across the 6 of their papers we have counts for

collaborators

7 papers

cs.DM2025

A statistical test for network similarity

Pierre Miasnikof, Alexander Y. Shetopaloff

In this article, we revisit and expand our prior work on graph similarity. As with our earlier work, we focus on a view of similarity which does not require node correspondence bet…

cs.NI2025

A clusterability test for directed graphs

Mario R. Guarracino, Pierre Miasnikof, Alexander Y. Shestopaloff +3

In this article, we extend a statistical test of graph clusterability, the test, to directed graphs with no self loops. The test, originally designed for undirected graphs,…

cs.LG2022★ 4 cited

Graph clustering with Boltzmann machines

Pierre Miasnikof, Mohammad Bagherbeik, Ali Sheikholeslami

Graph clustering is the process of grouping vertices into densely connected sets called clusters. We tailor two mathematical programming formulations from the literature, to this p…

cs.SI2020★ 4 cited

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.DM2020★ 1 cited

Graph Distances and Clustering

Pierre Miasnikof, Alexander Y. Shestopaloff, Leonidas Pitsoulis +1

With a view on graph clustering, we present a definition of vertex-to-vertex distance which is based on shared connectivity. We argue that vertices sharing more connections are clo…

cs.SI2020★ 2 cited

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…

cs.SI2019★ 4 cited

A Statistical Density-Based Analysis of Graph Clustering Algorithm Performance

Pierre Miasnikof, Alexander Y. Shestopaloff, Anthony J. Bonner +2

Measuring graph clustering quality remains an open problem. To address it, we introduce quality measures based on comparisons of intra- and inter-cluster densities, an accompanying…