Pierre Miasnikof

Orcid: 0000-0001-9261-8147

According to our database1, Pierre Miasnikof authored at least 14 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Graph clustering with Boltzmann machines.
Discret. Appl. Math., January, 2024

2023
Statistical power, accuracy, reproducibility and robustness of a graph clusterability test.
Int. J. Data Sci. Anal., May, 2023

Empirical Study of Graph Spectra and Their Limitations.
Proceedings of the Complex Networks & Their Applications XII, 2023

2022
Statistical network isomorphism.
CoRR, 2022

Statistical Network Similarity.
Proceedings of the Complex Networks and Their Applications XI, 2022

2021
An empirical comparison of connectivity-based distances on a graph and their computational scalability.
J. Complex Networks, 2021

2020
Market Graph Clustering Via QUBO and Digital Annealing.
CoRR, 2020

Graph Distances and Clustering.
CoRR, 2020

Graph Clustering Via QUBO and Digital Annealing.
CoRR, 2020

A density-based statistical analysis of graph clustering algorithm performance.
J. Complex Networks, 2020

Distances on a Graph.
Proceedings of the Complex Networks & Their Applications IX, 2020

2019
A Statistical Density-Based Analysis of Graph Clustering Algorithm Performance.
CoRR, 2019

A Statistical Test of Heterogeneous Subgraph Densities to Assess Clusterability.
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

2018
A Statistical Performance Analysis of Graph Clustering Algorithms.
Proceedings of the Algorithms and Models for the Web Graph - 15th International Workshop, 2018


  Loading...