Computer Science – Data Structures and Algorithms
Scientific paper
2012-02-15
Computer Science
Data Structures and Algorithms
Scientific paper
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 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.
Avrachenkov Konstantin
Litvak Nelly
Sokol Marina
Towsley Don
No associations
LandOfFree
Quick Detection of Nodes with Large Degrees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Quick Detection of Nodes with Large Degrees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quick Detection of Nodes with Large Degrees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-557160