On the diameter of hyperbolic random graphs

Understand

Large real-world networks are typically scale-free.

• Recent research has shown that such graphs are described best in a geometric space.
• More precisely, the internet can be mapped to a hyperbolic space such that geometric greedy routing performs close to optimal (Bogun\'a, Papadopoulos, and Krioukov.
• Nature Communications, 1:62, 2010).