Expected Cover and Hitting Times of the Giant Component in Hyperbolic Random Graphs

The expected cover time, maximum hitting time, and target time (average hitting time) of a simple random walk on the giant component of a hyperbolic random graph are Θ(n log^2 n), Θ(n log n), and Θ(n), respectively, asymptotically almost surely.