The cover times of random walks on random uniform hypergraphs

DOI10.1016/j.tcs.2013.01.020zbMath1417.05190OpenAlexW2092125189WikidataQ57401433 ScholiaQ57401433MaRDI QIDQ392193

Tomasz Radzik, Colin Cooper, Alan M. Frieze

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.020

zbMATH Keywords

random walksrandom graphshypergraphscover time

Mathematics Subject Classification ID

Hypergraphs (05C65) Random walks on graphs (05C81)

Related Items

Hypergraph Laplacians in Diffusion Framework ⋮ Network Capacity Bound for Personalized PageRank in Multimodal Networks ⋮ A probabilistic proof of Cooper and Frieze's "First Visit Time Lemma" ⋮ Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk ⋮ Hitting times, commute times, and cover times for random walks on random hypergraphs ⋮ Spectra of random regular hypergraphs ⋮ On the Cover Time of Dense Graphs ⋮ Sparse SYK and traversable wormholes

Cites Work

• Unnamed Item
• Covering problems for Brownian motion on spheres
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The cover time of the giant component of a random graph
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs
• The Cover Time of Random Regular Graphs

This page was built for publication: The cover times of random walks on random uniform hypergraphs