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

DOI10.1016/j.spl.2019.06.011zbMath1422.60016arXiv1903.01198OpenAlexW2955412227MaRDI QIDQ2273705

Amine Helali, Matthias Loewe

Publication date: 25 September 2019

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.01198

zbMATH Keywords

random walkshitting timecover timerandom hypergraphscommute time

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Random walks on graphs (05C81)

Related Items (2)

A central limit theorem for the mean starting hitting time for a random walk on a random graph ⋮ Spectra of random regular hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Spectral statistics of Erdős-Rényi graphs. I: Local semicircle law
• A phase transition for the limiting spectral density of random matrices
• The cover times of random walks on random uniform hypergraphs
• The semicircle law for matrices with ergodic entries
• On hitting times for a simple random walk on dense Erdös-Rényi random graphs
• Random Graphs and Complex Networks
• Asymptotic normality of the size of the giant component in a random hypergraph
• Loose laplacian spectra of random hypergraphs
• First-passage properties of the Erdos–Renyi random graph
• Exploring hypergraphs with martingales

This page was built for publication: Hitting times, commute times, and cover times for random walks on random hypergraphs