PageRank in Undirected Random Graphs

DOI10.1007/978-3-319-26784-5_12zbMath1342.05131arXiv1511.04925OpenAlexW3098153061MaRDI QIDQ3460746

Arun Kadavankandy, Liudmila Ostroumova Prokhorenkova, Konstantin E. Avrachenkov, Andrei M. Raigorodskii

Publication date: 8 January 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

expander graphsPageRankChung-Lu random graphsundirected random graphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11)

Related Items

Local weak convergence for PageRank ⋮ On the independence number and the chromatic number of generalized preferential attachment models ⋮ Mean field analysis of personalized PageRank with implications for local graph clustering

This page was built for publication: PageRank in Undirected Random Graphs