Quick Detection of Nodes with Large Degrees

DOI10.1080/15427951.2013.798601zbMath1461.05201OpenAlexW3029087166MaRDI QIDQ4985346

Marina Sokol, Nelly Litvak, Don Towsley, Konstantin E. 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

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

Related Items (1)

Analysis of Relaxation Time in Random Walk with Jumps

Uses Software

• WebGraph

Cites Work

• Unnamed Item
• Unnamed Item
• Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph
• Random Graphs and Complex Networks
• Quick Detection of Top-k Personalized PageRank Lists
• Improving Random Walk Estimation Accuracy with Uniform Restarts
• Emergence of Scaling in Random Networks
• Probability and Computing

This page was built for publication: Quick Detection of Nodes with Large Degrees