The paper presents an algorithm to approach the problem of Maximum Clique Enumeration, a well known NP-hard problem that have several real world applications. The proposed solution, called LGP-MCE, exploits Geometric Deep Learning, a Machine Learning technique on graphs, to filter out nodes that do not belong to maximum cliques and then applies an exact algorithm to the pruned network. To assess the LGP-MCE, we conducted multiple experiments using a substantial dataset of real-world networks, varying in size, density, and other characteristics.
View Article and Find Full Text PDFIn 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.
View Article and Find Full Text PDFFrom 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.
View Article and Find Full Text PDF