A Note on the PageRank of Undirected Graphs

Preprint English OPEN
Grolmusz, Vince;
  • Related identifiers: doi: 10.1016/j.ipl.2015.02.015
  • Subject: Computer Science - Discrete Mathematics | Computer Science - Data Structures and Algorithms
    arxiv: Computer Science::Information Retrieval | Computer Science::Digital Libraries | Computer Science::Social and Information Networks

The PageRank is a widely used scoring function of networks in general and of the World Wide Web graph in particular. The PageRank is defined for directed graphs, but in some special cases applications for undirected graphs occur. In the literature it is widely noted tha... View more
  • References (8)

    [3] Sergey Brin and Lawrence Page. The anatomy of a large-scale hypertextual web search engine. COMPUTER NETWORKS AND ISDN SYSTEMS, 30:107-117, 1998.

    [4] S. Gershgorin. Uber die abgrenzung der eigenwerte einer matrix. Izv. Akad. Nauk. USSR Otd. Fiz.-Mat. Nauk, 7:749-754, 1931.

    [5] C. F. Golub, G. H.; Van Loan. Matrix Computations. Johns Hopkins University Press, 1996.

    [6] Gabor Ivan and Vince Grolmusz. When the web meets the cell: using personalized pagerank for analyzing protein interaction networks. Bioinformatics, 27(3):405-407, Feb 2011.

    [7] Sepandar Kamvar and Taher Haveliwala. The condition number of the pagerank problem. Technical Report 2003-36, Stanford InfoLab, June 2003.

    [8] Laszlo Lovasz. Random walks on graphs: A survey. In Combinatorics, Paul Erdos is Eighty, BOLYAI SOCIETY MATHEMATICAL STUDIES. Janos Bolyai Mathematical Society, 1993.

    [9] Nicola Perra and Santo Fortunato. Spectral centrality measures in complex networks. Phys. Rev. E, 78(3):036107, Sep 2008.

    [10] Jinghua Wang, Jianyi Liu, and Cong Wang. Keyword extraction based on pagerank. In Zhi-Hua Zhou, Hang Li, and Qiang Yang, editors, Advances in Knowledge Discovery and Data Mining, volume 4426 of Lecture Notes in Computer Science, pages 857-864. Springer Berlin / Heidelberg, 2007.

  • Metrics
Share - Bookmark