Quick detection of nodes with large degrees

DOI10.1080/15427951.2013.798601zbMATH Open1461.05201OpenAlexW3029087166MaRDI QIDQ4985346FDOQ4985346

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

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

Mathematics Subject Classification ID

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

Cites Work

• Random graphs and complex networks. Volume 1
• Emergence of Scaling in Random Networks
• Title not available (Why is that?)
• Probability and Computing
• Title not available (Why is that?)
• Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph
• Improving random walk estimation accuracy with uniform restarts
• Quick detection of top-\(k\) personalized PageRank lists

Cited In (4)

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

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)