scientific article; zbMATH DE number 2038774

MaRDI QIDQ4449241zbMATH OpenFDO

Authors Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita

Publication date 8 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27191054.htm

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50)

Recommendations

• The hitting and cover times of random walks on finite graphs using local degree information
• How to Design a Linear Cover Time Random Walk on a Finite Graph
• Designing good random walks on finite graphs
• Random walks on highly symmetric graphs
• On the cover time of random walks on graphs

Cited in

(11)

• The hitting and cover times of random walks on finite graphs using local degree information
• Geometric bounds for convergence rates of averaging algorithms
• Designing good random walks on finite graphs
• How to Design a Linear Cover Time Random Walk on a Finite Graph
• Hitting times for random walks on subdivision and triangulation graphs
• Potential induced random teleportation on finite graphs
• A fast algorithm to find all high-degree vertices in graphs with a power-law degree sequence
• Memory Efficient Anonymous Graph Exploration
• Tight bounds for the cover time of multiple random walks
• Reversible random walks on dynamic graphs
• The hitting and cover times of Metropolis walks

This page was built for publication:

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