Cover and Hitting Times of Hyperbolic Random Graphs



Kiwi, M, Schepers, M and Sylvester, J ORCID: 0000-0002-6543-2934
(2022) Cover and Hitting Times of Hyperbolic Random Graphs. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022), 2022-9-19 - ?.

Access the full-text of this item by clicking on the Open Access link.

Abstract

We study random walks on the giant component of Hyperbolic Random Graphs (HRGs), in the regime when the degree distribution obeys a power law with exponent in the range (2, 3). In particular, we focus on the expected times for a random walk to hit a given vertex or visit, i.e. cover, all vertices. We show that up to multiplicative constants: the cover time is n(log n)2, the maximum hitting time is n log n, and the average hitting time is n. The first two results hold in expectation and a.a.s. and the last in expectation (with respect to the HRG). We prove these results by determining the effective resistance either between an average vertex and the well-connected “center” of HRGs or between an appropriately chosen collection of extremal vertices. We bound the effective resistance by the energy dissipated by carefully designed network flows associated to a tiling of the hyperbolic plane on which we overlay a forest-like structure.

Item Type: Conference or Workshop Item (Unspecified)
Divisions: Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science
Depositing User: Symplectic Admin
Date Deposited: 14 Mar 2023 10:44
Last Modified: 11 May 2024 17:08
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2022.30
Open Access URL: http://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.3...
URI: https://livrepository.liverpool.ac.uk/id/eprint/3168971