PageRank beyond the web
From MaRDI portal
Publication:2808253
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)
Abstract: Google's PageRank method was developed to evaluate the importance of web-pages via their link structure. The mathematics of PageRank, however, are entirely general and apply to any graph or network in any domain. Thus, PageRank is now regularly used in bibliometrics, social and information network analysis, and for link prediction and recommendation. It's even used for systems analysis of road networks, as well as biology, chemistry, neuroscience, and physics. We'll see the mathematics and ideas that unite these diverse applications.
Recommendations
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 5798606 (Why is no real title available?)
- scientific article; zbMATH DE number 729460 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 5937963 (Why is no real title available?)
- scientific article; zbMATH DE number 6276186 (Why is no real title available?)
- scientific article; zbMATH DE number 5032032 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- 10.1162/jmlr.2003.3.4-5.993
- A Dynamical System for PageRank with Time-Dependent Teleportation
- A General Setting for the Parametric Google Matrix
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
- A Survey on PageRank Computing
- A Two-Stage Algorithm for Computing PageRank and Multistage Generalizations
- A combined approach for evaluating papers, authors and scientific journals
- A dynamical systems view of network centrality
- A new status index derived from sociometric analysis
- An Arnoldi-type algorithm for computing Page Rank
- An inner-outer iteration for computing PageRank
- Approximating Personalized PageRank with Minimal Use of Web Graph Data
- Authoritative sources in a hyperlinked environment
- Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization
- Automata, Languages and Programming
- Deeper Inside PageRank
- Dirichlet PageRank and trust-based ranking algorithms
- Distribution of PageRank Mass Among Principle Components of the Web
- Dynamical systems, graphs, and algorithms
- Eigenvalues of the Laplacian of a graph∗
- Fast PageRank Computation via a Sparse Linear System
- Generic Damping Functions for Propagating Importance in Link-Based Ranking
- Google PageRank as mean playing time for pinball on the reverse web
- Google's PageRank and beyond. The science of search engine rankings
- Googling the brain: discovering hierarchical and asymmetric network structures, with applications in neuroscience
- Graph clustering
- Improving random walk estimation accuracy with uniform restarts
- Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
- Laplacians and the Cheeger inequality for directed graphs
- Multilinear PageRank
- Network Analysis
- Network properties revealed through matrix functions
- Ordinal Ranking for Google's PageRank
- PageRank of integers
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Random Walker Ranking for NCAA Division I-A Football
- Random alpha PageRank
- Ranking hubs and authorities using matrix functions
- Social influence and opinions
- The Perron–Frobenius Theorem and the Ranking of Football Teams
- The University of Florida sparse matrix collection
- The centrality index of a graph
- Towards Google matrix of brain
- Traffic modelling framework for electric vehicles
- Traps and Pitfalls of Topic-Biased PageRank
- Who's \#1? The science of rating and ranking
Cited in
(only showing first 100 items - show all)- Search optimization, funnel topography, and dynamical criticality on the string landscape
- Dynamical systems associated with adjacency matrices
- Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank
- Black hole metric: overcoming the PageRank normalization problem
- Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks
- Multilinear PageRank
- Supracentrality analysis of temporal networks with directed interlayer coupling
- A continuum limit for the PageRank algorithm
- Walks: a beginner's guide to graphs and matrices
- A residual-based error bound for the multilinear PageRank vector
- Verified correctness, accuracy, and convergence of a stationary iterative linear solver: Jacobi method
- Multi-linear pseudo-PageRank for hypergraph partitioning
- Deeper Inside PageRank
- Seeded PageRank solution paths
- Cascading failures in interdependent directed networks under localized attacks
- An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs
- Reducing classifier overconfidence against adversaries through graph algorithms
- Green, resilient, and inclusive supplier selection using enhanced BWM-TOPSIS with scenario-varying Z-numbers and reversed PageRank
- Pagerank asymptotics on directed preferential attachment networks
- Localization in matrix computations: theory and applications
- 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
- Influence maximization in social networks using role-based embedding
- A Hessenberg-type algorithm for computing PageRank problems
- Variational perspective on local graph clustering
- Network Capacity Bound for Personalized PageRank in Multimodal Networks
- Random walks and diffusion on networks
- The mathematics of non-linear metrics for nested networks
- Off-diagonal low-rank preconditioner for difficult PageRank problems
- Ranking nodes in general networks: a Markov multi-chain approach
- Synchronization of heterogeneous oscillators under network modifications: perturbation and optimization of the synchrony alignment function
- Adaptive nonnegative matrix factorization and measure comparisons for recommender systems
- Scalable algorithms for multiple network alignment
- Ranking edges by their impact on the spectral complexity of information diffusion over networks
- Subgraph centrality and walk-regularity
- Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems
- Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
- Axiomatic characterization of PageRank
- A search for champion boxers
- Three hypergraph eigenvector centralities
- 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
- Applications of Page Ranking in P Systems
- On the spectrum of two-layer approach and multiplex PageRank
- Non-backtracking PageRank: from the classic model to Hashimoto matrices
- PageRank as a discrete Green's function
- A stochastic method for exploiting outranking relations in multicriteria choice problems
- The science of science: from the perspective of complex systems
- 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
- Network analysis and modelling: Special issue ofEuropean Journal of Applied Mathematics
- Transitions between quasi-stationary states in traffic systems: cologne orbital motorways as an example
- Ranking in evolving complex networks
- Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors
- Opinion dynamics and social power evolution over reducible influence networks
- 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
- Optimal Transport for Parameter Identification of Chaotic Dynamics via Invariant Measures
- Classical and Quantum Random-Walk Centrality Measures in Multilayer 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
- Weighted graph vertices ranking using absolute potentials of electric circuit nodes
- scientific article; zbMATH DE number 2242727 (Why is no real title available?)
- Coupling and ergodic theorems for Markov chains with damping component
- A framework for second-order eigenvector centralities and clustering coefficients
- What Are Higher-Order Networks?
- A measure of centrality based on a reciprocally perturbed Markov chain for asymmetric relations
- Stochastic recursions on directed random graphs
- On the relationship between PageRank and automorphisms of a graph
- Sublinear Algorithms for Local Graph-Centrality Estimation
- Opinion dynamics and the evolution of social power in influence networks
- An efficient elimination strategy for solving PageRank problems
- Using PageRank for non-personalized default rankings in dynamic markets
- Google's PageRank and beyond. The science of search engine rankings
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- Tunable eigenvector-based centralities for multiplex and temporal networks
- Dynamic PageRank using evolving teleportation
- Pattern Formation and Oscillations in Nonlinear Random Walks on Networks
- The work of Jon Kleinberg
- Dynamics of nonlinear random walks on complex networks
- Determining polyhedral arrangements of atoms using PageRank
- Mixing time of PageRank surfers on sparse random digraphs
- Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph
- A new extrapolation method for PageRank computations
- An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector
- Assigning stationary distributions to sparse stochastic matrices
- Red light green light method for solving large Markov chains
- A new decision making model based on rank centrality for GDM with fuzzy preference relations
- Dynamic Competition Networks: Detecting Alliances and Leaders
- Eigenvector-based centrality measures for temporal networks
- 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
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)
