no code implementations • 3 Aug 2020 • Pim van der Hoorn, William J. Cunningham, Gabor Lippner, Carlo Trugenberger, Dmitri Krioukov
Even though there exist numerous nonequivalent definitions of graph curvature, none is known to converge in any limit to any traditional definition of curvature of a Riemannian manifold.
Probability Disordered Systems and Neural Networks Social and Information Networks General Relativity and Quantum Cosmology Physics and Society
no code implementations • 9 Jan 2020 • Marian Boguna, Ivan Bonamassa, Manlio De Domenico, Shlomo Havlin, Dmitri Krioukov, M. Angeles Serrano
Networks are natural geometric objects.
Physics and Society Disordered Systems and Neural Networks Social and Information Networks
no code implementations • 10 Aug 2019 • Filippo Radicchi, Dmitri Krioukov, Harrison Hartle, Ginestra Bianconi
Existing information-theoretic frameworks based on maximum entropy network ensembles are not able to explain the emergence of heterogeneity in complex networks.
1 code implementation • 27 Jul 2015 • Maksim Kitsak, Ahmed Elmokashfi, Shlomo Havlin, Dmitri Krioukov
The Border Gateway Protocol is responsible for discovering and distributing this reachability information to all Autonomous Systems.
Physics and Society Networking and Internet Architecture
2 code implementations • 17 Mar 2015 • Rodrigo Aldecoa, Chiara Orsini, Dmitri Krioukov
Besides real-world-like networks, the program can generate random graphs from other well-known graph ensembles, such as the soft configuration model, random geometric graphs on a circle, or Erd\H{o}s-R\'enyi random graphs.
Physics and Society Social and Information Networks
1 code implementation • 19 Feb 2015 • Fragkiskos Papadopoulos, Rodrigo Aldecoa, Dmitri Krioukov
We introduce and explore a new method for inferring hidden geometric coordinates of nodes in complex networks based on the number of common neighbors between the nodes.
Social and Information Networks Networking and Internet Architecture Physics and Society
1 code implementation • 20 May 2012 • Fragkiskos Papadopoulos, Constantinos Psomas, Dmitri Krioukov
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.
Social and Information Networks Statistical Mechanics Networking and Internet Architecture Physics and Society
no code implementations • 17 Aug 2007 • Dmitri Krioukov, kc claffy, Kevin Fall, Arthur Brady
While there exist compact routing schemes designed for grids, trees, and Internet-like topologies that offer routing tables of sizes that scale logarithmically with the network size, we demonstrate in this paper that in view of recent results in compact routing research, such logarithmic scaling on Internet-like topologies is fundamentally impossible in the presence of topology dynamics or topology-independent (flat) addressing.
Networking and Internet Architecture C.2.2; G.2.2; C.2.1
