Imagen de Portada

Estimating Random-Walk Probabilities in Directed Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bertram, Christian, Jensen, Mads Vestergaard, Thorup, Mikkel, Wang, Hanzhi, Yan, Shuyi
Formato:	Preprint
Publicado:	2025
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

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)

Pivot based correlation clustering in the presence of good clusters
por: Lolck, David Rasmussen, et al.
Publicado: (2026)

Dynamic Meta-Kernelization
por: Bertram, Christian, et al.
Publicado: (2025)

Connectivity augmentation is fixed-parameter tractable
por: Korhonen, Tuukka, et al.
Publicado: (2026)

Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation
por: Narayanan, Shyam, et al.
Publicado: (2024)

Revisiting Local PageRank Estimation on Undirected Graphs: Simple and Optimal
por: Wang, Hanzhi
Publicado: (2024)

Combinatorial Correlation Clustering
por: Cohen-Addad, Vincent, et al.
Publicado: (2024)

Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
por: Jin, Wenyu, et al.
Publicado: (2024)

Hashing for Sampling-Based Estimation
por: Aamand, Anders, et al.
Publicado: (2024)

A Faster Algorithm for Constrained Correlation Clustering
por: Fischer, Nick, et al.
Publicado: (2025)

Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming
por: Kacham, Praneeth, et al.
Publicado: (2023)

Fully Dynamic Exact Edge Connectivity in Sublinear Time
por: Goranci, Gramoz, et al.
Publicado: (2023)

Solving the Correlation Cluster LP in Sublinear Time
por: Cao, Nairen, et al.
Publicado: (2025)

Static to Dynamic Correlation Clustering
por: Cao, Nairen, et al.
Publicado: (2025)

Faster All-Pairs Optimal Electric Car Routing
por: Dorfman, Dani, et al.
Publicado: (2025)

Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time
por: Huang, Shang-En, et al.
Publicado: (2016)

Fast Similarity Sketching
por: Dahlgaard, Søren, et al.
Publicado: (2017)

Online Metric TSP
por: Bertram, Christian
Publicado: (2025)

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

Enumerating m-Length Walks in Directed Graphs with Constant Delay
por: Adamson, Duncan, et al.
Publicado: (2024)

Better coloring of 3-colorable graphs
por: Kawarabayashi, Ken-ichi, et al.
Publicado: (2024)

ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
por: Zheng, Dehong, et al.
Publicado: (2025)

Expanderizing Higher Order Random Walks
por: Alev, Vedat Levi, et al.
Publicado: (2024)

DNF Learning via Locally Mixing Random Walks
por: Alman, Josh, et al.
Publicado: (2025)

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

ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting
por: Abrahamsen, Mikkel
Publicado: (2024)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
por: Mishra, Nina, et al.
Publicado: (2025)

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

FORWARD: Feasibility Oriented Random-Walk Inspired Algorithm for Radial Reconfiguration in Distribution Networks
por: Vendrell, Joan, et al.
Publicado: (2024)

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

Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries
por: Beretta, Lorenzo, et al.
Publicado: (2025)

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

Diameter Computation on (Random) Geometric Graphs
por: Bläsius, Thomas, et al.
Publicado: (2026)

Recovering Communities in Structured Random Graphs
por: Kapralov, Michael, et al.
Publicado: (2026)

Online Matching in Geometric Random Graphs
por: Sentenac, Flore, et al.
Publicado: (2023)

Edge-weighted Online Stochastic Matching Under Jaillet-Lu LP
por: Yan, Shuyi
Publicado: (2025)

Edge-weighted Online Stochastic Matching: Beating $1-\frac1e$
por: Yan, Shuyi
Publicado: (2022)

From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs
por: Chekuri, Chandra, et al.
Publicado: (2024)