✦ LIBER ✦

On the localization of the personalized PageRank of complex networks

✍ Scribed by García, E.; Pedroche, F.; Romance, M.

Book ID: 122347405
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 434 KB
Volume: 439
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2012.10.051

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of the Monte Carlo met

On the complexity of the Monte Carlo method for incremental PageRank

✍ Lofgren, Peter 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Personal Networks (Wireless Networking f

Personal Networks (Wireless Networking for Personal Devices) || The Future of Personal Networks

✍ Jacobsson, Martin; Niemegeers, Ignas; Heemstra de Groot, Sonia 📂 Article 📅 2010 🏛 John Wiley & Sons, Ltd ⚖ 439 KB 👁 1 views

An algorithm for ranking the nodes of an

An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector

✍ Taras Agryzkov; Jose L. Oliver; Leandro Tortosa; Jose F. Vicent 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 802 KB

On Maximizing the Entropy of Complex Net

On Maximizing the Entropy of Complex Networks

✍ Maytham H. Safar; Ibrahim Y. Sorkhoh; Hisham M. Farahat; Khaled A. Mahdi 📂 Article 📅 2011 🏛 Elsevier 🌐 English ⚖ 511 KB

On the pinning strategy of complex netwo

On the pinning strategy of complex networks

✍ Yang, Lei; Wang, Xingang; Li, Yao; Sheng, Zhengmao 📂 Article 📅 2010 🏛 EDP Sciences 🌐 English ⚖ 381 KB

Comparison of Krylov subspace methods on

Comparison of Krylov subspace methods on the PageRank problem

✍ Gianna M. Del Corso; Antonio Gullí; Francesco Romani 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 289 KB

PageRank algorithm plays a very important role in search engine technology and consists in the computation of the eigenvector corresponding to the eigenvalue one of a matrix whose size is now in the billions. The problem incorporates a parameter that determines the difficulty of the problem. In this