Improving random walk estimation accuracy with uniform restarts

DOI10.1007/978-3-642-18009-5_10MaRDI QIDQ3067509zbMATH OpenOpenAlexFDO

Authors

Publication date 21 January 2011

Published in Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18009-5_10

Mathematics Subject Classification ID

Random walks on graphs (05C81) Internet topics (68M11) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1743766
• Distributed random walks
• Estimating graph parameters via random walks with restarts
• Sampling online social networks by random walk with indirect jumps
• Fast low-cost estimation of network properties using random walks

Cited in

(8)

• Sampling online social networks by random walk with indirect jumps
• PageRank beyond the web
• Estimating graph parameters via random walks with restarts
• Quick detection of nodes with large degrees
• Analysis of Relaxation Time in Random Walk with Jumps
• On the normalized Laplacian spectra of random geometric graphs
• Preface: stochastic resetting—theory and applications
• Queues with service resetting

This page was built for publication: Improving random walk estimation accuracy with uniform restarts

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