Cover and Hitting Times of Hyperbolic Random Graphs

07/14/2022
by   Marcos Kiwi, et al.
0

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 nlog 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2021

Metropolis Walks on Dynamic Graphs

Recently, random walks on dynamic graphs have been studied because of it...
research
05/08/2022

Cover time of graphs with bounded genus

The cover time of a finite connected graph is the expected number of ste...
research
11/12/2019

The Power of Two Choices for Random Walks

We apply the power-of-two-choices paradigm to random walk on a graph: ra...
research
06/29/2023

Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs

In this paper, we study the maximum clique problem on hyperbolic random ...
research
09/04/2017

Estimating graph parameters via random walks with restarts

In this paper we discuss the problem of estimating graph parameters from...
research
02/15/2021

Local Access to Random Walks

For a graph G on n vertices, naively sampling the position of a random w...
research
10/11/2022

Universal cover-time distribution of heterogeneous random walks

The cover-time problem, i.e., time to visit every site in a system, is o...

Please sign up or login with your details

Forgot password? Click here to reset