메뉴 건너뛰기




Volumn 3, Issue 4, 2006, Pages 385-411

A general setting for the parametric google matrix

Author keywords

[No Author keywords available]

Indexed keywords


EID: 77955279653     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2006.10129131     Document Type: Article
Times cited : (19)

References (19)
  • 1
    • 33746308367 scopus 로고    scopus 로고
    • Graph Fibrations, Graph Isomorphism, and PageRank
    • P. Boldi, V. Lonati, M. Santini, and S. Vigna. “Graph Fibrations, Graph Isomorphism, and PageRank.” Theor. Inform. Appl. 40 (2006), 227–253.
    • (2006) Theor. Inform. Appl , vol.40 , pp. 227-253
    • Boldi, P.1    Lonati, V.2    Santini, M.3    Vigna, S.4
  • 2
    • 84972526617 scopus 로고
    • Limits for the Characteristic Roots of a Matrix. IV: Applications to Stochastic Matrices
    • A. Brauer. “Limits for the Characteristic Roots of a Matrix. IV: Applications to Stochastic Matrices.” Duke Math. J. 19 (1952), 75–91.
    • (1952) Duke Math. J , vol.19 , pp. 75-91
    • Brauer, A.1
  • 4
    • 34247383235 scopus 로고    scopus 로고
    • The PageRank Vector: Properties, Computation, Approximation, and Acceleration
    • C. Brezinski and M. Redivo Zaglia. “The PageRank Vector: Properties, Computation, Approximation, and Acceleration.” SIAM J. Matrix Anal. Appl. 28 (2006), 551–575.
    • (2006) SIAM J. Matrix Anal. Appl , vol.28 , pp. 551-575
    • Brezinski, C.1    Zaglia, M.R.2
  • 5
    • 47249131262 scopus 로고    scopus 로고
    • Rational Extrapolation for the PageRank Vector
    • posted on Februrary7, 2008 PII S, 0025-5718(08)02086-3 (to appear in print)
    • C. Brezinski and M. Redivo Zaglia. “Rational Extrapolation for the PageRank Vector.” Math. Comput., posted on Februrary7, 2008 PII S 0025-5718(08)02086-3 (to appear in print).
    • Math. Comput
    • Brezinski, C.1    Zaglia, M.R.2
  • 8
    • 84924205346 scopus 로고    scopus 로고
    • Fast PageRank Computation via a Sparse Linear System
    • G. Del Corso, A. Gullí, and F. Romani. “Fast PageRank Computation via a Sparse Linear System.” Internet Math. 2:3 (2005), 251–273.
    • (2005) Internet Math , vol.2 , Issue.3 , pp. 251-273
    • Del Corso, G.1    Gullí, A.2    Romani, F.3
  • 9
    • 33646719673 scopus 로고    scopus 로고
    • Numerical Linear Algebra in Data Mining
    • L. Eldén. “Numerical Linear Algebra in Data Mining.” Acta Numerica 15 (2006), 327–384.
    • (2006) Acta Numerica , vol.15 , pp. 327-384
    • Eldén, L.1
  • 11
    • 0004151494 scopus 로고
    • New York: Cambridge University Press
    • R. Horn and C. Johnson. Matrix Analysis. New York: Cambridge University Press, 1985.
    • (1985) Matrix Analysis
    • Horn, R.1    Johnson, C.2
  • 12
    • 33646455491 scopus 로고    scopus 로고
    • Convergence Analysis of a PageRanking Updating Algorithm by Langville andMeyer
    • I. Ipsen and S. Kirkland. “Convergence Analysis of a PageRanking Updating Algorithm by Langville andMeyer.” SIAM J. Matrix Anal. Appl. 27:4 (2006), 952–967.
    • (2006) SIAM J. Matrix Anal. Appl , vol.27 , Issue.4 , pp. 952-967
    • Ipsen, I.1    Kirkland, S.2
  • 13
    • 33748133020 scopus 로고    scopus 로고
    • Conditioning of the Entries in the Stationary Vector of a Google-Type Matrix
    • S. Kirkland. “Conditioning of the Entries in the Stationary Vector of a Google-Type Matrix.” Linear Algebra Appl. 418 (2006), 665–681.
    • (2006) Linear Algebra Appl , vol.418 , pp. 665-681
    • Kirkland, S.1
  • 14
    • 84906232105 scopus 로고    scopus 로고
    • Deeper Inside PageRank
    • A. Langville and C. Meyer. “Deeper Inside PageRank.” Internet Math. 1:3 (2004), 335–380.
    • (2004) Internet Math , vol.1 , Issue.3 , pp. 335-380
    • Langville, A.1    Meyer, C.2
  • 15
    • 17444429623 scopus 로고    scopus 로고
    • A Survey of Eigenvector Methods for WEB Information Retrieval
    • A. Langville and C. Meyer. “A Survey of Eigenvector Methods for WEB Information Retrieval. SIAM Review 47:1 (2005), 135–161.
    • (2005) SIAM Review , vol.47 , Issue.1 , pp. 135-161
    • Langville, A.1    Meyer, C.2
  • 16
    • 21844499643 scopus 로고
    • A Formula for Singular Perturbations of Markov Chains
    • J. Lasserre. “A Formula for Singular Perturbations of Markov Chains.” J. Appl. Prob. 31 (1994), 829–833.
    • (1994) J. Appl. Prob , vol.31 , pp. 829-833
    • Lasserre, J.1
  • 18
    • 21444456044 scopus 로고    scopus 로고
    • An Inequality for Nonnegative Matrices and the Inverse Eigenvalue Problem
    • R. Reams. “An Inequality for Nonnegative Matrices and the Inverse Eigenvalue Problem.” Linear Multilinear Algebra 41 (1996), 367–375.
    • (1996) Linear Multilinear Algebra , vol.41 , pp. 367-375
    • Reams, R.1
  • 19
    • 33646230760 scopus 로고    scopus 로고
    • Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
    • S. Serra-Capizzano. “Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation.” SIAM J. Matrix Anal. Appl. 27 (2005), 305–312.
    • (2005) SIAM J. Matrix , vol.27 , pp. 305-312
    • Serra-Capizzano, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.