149
Views
4
CrossRef citations to date
0
Altmetric
Section B

NewFriends: an algorithm for computing the minimum number of friends required by a user to get the highest PageRank in a social network

, &
Pages 278-290 | Received 07 Nov 2012, Accepted 03 Mar 2013, Published online: 16 Apr 2013

References

  • S. Allesina and M. Pascual, Googling food webs: Can an eigenvector measure species importance for coextinctions?PLoS Comput. Biol.5(5) (2009), pp 1–6 (doi:10.1371/journal.pcbi.1000494)
  • D. Austin, Cómo Google encuentra su aguja en un pajar de la Web, 2008. Available at http://es.prmob.net/google/optimizaci'on-del-search-engine/pagerank-2246691.html.
  • K. Avrachenkov and N. LitvakThe effect of new links on Google PageRank INRIA, Rapport de recherché 2004
  • L. Becchetti and C. Castillo, The distribution of PageRank follows a power-law only for particular values of the damping factor, Proceedings of the 15th International Conference on World Wide Web. WWW ’06, ACM Press, New York, 2006, pp. 941–942.
  • S. Bekman. 12 things to do to improve your site's Google page rank, 2006. Available at http://stason.org/articles/money/seo/google/12_things_to_do_to_improve_your_site_google_page_rank.html.
  • P. Boldi, TotalRank: Ranking without damping, Proceedings of the 14th International Conference on World Wide Web, Chiba, 2005, ppp. 898–899.
  • P. Boldi, M. Santini, and S. Vigna, PageRank as a function of the damping factor, Proceedings of the 14th International Conference on World Wide Web, Chiba, 2005, pp. 557–566.
  • P. Bonacich, Factoring and weighting approaches to clique identificationJ. Math. Sociol.19722113–120 (doi:10.1080/0022250X.1972.9989806) doi: 10.1080/0022250X.1972.9989806
  • P. Bonacich and P. Lloyd, Eigenvector-like measures of centrality for asymmetric relationsSoc. Netw.23(23) (2001)191–201 (doi:10.1016/S0378-8733(01)00038-7) doi: 10.1016/S0378-8733(01)00038-7
  • W. CottonPageRank explained with Javascript 2010 Available at http://williamcotton.com/pagerank-explained-withjavascript.
  • L. C. Freeman, Centrality in social networks conceptual clarificationSoc. Netw.19791215–239 (doi:10.1016/0378-8733(78)90021-7) doi: 10.1016/0378-8733(78)90021-7
  • J.M. Gracia, Matrices No Negativas, Paseos Aleatorios Y Cadenas De Markov, Universidad del País Vasco Matemática Aplicada y Estadística, Bilbao, Spain, 2002.
  • M. Herrera, J. Gutiérrez-Pérez, J. Izquierdo, and R. Pérez-García, Ajustes En El Modelo PageRank de Google Para El Estudio De La Importancia Relativa De Los Nodos De La Red De Abastecimiento, Proceedings of X Ibero-American Seminar SERE, Morelia, Michoacán, Mexico, 2011.
  • C. B. JonesSystematic Software Development using V2 Prentice HallUpper Saddle River, NJ1990350
  • F. D. LewisEssays on algorithm analysis essays Tech. Rep., Department of Computer Science, University of Kentucky 2001 available at http://cs.engr.uky.edu/~lewis/essays/analysis.pdf, 2006.
  • J. L. Molina, J. Muñoz and P. LosegoRed y realidad: aproximación análisis de Redes científicas VII Congreso Nacional de Psicología Social Oviedo, Universitat Autnoma de BarcelonaBarcelona, Spain2000
  • L. Page, S. Brin, R. Motwani, and T. Winograd, The PageRank citation ranking: Bringing order to the web, Proceedings of the 7th International World Wide Web Conference. Brisbane, Australia, 1998, pp. 161–172.
  • F. PedrocheMétodos de cálculo del vector PageRank Instituto de Matemática Multidisciplinaria, Universidad Politécnica de ValenciaValencia, Spain20077–30
  • F. PedrocheRanking Nodes in Social Network Sites Using Biased PageRank Instituto de Matemática Multidisciplinaria, Universidad Politécnica de ValenciaValencia2010
  • F. Pedroche, C. Criado, E. Garca and M. Romance, Matrix growth models based on centrality measures: A first analysisInt. J. Complex Syst. Sci.1(1) (2011)124–128
  • F. Radicchi, Who is the best player ever? A complex network analysis of the history of professional tennisPLoS ONE6(6) (2011)1–7 (doi:10.1371/journal.pone.0017249)
  • M. SydowCan One Out-link Change Your PageRank? Advances in Web Intelligence Lecture Notes in Computer ScienceSpringer, Berlin, Heidelberg2005408–414
  • A. L. Traud, E. D. Kelsic, P. J. Mucha and M. A. Porter, Community structure in online collegiate social networksSIAM53(53) (2012)526–543 (doi:10.1137/080734315)

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.