Space requirements for distance estimates in sparse graphs

Researchers found new lower bounds for pivot-based approximate distance oracles.

Researchers studied approximate distance oracles (ADO). An ADO is a compact data structure that answers distance queries within a multiplicative stretch kk.

A pivot-based 11-hop ADO gives every vertex O~(1)\tilde{O}(1) pivots. It returns an estimate of the length of a walk u→pu→pv→vu\to p_u \to p_v \to v.

In this walk, pup_u is a pivot of uu and pvp_v is a pivot of vv. The distance pu→pvp_u\to p_v is a stored distance.

Under the Erdős girth conjecture for graphs with constant degree, every pivot-based 11-hop ADO with stretch kk requires Ω~(m1+2/(k+1))\widetilde{\Omega}(m^{1+2/(k+1)}) space. This result holds for every real k≥1k\ge1.

The result also extends to pivot-based ADOs with any constant number β\beta of hops. These require Ω~(m1+2/(β(k+1)))\widetilde{\Omega}(m^{1+2/(\beta(k+1))}) space.

Using high-girth graphs of Double Agent [doubleAI'26], unconditional versions of these ADO lower bounds are obtained. The exponent above 11 is multiplied by 4/54/5.

Key facts

  • Pivot-based 11-hop ADOs require Ω~(m1+2/(k+1))\widetilde{\Omega}(m^{1+2/(k+1)}) space under the Erdős girth conjecture.
  • The lower bound for pivot-based ADOs with β\beta hops is Ω~(m1+2/(β(k+1)))\widetilde{\Omega}(m^{1+2/(\beta(k+1))}).
  • Unconditional lower bounds using Double Agent [doubleAI'26] have an exponent multiplied by 4/54/5.

All sections

Edition