Hard problems | Marco Grassia

Hard problems

Geometric Deep Learning graph pruning to speed-up the run-time of Maximum Clique Enumerarion algorithms

In this paper we propose a method to reduce the running time to solve the Maximum Clique Enumeration (MCE) problem. Specifically, given a network we employ geometric deep learning in order to find a simpler network on which running the algorithm to …

Machine learning dismantling and early-warning signals of disintegration in complex systems

From physics to engineering, biology and social science, natural and artificial systems are characterized by interconnected topologies whose features – e.g., heterogeneous connectivity, mesoscale organization, hierarchy – affect their robustness to …