Fragkiskos Papadopoulos

Dr. Fragkiskos Papadopoulos

Department of Electrical Engineering, Computer Engineering and Informatics, Cyprus University of Technology, 33 Saripolou Street, 3036 Limassol, Cyprus
orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 September 2010 in Physical Review E
Verified
Journal Article
Closed access
DKDmitri Krioukov
Dmitri Krioukov
FPFragkiskos Papadopoulos
Fragkiskos Papadopoulos
MKMaksim Kitsak
Maksim Kitsak
AVAmin Vahdat
Amin Vahdat
MBMarián Boguñá
Marián Boguñá
We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong clustering in complex networks emerge naturally as simple reflections of the negative curvature and metric property of the underlying hyperbolic geometry. Conversely, we show that if a network has some metric structure, and if the network degree distribution is heterogeneous, then the network has an effective hyperbolic geometry underneath. We then establish a mapping between our geometric framework and statistical mechanics of complex networks. This mapping interprets edges in a network as noninteracting fermions whose energies are hyperbolic distances between nodes, while the auxiliary fields coupled to edges are linear functions of these energies or distances. The geometric network ensemble subsumes the standard configuration model and classical random graphs as two limiting cases with degenerate geometric structures. Finally, we show that targeted transport processes without global topology knowledge, made possible by our geometric framework, are maximally efficient, according to all efficiency measures, in networks with strongest heterogeneity and clustering, and that this efficiency is remarkably robust with respect to even catastrophic disturbances and damages to the network structure.

12 September 2012 in Nature
Verified
Journal Article
Closed access
FPFragkiskos Papadopoulos
Fragkiskos Papadopoulos
MKMaksim Kitsak
Maksim Kitsak
MSM. Ángeles Serrano
M. Ángeles Serrano
MBMarián Boguñá
Marián Boguñá
DKDmitri Krioukov
Dmitri Krioukov

7 September 2010 in Nature Communications
Verified
Journal Article
Closed access
PDF file
MBMarián Boguñá
Marián Boguñá
FPFragkiskos Papadopoulos
Fragkiskos Papadopoulos
DKDmitri Krioukov
Dmitri Krioukov

9 January 2014 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
FPFragkiskos Papadopoulos
Fragkiskos Papadopoulos
CPConstantinos Psomas
Constantinos Psomas
DKDmitri Krioukov
Dmitri Krioukov
Recent years have shown a promising progress in understanding geometric underpinnings behind the structure, function, and dynamics of many complex networks in nature and society. However, these promises cannot be readily fulfilled and lead to important practical applications, without a simple, reliable, and fast network mapping method to infer the latent geometric coordinates of nodes in a real network. Here, we present HyperMap, a simple method to map a given real network to its hyperbolic space. The method utilizes a recent geometric theory of complex networks modeled as random geometric graphs in hyperbolic spaces. The method replays the network's geometric growth, estimating at each time-step the hyperbolic coordinates of new nodes in a growing network by maximizing the likelihood of the network snapshot in the model. We apply HyperMap to the Autonomous Systems (AS) Internet and find that: 1) the method produces meaningful results, identifying soft communities of ASs belonging to the same geographic region; 2) the method has a remarkable predictive power: Using the resulting map, we can predict missing links in the Internet with high precision, outperforming popular existing methods; and 3) the resulting map is highly navigable, meaning that a vast majority of greedy geometric routing paths are successful and low-stretch. Even though the method is not without limitations, and is open for improvement, it occupies a unique attractive position in the space of tradeoffs between simplicity, accuracy, and computational complexity.

4 July 2016 in Nature Physics
Verified
Journal Article
Closed access
KKKaj-Kolja Kleineberg
Kaj-Kolja Kleineberg
MBMarián Boguñá
Marián Boguñá
MSM. Ángeles Serrano
M. Ángeles Serrano
FPFragkiskos Papadopoulos
Fragkiskos Papadopoulos

23 September 2009 in Physical Review E
Verified
Journal Article
Closed access
PDF file
DKDmitri Krioukov
Dmitri Krioukov
FPFragkiskos Papadopoulos
Fragkiskos Papadopoulos
AVAmin Vahdat
Amin Vahdat
MBMarián Boguñá
Marián Boguñá
We show that heterogeneous degree distributions in observed scale-free topologies of complex networks can emerge as a consequence of the exponential expansion of hidden hyperbolic space. Fermi-Dirac statistics provides a physical interpretation of hyperbolic distances as energies of links. The hidden space curvature affects the heterogeneity of the degree distribution, while clustering is a function of temperature. We embed the internet into the hyperbolic plane and find a remarkable congruency between the embedding and our hyperbolic model. Besides proving our model realistic, this embedding may be used for routing with only local information, which holds significant promise for improving the performance of internet routing.