PageRank Nibble on the sparse directed stochastic block model

DOI10.1007/978-3-031-32296-9_10arXiv2303.06699OpenAlexW4376608067MaRDI QIDQ6057302

Mariana Olvera-Cravioto, Sayan Banerjee, Prabhanka Deka

Publication date: 4 October 2023

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

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

zbMATH Keywords

community detectionlocal weak convergencedirected stochastic block modelPageRank Nibble

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Internet topics (68M11)

Cites Work

• Consistency thresholds for the planted bisection model
• Reconstruction and estimation in the planted partition model
• An impossibility result for reconstruction in the degree-corrected stochastic block model
• Mean field analysis of personalized PageRank with implications for local graph clustering
• PageRank on inhomogeneous random digraphs
• Local weak convergence for PageRank
• PageRank's behavior under degree correlations
• A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
• Community detection thresholds and the weak Ramanujan property
• Local Partitioning for Directed Graphs Using PageRank

This page was built for publication: PageRank Nibble on the sparse directed stochastic block model