Loading...

Sampling from complex networks with high community structures

Salehi, M ; Sharif University of Technology | 2012

115 Viewed
  1. Type of Document: Article
  2. DOI: 10.1063/1.4712602
  3. Publisher: 2012
  4. Abstract:
  5. In this paper, we propose a novel link-tracing sampling algorithm, based on the concepts from PageRank vectors, to sample from networks with high community structures. Our method has two phases; (1) Sampling the closest nodes to the initial nodes by approximating personalized PageRank vectors and (2) Jumping to a new community by using PageRank vectors and unknown neighbors. Empirical studies on several synthetic and real-world networks show that the proposed method improves the performance of network sampling compared to the popular link-based sampling methods in terms of accuracy and visited communities
  6. Keywords:
  8. Source: Chaos ; Volume 22, Issue 2 , 2012 ; 10541500 (ISSN)
  9. URL: http://scitation.aip.org/content/aip/journal/chaos/22/2/10.1063/1.4712602