Random Walks with Lookahead on Power Law Random Graphs

DOI10.1080/15427951.2006.10129122MaRDI QIDQ5755200zbMATH OpenOpenAlexFDO

Authors Milena Mihail, Amin Saberi, Prasad Tetali

Publication date 20 August 2007

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15427951.2006.10129122

zbMATH Keywords

Chernoff boundsrandom perfect matchingrapid mixingsparse network

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50)

Recommendations

• Random walks with look-ahead in scale-free random graphs
• A fast algorithm to find all high degree vertices in graphs with a power law degree sequence
• A fast algorithm to find all high-degree vertices in graphs with a power-law degree sequence
• Crawling on Simple Models of Web Graphs
• A random-surfer web-graph model

Cited in

(4)

• A fast algorithm to find all high degree vertices in graphs with a power law degree sequence
• Minimum expected \(^*\)-cast time in DTNs
• Random walks with look-ahead in scale-free random graphs
• A fast algorithm to find all high-degree vertices in graphs with a power-law degree sequence

This page was built for publication: Random Walks with Lookahead on Power Law Random Graphs

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