Deeper Inside PageRank
From MaRDI portal
Recommendations
- PageRank beyond the web
- Google’s pagerank
- Google's PageRank and beyond. The science of search engine rankings
- A note on the pagerank algorithm
- An improved approach to the PageRank problems
- scientific article; zbMATH DE number 6013704
- PageRank's behavior under degree correlations
- An inner-outer iteration for computing PageRank
Cited in
(only showing first 100 items - show all)- The PageRank vector of a scale-free web network growing by preferential attachment
- The Kemeny constant for finite homogeneous ergodic Markov chains
- Black hole metric: overcoming the PageRank normalization problem
- Structured Eigenvalue Problems
- Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks
- Fully personalized PageRank and algebraic methods to distribute a random walker
- A continuum limit for the PageRank algorithm
- Google PageRank as mean playing time for pinball on the reverse web
- Preface: stochastic resetting—theory and applications
- Queues with service resetting
- Random walks on dense graphs and graphons
- Necessary and sufficient local convergence condition of one class of iterative aggregation-disaggregation methods
- Traps and Pitfalls of Topic-Biased PageRank
- On the approximability of the link building problem
- Networks beyond pairwise interactions: structure and dynamics
- Secure fast evaluation of iterative methods: with an application to secure PageRank
- Parametric controllability of the personalized PageRank: Classic model vs biplex approach
- Eigenvalues of rank-one updated matrices with some applications
- A new insight into linguistic pattern analysis based on multilayer hypergraphs for the automatic extraction of text summaries
- Identifying systemically important financial institutions: a network approach
- Indirect influences in international trade
- On adaptively accelerated Arnoldi method for computing PageRank.
- Distribution of PageRank Mass Among Principle Components of the Web
- Choose the damping, choose the ranking?
- A Power–Arnoldi algorithm for computing PageRank
- Maximizing PageRank via outlinks
- Non-backtracking PageRank
- Google pageranking problem: The model and the analysis
- A Hessenberg-type algorithm for computing PageRank problems
- The coupled iteration algorithms for computing PageRank
- Hitting times in Markov chains with restart and their application to network centrality
- A Brauer's theorem and related results
- Fast distributed PageRank computation
- An adaptive Power-GArnoldi algorithm for computing PageRank
- Several relaxed iteration methods for computing PageRank
- A note on the pagerank algorithm
- A multi-power and multi-splitting inner-outer iteration for PageRank computation
- Random walks and diffusion on networks
- A new betweenness centrality measure based on an algorithm for ranking the nodes of a network
- PageRank beyond the web
- Ranking nodes in general networks: a Markov multi-chain approach
- The general inner-outer iteration method based on regular splittings for the PageRank problem
- High-order degree and combined degree in complex networks
- Conditioning of the entries in the stationary vector of a Google-type matrix
- Algebraic connectivity may explain the evolution of gene regulatory networks
- On the eigenvalues of specially low-rank perturbed matrices
- The eigenvalue problem of a specially updated matrix
- Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
- Axiomatic characterization of PageRank
- Determining Factors Behind the PageRank Log-Log Plot
- Exploring and understanding citation-based scientific metrics
- The Effect of New Links on Google Pagerank
- Eigenvalues and Jordan canonical form of a successively rank-one updated complex matrix with applications to Google's PageRank problem
- Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph
- Acceleration of the generalized FOM algorithm for computing PageRank
- Perturbed Markov chains with damping component
- On the eigenvalues of a specially updated complex matrix
- Applications of Page Ranking in P Systems
- A Dynamic Algorithm for Network Propagation
- On the spectrum of two-layer approach and multiplex PageRank
- A note on the two-step matrix splitting iteration for computing PageRank
- Non-backtracking PageRank: from the classic model to Hashimoto matrices
- PageRank in evolving tree graphs
- Optimization of design parameters and improvement of human comfort conditions in an upper-limb exosuit for assistance
- Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors
- Competitive economy as a ranking device over networks
- On the convergence of the minimally irreducible Markov chain method with applications to PageRank
- Flexible and deflated variants of the block shifted GMRES method
- The mathematics of internet search engines
- Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
- Comparison of three Web search algorithms
- PageRank problem, survey and future research directions
- Justifying the small-world phenomenon via random recursive trees
- LiveRank: how to refresh old datasets
- A two-step matrix splitting iteration for computing PageRank
- Probabilistic Relation between In-Degree and PageRank
- Representing and Quantifying Rank - Change for the Web Graph
- An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank
- Hessenberg-type algorithm for PageRank acceleration based on Chebyshev polynomials
- New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks
- A Markov chain approach for ranking treatments in network meta-analysis
- An Arnoldi-type algorithm for computing Page Rank
- On computing PageRank via lumping the Google matrix
- An Arnoldi-extrapolation algorithm for computing pagerank
- The extrapolation-accelerated multilevel aggregation method in PageRank computation
- Web Markov skeleton processes and their applications
- Discrete-time quantum walk algorithm for ranking nodes on a network
- Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
- A new extrapolation method for PageRank computations
- An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector
- The deformed graph Laplacian and its applications to network centrality analysis
- An efficient PageRank approach for urban traffic optimization
- Prediction of effective elastic moduli of rocks using graph neural networks
- Mean field analysis of personalized PageRank with implications for local graph clustering
- Multiplicative Approximations of Random Walk Transition Probabilities
- Practical acceleration for computing the HITS expertrank vectors
- Convergence of the Nelder-Mead method
- Fixed points of personalized PageRank centrality: from irreducible to reducible networks
- Userrank for item-based collaborative filtering recommendation
- An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank
This page was built for publication: Deeper Inside PageRank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4672754)