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

DOI10.1016/J.SPL.2019.06.011zbMATH Open1422.60016arXiv1903.01198OpenAlexW2955412227MaRDI QIDQ2273705FDOQ2273705

Amine Helali, M. Löwe

Publication date: 25 September 2019

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

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.

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

zbMATH Keywords

hitting timerandom walkscover timerandom hypergraphscommute time

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Random graphs and complex networks. Volume 1
• Loose laplacian spectra of random hypergraphs
• Asymptotic normality of the size of the giant component in a random hypergraph
• A phase transition for the limiting spectral density of random matrices
• Spectral statistics of Erdős-Rényi graphs. I: Local semicircle law
• The cover times of random walks on random uniform hypergraphs
• First-passage properties of the Erdos–Renyi random graph
• The semicircle law for matrices with ergodic entries
• On hitting times for a simple random walk on dense Erdös-Rényi random graphs
• Exploring hypergraphs with martingales

Cited In (8)

• The hitting time of random walk on unicyclic graphs
• Concentration of hitting times in Erdős-Rényi graphs
• Return probabilities and hitting times of random walks on sparse Erdös-Rényi graphs
• Decomposing hitting times of walks on graphs into simpler ones
• Spectra of random regular hypergraphs
• Expected hitting and cover times of random walks on some special graphs
• Hitting times for random walks on subdivision and triangulation graphs
• A central limit theorem for the mean starting hitting time for a random walk on a random graph

Recommendations

• Title not available (Why is that?) 👍 👎
• Hitting times for random walks on vertex-transitive graphs 👍 👎
• The cover times of random walks on random uniform hypergraphs 👍 👎
• On the cover time of random walks on graphs 👍 👎
• On the Cover Time for Random Walks on Random Graphs 👍 👎
• On hitting times for a simple random walk on dense Erdös-Rényi random graphs 👍 👎
• Expected hitting and cover times of random walks on some special graphs 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2273705)