113 citations · 236 across the 7 of their papers we have counts for
7 papers
Embedding-aided network dismantling
Saeed Osat, Fragkiskos Papadopoulos, Andreia Sofia Teixeira +1
Optimal percolation concerns the identification of the minimum-cost strategy for the destruction of any extensive connected components in a network. Solutions of such a dismantling…
k-core structure of real multiplex networks
Saeed Osat, Filippo Radicchi, Fragkiskos Papadopoulos
Multiplex networks are convenient mathematical representations for many real-world -- biological, social, and technological -- systems of interacting elements, where pairwise inter…
Deep Learning Super-Diffusion in Multiplex Networks
Vito M. Leli, Saeed Osat, Timur Tlyachev +2
Complex network theory has shown success in understanding the emergent and collective behavior of complex systems [1]. Many real-world complex systems were recently discovered to b…
Characterizing the analogy between hyperbolic embedding and community structure of complex networks
Ali Faqeeh, Saeed Osat, Filippo Radicchi
We show that the community structure of a network can be used as a coarse version of its embedding in a hidden space with hyperbolic geometry. The finding emerges from a systematic…
Generalization of core percolation on complex networks
N. Azimi-Tafreshi, S. Osat, S. N. Dorogovtsev
We introduce a -leaf removal algorithm as a generalization of the so-called leaf removal algorithm. In this pruning algorithm, vertices of degree smaller than , together with…
Optimal percolation on multiplex networks
Saeed Osat, Ali Faqeeh, Filippo Radicchi
Optimal percolation is the problem of finding the minimal set of nodes such that if the members of this set are removed from a network, the network is fragmented into non-extensive…