Quick Detection of Nodes with Large Degrees - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2012

Quick Detection of Nodes with Large Degrees

(1) , (2) , (1) , (3)
1
2
3

Abstract

Our goal is to quickly find top $k$ lists of nodes with the largest degrees in large complex networks. If the adjacency list of the network is known (not often the case in complex networks), a deterministic algorithm to find a node with the largest degree requires an average complexity of $\mbox{O}(n)$, where $n$ is the number of nodes in the network. Even this modest complexity can be very high for large complex networks. We propose to use the random walk based method. We show theoretically and by numerical experiments that for large networks the random walk method finds good quality top lists of nodes with high probability and with computational savings of orders of magnitude. We also propose stopping criteria for the random walk method which requires very little knowledge about the structure of the network.
Fichier principal
Vignette du fichier
RR-7881.pdf (341.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00670278 , version 1 (15-02-2012)

Identifiers

Cite

Konstantin Avrachenkov, Nelly Litvak, Marina Sokol, Don Towsley. Quick Detection of Nodes with Large Degrees. [Research Report] RR-7881, INRIA. 2012. ⟨hal-00670278⟩
165 View
233 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More