Skip to main content
Have a personal or library account? Click to login
An Efficient Monte Carlo Approach to Compute PageRank for Large Graphs on a Single PC Cover

An Efficient Monte Carlo Approach to Compute PageRank for Large Graphs on a Single PC

Foundations of Computing and Decision Sciences
Volume 41 (2016): Issue 1 (March 2016)
By:   
Open Access
|Mar 2016
References

References

  1. [1] K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova. Monte carlo methods in pagerank computation: When one iteration is sufficient., (2):890–904, February 2007.
    Open DOISearch in Google Scholar
  2. [2] Bahman Bahmani, Kaushik Chakrabarti, and Dong Xin. Fast personalized pagerank on mapreduce. In, pages 973–984, 2011.
    Open DOISearch in Google Scholar
  3. [3] Bahman Bahmani, Abdur Chowdhury, and Ashish Goel. Fast incremental and personalized pagerank., 4(3):173–184, 2010.
    Open DOISearch in Google Scholar
  4. [4] Paolo Boldi and Sebastiano Vigna. The WebGraph framework I: Compression techniques. In, pages 595–601, 2004.
    Open DOISearch in Google Scholar
  5. [5] Yenyu Chen, Qingqing Gan, and Torsten Suel. Local methods for estimating pagerank values. In, pages 381–389, 2004.
    Open DOISearch in Google Scholar
  6. [6] Shumo Chu and James Cheng. Triangle listing in massive networks and its applications. In, pages 672–680, 2011.
    Open DOISearch in Google Scholar
  7. [7] Atish Das Sarma, Sreenivas Gollapudi, and Rina Panigrahy. Estimating pagerank on graph streams. In, pages 69–78, 2008.
    Open DOISearch in Google Scholar
  8. [8] Atish Das Sarma, AnisurRahaman Molla, Gopal Pandurangan, and Eli Upfal. Fast distributed pagerank computation. In, pages 11–26. 2013.
    Open DOISearch in Google Scholar
  9. [9] Dániel Fogaras and Balázs Rácz. Towards scaling fully personalized pagerank. In, pages 105–117. 2004.
    Open DOISearch in Google Scholar
  10. [10] Wookshin Han, Sangyeon Lee, Kyungyeol Park, Jeonghoon Lee, Minsoo Kim, Jinha Kim, and Hwanjo Yu. Turbograph: a fast parallel graph engine handling billion-scale graphs in a single pc. In, pages 77–85, 2013.
    Search in Google Scholar
  11. [11] Sepandar Kamvar, Taher Haveliwala, Christopher Manning, and Gene Golub. Exploiting the block structure of the web for computing pagerank., 2003.
    Search in Google Scholar
  12. [12] U. Kang and Christos Faloutsos. Big graph mining: Algorithms and discoveries., (2):29–36, April 2013.
    Open DOISearch in Google Scholar
  13. [13] Christian Kohlschütter, Paul-Alexandru Chirita, and Wolfgang Nejdl. Efficient parallel computation of pagerank. In, pages 241–252. 2006.
    Open DOISearch in Google Scholar
  14. [14] Haewoon Kwak, Changhyun Lee, Hosung Park, and Sue Moon. What is Twitter, a social network or a news media? In, pages 591–600, 2010.
    Open DOISearch in Google Scholar
  15. [15] Aapo Kyrola, Guy Blelloch, and Carlos Guestrin. Graphchi: Large-scale graph computation on just a pc. In, pages 31–46, 2012.
    Search in Google Scholar
  16. [16] Grzegorz Malewicz, Matthew H Austern, Aart JC Bik, James C Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. Pregel: a system for large-scale graph processing. In, pages 135–146, 2010.
    Open DOISearch in Google Scholar
  17. [17] Frank McSherry. A uniform approach to accelerated pagerank computation. In, pages 575–582, 2005.
    Open DOISearch in Google Scholar
  18. [18] Julie L Morrison, Rainer Breitling, Desmond J Higham, and David R Gilbert. Generank: using search engine technology for the analysis of microarray experiments., (1):233, 2005.
    Search in Google Scholar
  19. [19] Mark E. J. Newman. Fast algorithm for detecting community structure in networks., 69(6):066133, 2004.
    Open DOISearch in Google Scholar
  20. [20] Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The pagerank citation ranking: Bringing order to the web. 1999.
    Search in Google Scholar
  21. [21] Jiayu Pan, Hyungjeong Yang, Christos Faloutsos, and Pinar Duygulu. Automatic multimedia cross-modal correlation discovery. In, pages 653–658, 2004.
    Open DOISearch in Google Scholar
  22. [22] Marcin Sydow. Random surfer with back step., 68(4):379–398, 2005.
    Search in Google Scholar
  23. [23] John Wicks and Amy Greenwald. Parallelizing the computation of pagerank. In, pages 202–208. 2007.
    Open DOISearch in Google Scholar
  24. [24] Jaewon Yang and Jure Leskovec. Defining and evaluating network communities based on ground-truth. In, pages 1–8, 2012.
    Open DOISearch in Google Scholar
DOI: https://doi.org/10.1515/fcds-2016-0002 | Journal eISSN: 2300-3405 (formerly 0867-6356) | Journal ISSN: 0867-6356
Journal RSS Feed
Language: English
Page range: 29 - 43
Submitted on: Jan 27, 2015
Accepted on: Jan 30, 2016
Published on: Mar 31, 2016
Published by: Poznan University of Technology
In partnership with: Paradigm Publishing Services
Keywords:
Graph,
Monte Carlo,
PageRank,
Random Walk
Related subjects:
Computer sciences,
Software development

© 2016 Tomohiro Sonobe, published by Poznan University of Technology
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Volume 41 (2016): Issue 1 (March 2016)
Previous article
Next article