Papers › First Passage Percolation with Queried Hints
First Passage Percolation with Queried Hints
Kritkorn Karntikoon, Yiheng Shen, Sreenivas Gollapudi, Kostas Kollias, Aaron Schild, Ali Sinop
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Solving optimization problems leads to elegant and practical solutions in a wide variety of real-world applications. In many of those real-world applications, some of the information required to specify the relevant optimization problem is noisy, uncertain, and expensive to obtain. In this work, we study how much of that information needs to be queried in order to obtain an approximately optimal solution to the relevant problem. In particular, we focus on the shortest path problem in graphs with dynamic edge costs. We adopt the first passage percolation model from probability theory wherein a graph G′ is derived from a weighted base graph G by multiplying each edge weight by an independently chosen random number in [1, ρ]. Mathematicians have studied this model extensively when G is a d-dimensional grid graph, but the behavior of shortest paths in this model is still poorly understood in general graphs. We make progress in this direction for a class of graphs that resemble real-world road networks. Specifically, we prove that if G has a constant continuous doubling dimension, then for a given s-t pair, we only need to probe the weights on ((ρlogn )/ ϵ)ᴼ⁽¹⁾ edges in G′ in order to obtain a (1 + ϵ)-approximation to the s-t distance in G′. We also generalize the result to a correlated setting and demonstrate experimentally that probing improves accuracy in estimating s-t distances.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections