Quick detection of nodes with large degrees

DOI10.1080/15427951.2013.798601MaRDI QIDQ4985346zbMATH OpenOpenAlexFDO

Authors Nelly Litvak, Marina Sokol, Don Towsley, Konstantin Avrachenkov

Publication date 23 April 2021

Published in Internet Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Vertex degrees (05C07) Random walks on graphs (05C81) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Quick detection of nodes with large degrees
• 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
• Quick detection of top-k personalized PageRank lists
• Fast Low-Cost Estimation of Network Properties Using Random Walks

Cites work

• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 2015219 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Improving random walk estimation accuracy with uniform restarts
• Probability and Computing
• Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph
• Quick detection of top-k personalized PageRank lists
• Random graphs and complex networks. Volume 1

Cited in

(4)

• Quick detection of nodes with large degrees
• Comparing node degrees in probabilistic networks
• A fast algorithm to find all high-degree vertices in graphs with a power-law degree sequence
• Analysis of Relaxation Time in Random Walk with Jumps

Describes a project that uses

Uses Software

• WebGraph

This page was built for publication: Quick detection of nodes with large degrees

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