PageRank Beyond the Web

DOI10.1137/140976649zbMath1336.05122arXiv1407.5107WikidataQ56815224 ScholiaQ56815224MaRDI QIDQ2808253

David F. Gleich

Publication date: 20 May 2016

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.5107

zbMATH Keywords

Markov chain; PageRank

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

91D30: Social networks; opinion dynamics

05C82: Small world graphs, complex networks (graph-theoretic aspects)

15A09: Theory of matrix inversion and generalized inverses

68R10: Graph theory (including graph drawing) in computer science

90B10: Deterministic network models in operations research

60J10: Markov chains (discrete-time Markov processes on discrete state spaces)

65F10: Iterative numerical methods for linear systems

92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)

94C15: Applications of graph theory to circuits and networks

92C42: Systems biology, networks

15A16: Matrix exponential and similar functions of matrices

65F60: Numerical computation of matrix exponential and similar matrix functions

Related Items

Centrality Analysis for Modified Lattices, Network analysis and modelling: Special issue ofEuropean Journal of Applied Mathematics, Seeded PageRank solution paths, Scalable Algorithms for Multiple Network Alignment, Three Hypergraph Eigenvector Centralities, Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph, A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph, A continuum limit for the PageRank algorithm, Search optimization, funnel topography, and dynamical criticality on the string landscape, Random walks on complex networks under node-dependent stochastic resetting, A measure of centrality based on a reciprocally perturbed Markov chainfor asymmetric relations, Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian, Tunable Eigenvector-Based Centralities for Multiplex and Temporal Networks, Walks: A Beginner's Guide to Graphs and Matrices, A framework for second-order eigenvector centralities and clustering coefficients, A residual-based error bound for the multilinear PageRank vector, Opinion Dynamics and Social Power Evolution over Reducible Influence Networks, Eigenvector-Based Centrality Measures for Temporal Networks, Dynamic Competition Networks: Detecting Alliances and Leaders, Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance, Optimal Transport for Parameter Identification of Chaotic Dynamics via Invariant Measures, Classical and Quantum Random-Walk Centrality Measures in Multilayer Networks, Pattern Formation and Oscillations in Nonlinear Random Walks on Networks, Mixing time of PageRank surfers on sparse random digraphs, Prediction of asymptomatic COVID‐19 infections based on complex network, Sublinear Algorithms for Local Graph-Centrality Estimation, Network Capacity Bound for Personalized PageRank in Multimodal Networks, A parallel pagerank algorithm for undirected graph, A stochastic method for exploiting outranking relations in multicriteria choice problems, What Are Higher-Order Networks?, Reducing classifier overconfidence against adversaries through graph algorithms, Cascading failures in interdependent directed networks under localized attacks, Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems, Axiomatic characterization of PageRank, A new extrapolation method for PageRank computations, On the spectrum of two-layer approach and multiplex PageRank, The mathematics of non-linear metrics for nested networks, Off-diagonal low-rank preconditioner for difficult PageRank problems, Dynamical systems associated with adjacency matrices, Fast computation of stationary joint probability distribution of sparse Markov chains, The science of science: from the perspective of complex systems, Random walks and diffusion on networks, Mining community-level influence in microblogging network: a case study on Sina Weibo, An efficient elimination strategy for solving PageRank problems, Variational perspective on local graph clustering, Ranking nodes in general networks: a Markov multi-chain approach, Using PageRank for non-personalized default rankings in dynamic markets, Flexible and deflated variants of the block shifted GMRES method, A modified Newton method for multilinear PageRank, Tensor-based mathematical framework and new centralities for temporal multilayer networks, Adaptive nonnegative matrix factorization and measure comparisons for recommender systems, A new decision making model based on rank centrality for GDM with fuzzy preference relations, Pagerank asymptotics on directed preferential attachment networks, A Hessenberg-type algorithm for computing PageRank problems, Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank, Black hole metric: overcoming the PageRank normalization problem, Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems, Non-backtracking PageRank: from the classic model to Hashimoto matrices, Perturbed Markov chains with damping component, Explaining social events through community evolution on temporal networks, Convergence of two-stage iterative scheme for \(K\)-weak regular splittings of type II, Algorithmic bias amplification via temporal effects: the case of PageRank in evolving networks, Coevolutionary systems and PageRank, Dynamics of nonlinear random walks on complex networks, Non-backtracking PageRank, A preprocessed multi-step splitting iteration for computing PageRank, On the convergence of the minimally irreducible Markov chain method with applications to PageRank, Ranking in evolving complex networks, Subgraph centrality and walk-regularity, Analysis of directed networks via the matrix exponential, Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors, Red light green light method for solving large Markov chains, A general higher-order supracentrality framework based on motifs of temporal networks and multiplex networks, On new PageRank computation methods using quantum computing, Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks, Opinion Dynamics and the Evolution of Social Power in Influence Networks, Synchronization of Heterogeneous Oscillators Under Network Modifications: Perturbation and Optimization of the Synchrony Alignment Function, Localization in Matrix Computations: Theory and Applications, Coupling and ergodic theorems for Markov chains with damping component, Multilinear PageRank

Uses Software

• SparseMatrix
• TwitterRank
• SimRank
• GeneRank
• moleculaRnetworks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards Google matrix of brain
• Graph clustering
• Google PageRank as mean playing time for pinball on the reverse web
• An Arnoldi-type algorithm for computing Page Rank
• A combined approach for evaluating papers, authors and scientific journals
• Laplacians and the Cheeger inequality for directed graphs
• Ranking hubs and authorities using matrix functions
• Dynamical systems, graphs, and algorithms
• The centrality index of a graph
• A new status index derived from sociometric analysis
• Googling the Brain: Discovering Hierarchical and Asymmetric Network Structures, with Applications in Neuroscience
• The university of Florida sparse matrix collection
• Dirichlet PageRank and Trust-Based Ranking Algorithms
• Network Properties Revealed through Matrix Functions
• Improving Random Walk Estimation Accuracy with Uniform Restarts
• Random Alpha PageRank
• An Inner-Outer Iteration for Computing PageRank
• Authoritative sources in a hyperlinked environment
• PageRank of integers
• Social influence and opinions
• Multilinear PageRank
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• A General Setting for the Parametric Google Matrix
• Generic Damping Functions for Propagating Importance in Link-Based Ranking
• Traps and Pitfalls of Topic-Biased PageRank
• Ordinal Ranking for Google's PageRank
• Eigenvalues of the Laplacian of a graph^∗
• A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
• 10.1162/jmlr.2003.3.4-5.993
• Deeper Inside PageRank
• A Dynamical System for PageRank with Time-Dependent Teleportation
• The Perron–Frobenius Theorem and the Ranking of Football Teams
• A dynamical systems view of network centrality
• Approximating Personalized PageRank with Minimal Use of Web Graph Data
• Random Walker Ranking for NCAA Division I-A Football
• Distribution of PageRank Mass Among Principle Components of the Web
• Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization
• Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
• Fast PageRank Computation via a Sparse Linear System
• A Survey on PageRank Computing
• Network Analysis
• Automata, Languages and Programming
• Traffic modelling framework for electric vehicles
• A Two-Stage Algorithm for Computing PageRank and Multistage Generalizations