Imagen de Portada

Revisiting Local PageRank Estimation on Undirected Graphs: Simple and Optimal

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Wang, Hanzhi
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Revisiting Local Computation of PageRank: Simple and Optimal
por: Wang, Hanzhi, et al.
Publicado: (2024)

Personalized PageRank Estimation in Undirected Graphs
por: Bertram, Christian, et al.
Publicado: (2026)

Instance-Optimality in PageRank Computation
por: Thorup, Mikkel, et al.
Publicado: (2025)

PageRank Centrality in Directed Graphs with Bounded In-Degree
por: Thorup, Mikkel, et al.
Publicado: (2025)

Efficient Algorithms for Personalized PageRank Computation: A Survey
por: Yang, Mingji, et al.
Publicado: (2024)

Dynamic PageRank: Algorithms and Lower Bounds
por: Jayaram, Rajesh, et al.
Publicado: (2024)

Near-Optimality for Single-Source Personalized PageRank
por: Jiang, Xinpeng, et al.
Publicado: (2025)

Approximating Single-Source Personalized PageRank with Absolute Error Guarantees
por: Wei, Zhewei, et al.
Publicado: (2024)

Sandpile Prediction on Undirected Graphs
por: Chang, Ruinian, et al.
Publicado: (2023)

Complexity of Classical Acceleration for $\ell_1$-Regularized PageRank
por: Fountoulakis, Kimon, et al.
Publicado: (2026)

Provably Extending PageRank-based Local Clustering Algorithm to Weighted Directed Graphs with Self-Loops and to Hypergraphs
por: Li, Zihao, et al.
Publicado: (2024)

Network Design on Undirected Series-Parallel Graphs
por: Bansal, Ishan, et al.
Publicado: (2024)

Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs
por: Fischer, Olivier, et al.
Publicado: (2025)

Approximate Graph Propagation Revisited: Dynamic Parameterized Queries, Tighter Bounds and Dynamic Updates
por: Zhao, Zhuowei, et al.
Publicado: (2025)

Estimating Random-Walk Probabilities in Directed Graphs
por: Bertram, Christian, et al.
Publicado: (2025)

A Simple Analysis of Ranking in General Graphs
por: Derakhshan, Mahsa, et al.
Publicado: (2025)

Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
por: Roditty, Liam, et al.
Publicado: (2026)

Simple and Optimal Sublinear Algorithms for Mean Estimation
por: Bertolotti, Beatrice, et al.
Publicado: (2024)

Undirected 3-Fault Replacement Path in Nearly Cubic Time
por: Chi, Shucheng, et al.
Publicado: (2024)

Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-offs and Algorithms
por: Roditty, Liam, et al.
Publicado: (2025)

Undirected Replacement Paths: Dual Fault Reduces to Single Source
por: Nogler, Jakob, et al.
Publicado: (2026)

Lossless Derandomization for Undirected Single-Source Shortest Paths and Approximate Distance Oracles
por: Yan, Shuyi
Publicado: (2025)

Optimal Dynamic Parameterized Subset Sampling
por: Gan, Junhao, et al.
Publicado: (2024)

Improved Bounds with a Simple Algorithm for Edge Estimation for Graphs of Unknown Size
por: Chanda, Debarshi
Publicado: (2025)

Maximal Palindromes in MPC: Simple and Optimal
por: Pissis, Solon P.
Publicado: (2025)

Static Retrieval Revisited: To Optimality and Beyond
por: Hu, Yang, et al.
Publicado: (2025)

Towards Optimal Robustness in Learning-Augmented Paging
por: Chen, Peng, et al.
Publicado: (2026)

Optimal Non-Adaptive Tolerant Junta Testing via Local Estimators
por: Nadimpalli, Shivam, et al.
Publicado: (2024)

Simple Realizability of Abstract Topological Graphs
por: Da Lozzo, Giordano, et al.
Publicado: (2024)

Mixing Time Matters: Accelerating Effective Resistance Estimation via Bidirectional Method
por: Cui, Guanyu, et al.
Publicado: (2025)

Revisiting Token Sliding on Chordal Graphs
por: Adak, Rajat, et al.
Publicado: (2025)

Non-Linear Paging
por: Doron-Arad, Ilan, et al.
Publicado: (2024)

Improved Approximation for Ranking on General Graphs
por: Derakhshan, Mahsa, et al.
Publicado: (2025)

Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
por: Chen, Daoyuan, et al.
Publicado: (2024)

Simple and Optimal Algorithms for Heavy Hitters and Frequency Moments in Distributed Models
por: Huang, Zengfeng, et al.
Publicado: (2025)

Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking
por: Chakraborty, Diptarka, et al.
Publicado: (2026)

New and Improved Bounds for Markov Paging
por: Pabbaraju, Chirag, et al.
Publicado: (2025)

Coloring 3-Colorable Graphs with Low Threshold Rank
por: Hsieh, Jun-Ting
Publicado: (2025)

Faster MAX-CUT on Bounded Threshold Rank Graphs
por: Anderson, Prashanti, et al.
Publicado: (2025)

Asymptotic Rank Speedup Theorems, Revisited
por: Alman, Josh, et al.
Publicado: (2026)