PageRank beyond the web
DOI10.1137/140976649zbMATH Open1336.05122arXiv1407.5107OpenAlexW2964164193WikidataQ56815224 ScholiaQ56815224MaRDI QIDQ2808253FDOQ2808253
Authors: 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
Recommendations
Programming involving graphs or networks (90C35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Social networks; opinion dynamics (91D30) Systems biology, networks (92C42) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Theory of matrix inversion and generalized inverses (15A09) Iterative numerical methods for linear systems (65F10) Matrix exponential and similar functions of matrices (15A16) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Applications of graph theory to circuits and networks (94C15) Numerical computation of matrix exponential and similar matrix functions (65F60)
Cites Work
- The university of Florida sparse matrix collection
- Network properties revealed through matrix functions
- Title not available (Why is that?)
- Graph clustering
- 10.1162/jmlr.2003.3.4-5.993
- A new status index derived from sociometric analysis
- Eigenvalues of the Laplacian of a graph∗
- Title not available (Why is that?)
- Title not available (Why is that?)
- Who's \#1? The science of rating and ranking
- Authoritative sources in a hyperlinked environment
- Title not available (Why is that?)
- Deeper Inside PageRank
- Approximating Personalized PageRank with Minimal Use of Web Graph Data
- Network Analysis
- Automata, Languages and Programming
- Laplacians and the Cheeger inequality for directed graphs
- Title not available (Why is that?)
- Ranking hubs and authorities using matrix functions
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Title not available (Why is that?)
- Google's PageRank and beyond. The science of search engine rankings
- A Survey on PageRank Computing
- The centrality index of a graph
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
- An inner-outer iteration for computing PageRank
- Social influence and opinions
- An Arnoldi-type algorithm for computing Page Rank
- Towards Google matrix of brain
- Random alpha PageRank
- Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
- A combined approach for evaluating papers, authors and scientific journals
- Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization
- Ordinal Ranking for Google's PageRank
- A dynamical systems view of network centrality
- Googling the brain: discovering hierarchical and asymmetric network structures, with applications in neuroscience
- The Perron–Frobenius Theorem and the Ranking of Football Teams
- Dynamical systems, graphs, and algorithms
- A General Setting for the Parametric Google Matrix
- Multilinear PageRank
- Google PageRank as mean playing time for pinball on the reverse web
- Title not available (Why is that?)
- Generic Damping Functions for Propagating Importance in Link-Based Ranking
- Fast PageRank Computation via a Sparse Linear System
- Title not available (Why is that?)
- Random Walker Ranking for NCAA Division I-A Football
- Title not available (Why is that?)
- Distribution of PageRank Mass Among Principle Components of the Web
- Traffic modelling framework for electric vehicles
- Improving random walk estimation accuracy with uniform restarts
- PageRank of integers
- A Two-Stage Algorithm for Computing PageRank and Multistage Generalizations
- Traps and Pitfalls of Topic-Biased PageRank
- Dirichlet PageRank and trust-based ranking algorithms
- A Dynamical System for PageRank with Time-Dependent Teleportation
Cited In (only showing first 100 items - show all)
- Opinion Dynamics and Social Power Evolution over Reducible Influence Networks
- Pagerank asymptotics on directed preferential attachment networks
- Contagion Source Detection in Epidemic and Infodemic Outbreaks: Mathematical Analysis and Network Algorithms
- Random walks on complex networks under node-dependent stochastic resetting
- A modified Newton method for multilinear PageRank
- Non-backtracking PageRank
- Tensor-based mathematical framework and new centralities for temporal multilayer networks
- A Hessenberg-type algorithm for computing PageRank problems
- Variational perspective on local graph clustering
- Random walks and diffusion on networks
- The mathematics of non-linear metrics for nested networks
- Off-diagonal low-rank preconditioner for difficult PageRank problems
- Synchronization of heterogeneous oscillators under network modifications: perturbation and optimization of the synchrony alignment function
- Ranking nodes in general networks: a Markov multi-chain approach
- Adaptive nonnegative matrix factorization and measure comparisons for recommender systems
- Subgraph centrality and walk-regularity
- Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems
- Perturbed Markov chains with damping component
- Explaining social events through community evolution on temporal networks
- Ordinal Ranking for Google's PageRank
- A stochastic method for exploiting outranking relations in multicriteria choice problems
- Non-backtracking PageRank: from the classic model to Hashimoto matrices
- On the spectrum of two-layer approach and multiplex PageRank
- Network analysis and modelling: Special issue ofEuropean Journal of Applied Mathematics
- 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
- The science of science: from the perspective of complex systems
- Localization in Matrix Computations: Theory and Applications
- Ranking in evolving complex networks
- Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors
- Analysis of directed networks via the matrix exponential
- A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph
- Eigenvector-Based Centrality Measures for Temporal 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
- Coupling and ergodic theorems for Markov chains with damping component
- Opinion dynamics and the evolution of social power in influence networks
- Google's PageRank and beyond. The science of search engine rankings
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- An efficient elimination strategy for solving PageRank problems
- Using PageRank for non-personalized default rankings in dynamic markets
- Pattern Formation and Oscillations in Nonlinear Random Walks on Networks
- The work of Jon Kleinberg
- Mixing time of PageRank surfers on sparse random digraphs
- Dynamics of nonlinear random walks on complex networks
- A new extrapolation method for PageRank computations
- Dynamic Competition Networks: Detecting Alliances and Leaders
- A new decision making model based on rank centrality for GDM with fuzzy preference relations
- Coevolutionary systems and PageRank
- A preprocessed multi-step splitting iteration for computing PageRank
- Fast computation of stationary joint probability distribution of sparse Markov chains
- Scalable Algorithms for Multiple Network Alignment
- Mining community-level influence in microblogging network: a case study on Sina Weibo
- Three Hypergraph Eigenvector Centralities
- Search optimization, funnel topography, and dynamical criticality on the string landscape
- Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian
- Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank
- Dynamical systems associated with adjacency matrices
- Black hole metric: overcoming the PageRank normalization problem
- Multilinear PageRank
- A continuum limit for the PageRank algorithm
- Deeper Inside PageRank
- Cascading failures in interdependent directed networks under localized attacks
- Green, resilient, and inclusive supplier selection using enhanced BWM-TOPSIS with scenario-varying Z-numbers and reversed PageRank
- A measure of centrality based on a reciprocally perturbed Markov chainfor asymmetric relations
- Influence maximization in social networks using role-based embedding
- Network Capacity Bound for Personalized PageRank in Multimodal Networks
- Tunable Eigenvector-Based Centralities for Multiplex and Temporal Networks
- Ranking edges by their impact on the spectral complexity of information diffusion over networks
- Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems
- Axiomatic characterization of PageRank
- Applications of Page Ranking in P Systems
- Centrality Analysis for Modified Lattices
- Transitions between quasi-stationary states in traffic systems: cologne orbital motorways as an example
- Optimal Transport for Parameter Identification of Chaotic Dynamics via Invariant Measures
- Classical and Quantum Random-Walk Centrality Measures in Multilayer Networks
- Title not available (Why is that?)
- What Are Higher-Order Networks?
- Stochastic recursions on directed random graphs
- A framework for second-order eigenvector centralities and clustering coefficients
- Sublinear Algorithms for Local Graph-Centrality Estimation
- Walks: A Beginner's Guide to Graphs and Matrices
- Dynamic PageRank using evolving teleportation
- Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph
- Assigning stationary distributions to sparse stochastic matrices
- Red light green light method for solving large Markov chains
- A parallel pagerank algorithm for undirected graph
- Branching processes reveal influential nodes in social networks
- Two accelerated non-backtracking PageRank algorithms for large-scale networks
- A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings
- Prediction of asymptomatic COVID‐19 infections based on complex network
- A general higher-order supracentrality framework based on motifs of temporal networks and multiplex networks
- On new PageRank computation methods using quantum computing
- Extrapolation methods for multilinear PageRank
- Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions
- On the initial value of PageRank
- Supracentrality analysis of temporal networks with directed interlayer coupling
- Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks
- Verified correctness, accuracy, and convergence of a stationary iterative linear solver: Jacobi method
Uses Software
This page was built for publication: PageRank beyond the web
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808253)