scientific article; zbMATH DE number 5060846
From MaRDI portal
Publication:5491464
zbMath1104.68042MaRDI QIDQ5491464
Amy N. Langville, Carl D. jun. Meyer
Publication date: 5 October 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
spamtextbookinformation retrievalMarkov chainPerron-Frobenius theoryintelligent agentsquery processingGoogle matrixstochastic complementationcrawlingGoogle's PageRankHITS and SALSA algorithmslibrary classification schemesupdating PageRank
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Information storage and retrieval of data (68P20)
Related Items (only showing first 100 items - show all)
Models of latent consensus ⋮ Opinion formation driven by PageRank node influence on directed networks ⋮ On the convergence of the minimally irreducible Markov chain method with applications to PageRank ⋮ Ranking in evolving complex networks ⋮ Enriched line graph: a new structure for searching language collocations ⋮ On graph combinatorics to improve eigenvector-based measures of centrality in directed networks ⋮ Off-diagonal low-rank preconditioner for difficult PageRank problems ⋮ Acceleration of an adaptive generalized Arnoldi method for computing PageRank ⋮ Finding the stationary states of Markov chains by iterative methods ⋮ An iterative aggregation and disaggregation method for the steady state solution of large scale continuous systems ⋮ An Arnoldi-Inout algorithm for computing PageRank problems ⋮ Efficient initials for computing maximal eigenpair ⋮ Alleviating road network congestion: traffic pattern optimization using Markov chain traffic assignment ⋮ The projection method for reaching consensus and the regularized power limit of a stochastic matrix ⋮ A relaxed two-step splitting iteration method for computing PageRank ⋮ Regularization-based solution of the PageRank problem for large matrices ⋮ A new method (K-method) of calculating the mutual influence of nodes indirected weight complex networks ⋮ Fuzzy random walkers with second order bounds: an asymmetric analysis ⋮ Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank ⋮ An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank ⋮ A bag-of-paths framework for network data analysis ⋮ Multi-cultural Wikipedia mining of geopolitics interactions leveraging reduced Google matrix analysis ⋮ Convergence of the Nelder-Mead method ⋮ Ulam method and fractal Weyl law for Perron-Frobenius operators ⋮ Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem ⋮ Red light green light method for solving large Markov chains ⋮ PageRank computation via a distributed randomized approach with lossy communication ⋮ On perturbations of principal eigenvectors of substochastic matrices ⋮ Graphs with absorption: numerical methods for the absorption inverse and the computation of centrality measures ⋮ Random walks and diffusion on networks ⋮ An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank ⋮ Clusters in Markov chains via singular vectors of Laplacian matrices ⋮ Competitivity groups on social network sites ⋮ From senses to texts: an all-in-one graph-based approach for measuring semantic similarity ⋮ Ranking hubs and authorities using matrix functions ⋮ A variant of the Power-Arnoldi algorithm for computing PageRank ⋮ A matrix-based ranking method with application to tennis ⋮ A flexible and adaptive simpler GMRES with deflated restarting for shifted linear systems ⋮ The intellectual influence of economic journals: quality versus quantity ⋮ On the localization of the personalized PageRank of complex networks ⋮ Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems ⋮ Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks ⋮ Practical acceleration for computing the HITS expertrank vectors ⋮ Web page importance ranking ⋮ A new multivariate Markov chain model for adding a new categorical data sequence ⋮ Modelling the navigation potential of a web page ⋮ Perron vector optimization applied to search engines ⋮ PageRank optimization by edge selection ⋮ On some analytical properties of a general PageRank algorithm ⋮ A fixed point approach to the steady state for stochastic matrices ⋮ Characteristic polynomials of some perturbed matrices ⋮ The extrapolation-accelerated multilevel aggregation method in PageRank computation ⋮ Several relaxed iteration methods for computing PageRank ⋮ A two-step matrix splitting iteration for computing PageRank ⋮ The sensitivity of a quantum PageRank ⋮ Parallel multisplitting iteration methods based on M-splitting for the PageRank problem ⋮ PageRank model of opinion formation on Ulam networks ⋮ Maximizing PageRank via outlinks ⋮ A note on certain ergodicity coefficients ⋮ Linear neural networks revisited: from PageRank to family happiness ⋮ Hitting times in Markov chains with restart and their application to network centrality ⋮ Learning and teaching ``what is mathematics ⋮ Ranking nodes in general networks: a Markov multi-chain approach ⋮ On algebraic multi-level methods for non-symmetric systems --- comparison results ⋮ A centrality measure in dense networks based on two-way random walk betweenness ⋮ PageRank computation with MAAOR and lumping methods ⋮ The power method and beyond ⋮ Tackling information asymmetry in networks: a new entropy-based ranking index ⋮ The jump start power method: a new approach for computing the ergodic projector of a finite Markov chain ⋮ Dynamic models of informational control in social networks ⋮ Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem ⋮ The general inner-outer iteration method based on regular splittings for the PageRank problem ⋮ Choose the damping, choose the ranking? ⋮ A preconditioning approach to the pagerank computation problem ⋮ On the eigenvalues of specially low-rank perturbed matrices ⋮ Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph ⋮ An Arnoldi-extrapolation algorithm for computing pagerank ⋮ New models for multi-class networks ⋮ The NIRS brain AnalyzIR toolbox ⋮ A note on the two-step matrix splitting iteration for computing PageRank ⋮ The PageRank model of minimal irreducible adjustment and its lumping method ⋮ On computing PageRank via lumping the Google matrix ⋮ The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank ⋮ Edge Modification Criteria for Enhancing the Communicability of Digraphs ⋮ Soft computing methods for multiobjective location of garbage accumulation points in smart cities ⋮ PageRank Beyond the Web ⋮ The mathematics of internet search engines ⋮ Local dependency in networks ⋮ Krylov and steady-state techniques for the solution of the chemical master equation for the mitogen-activated protein kinase cascade ⋮ Adaptive algebraic smoothers ⋮ Assessment and optimization of e-commerce websites of fish culture sector ⋮ A general multi-splitting iteration method for computing PageRank ⋮ An extrapolation iteration and its lumped type iteration for computing PageRank ⋮ On the exponential ranking and its linear counterpart ⋮ A preprocessed multi-step splitting iteration for computing PageRank ⋮ A preconditioned and extrapolation-accelerated GMRES method for pagerank ⋮ A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix ⋮ On efficient randomized algorithms for finding the PageRank vector ⋮ The coupled iteration algorithms for computing PageRank ⋮ A Hessenberg-type algorithm for computing PageRank problems
Uses Software
This page was built for publication:
