Fast low-cost estimation of network properties using random walks

DOI10.1007/978-3-319-03536-9_11MaRDI QIDQ2938022zbMATH OpenOpenAlexFDO

Authors Colin Cooper, Tomasz Radzik, Yiannis Siantos

Publication date 13 January 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://kclpure.kcl.ac.uk/portal/en/publications/fast-lowcost-estimation-of-network-properties-using-random-walks(36c267fd-5a8b-4829-9f96-01214837de4f).html

zbMATH Keywords

first returns of random walkslarge undirected graphs

Mathematics Subject Classification ID

Random walks on graphs (05C81) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Fast Low-Cost Estimation of Network Properties Using Random Walks
• Estimating graph parameters with random walks
• Calculating statistics of complex networks through random walks with an application to the on-line social network bebo
• Estimating random walk centrality in networks
• scientific article; zbMATH DE number 878897

Cited in

(8)

• Estimating graph parameters with random walks
• Estimating random walk centrality in networks
• Improving random walk estimation accuracy with uniform restarts
• Estimating graph parameters via random walks with restarts
• Estimating sizes of social networks via biased sampling
• Fast Low-Cost Estimation of Network Properties Using Random Walks
• Sequential stratified regeneration: \textit{MCMC} for large state spaces with an application to subgraph count estimation
• Calculating statistics of complex networks through random walks with an application to the on-line social network bebo

This page was built for publication: Fast low-cost estimation of network properties using random walks

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