Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph

DOI10.1016/J.CAM.2010.02.001zbMath1215.05153OpenAlexW2041394874MaRDI QIDQ989118

Vivek S. Borkar, Danil Nemirovsky, Konstantin E. Avrachenkov

Publication date: 27 August 2010

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2010.02.001

zbMATH Keywords

directed graphquasi-stationary distributionpagerankcentrality measureweb graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81)

Related Items (4)

A generalized inverse for graphs with absorption ⋮ Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes ⋮ Quick Detection of Nodes with Large Degrees ⋮ Metastability in stochastic replicator dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral theory and limit theorems for geometrically ergodic Markov processes
• Inversion of Analytic Matrix Functions That are Singular at the Origin
• A Singular Perturbation Approach for Choosing the PageRank Damping Factor
• Generic Damping Functions for Propagating Importance in Link-Based Ranking
• Finite Continuous Time Markov Chains
• Quasi-stationary distributions and convergence to quasi-stationarity of birth-death processes
• Deeper Inside PageRank
• On Quasi-Stationary distributions in absorbing discrete-time finite Markov chains
• Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model
• Paradoxical Effects in PageRank Incremental Computations

This page was built for publication: Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph