I am a Research Fellow at the Department of Electrical Electronics and Computer Engineering (DIEEI) of the University of Catania (Italy), where I obtained a Ph.D. in Computer Engineering with a thesis on approaching NP-hard problems on graphs using Geometric Deep Learning.
I work in the NetworkScience Laboratory and my research interests include Network Science and its real-world applications, and also the application of Machine Learning techniques — specifically Geometric Deep Learning — to learn high impact problems, or to solve or reduce the search space of computationally hard ones.
In my free-time I enjoy working on personal projects, practicing sport, playing videogames and photography.
Ph.D. in Computer Engineering with a thesis on Network Science and Machine Learning, 2022
University of Catania
M.Sc. in Computer Engineering, 2018
University of Catania
B.Sc. in Computer Engineering, 2016
University of Catania
Remote internship at the Center for Complex Network Intelligence (CCNI), Tsinghua Laboratory of Brain and Intelligence (THBI).
Research on network dismantling approaches that leverage the geometry of the network.
In the context of a global food system, the dynamics associated to international food trade have become key determinants of food security. In this paper, we resort to a diffusion model to simulate how shocks to domestic food production propagate through the international food trade network and study the relationship between trade openness and vulnerability. The results of our simulations suggest that low-income and food insecure countries tend to be the more exposed to external shocks and, at the same time, they are usually not in a position to take full advantage of international food trade when it comes to shield themselves from shocks to domestic production. We also study and discuss how nodes characteristics are associated with the propagation dynamics and with countries’ vulnerability, finding that simple centrality measures can significantly predict the magnitude of the shock experienced by individual countries.
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 external perturbations, such as targeted attacks to their units. Identifying the minimal set of units to attack to disintegrate a complex network, i.e. network dismantling, is a computationally challenging (NP-hard) problem which is usually attacked with heuristics. Here, we show that a machine trained to dismantle relatively small systems is able to identify higher-order topological patterns, allowing to disintegrate large-scale social, infrastructural and technological networks more efficiently than human-based heuristics. Remarkably, the machine assesses the probability that next attacks will disintegrate the system, providing a quantitative method to quantify systemic risk and detect early-warning signals of system’s collapse. This demonstrates that machine-assisted analysis can be effectively used for policy and decision-making to better quantify the fragility of complex systems and their response to shocks.
Networks are a powerful tool to model complex systems, and the definition of many Graph Neural Networks (GNN), Deep Learning algorithms that can handle networks, has opened a new way to approach many real-world problems that would be hardly or even untractable. In this paper, we propose mGNN, a framework meant to generalize GNNs to the case of multi-layer networks, i.e., networks that can model multiple kinds of interactions and relations between nodes. Our approach is general (i.e., not task specific) and has the advantage of extending any type of GNN without any computational overhead. We test the framework into three different tasks (node and network classification, link prediction) to validate it.