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

## TL;DR

This paper analyzes the behavior of random walks on random hypergraphs, providing asymptotic results for hitting, cover, and commute times, and demonstrating the universality of these results across different structures.

## Contribution

It extends known results from random graphs to hypergraphs, establishing asymptotic formulas and universality for random walk metrics.

## Key findings

- Asymptotic formulas for hitting, cover, and commute times on hypergraphs.
- Universality of random walk metrics across graph and hypergraph structures.
- Validation of theoretical results in the regime with a giant component.

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