Hitting times, commute times, and cover times for random walks on random hypergraphs

2019/03/04 by Helali, Amine, Löwe, Matthias
#FOS: Mathematics #Probability (math.PR)

paper · doi:10.48550/arxiv.1903.01198

Abstract

We consider random walk on the structure given by a random hypergraph in the regime where there is a unique giant component. We give the asymptotics for hitting times, cover times, and commute times and show that the results obtained for random walk on random graphs are universal.

Related

• Cover and Hitting Times of Hyperbolic Random Graphs
• On the Structure and Computation of Random Walk Times in Finite Graphs
• The Cover Time of Random Walks on Graphs
• Cover times and generic chaining
• On the jump of the cover time in random geometric graphs