Tightness of geodesic deviation in the hyperbolic Poisson–Voronoi graph
Let be the hyperbolic Poisson–Voronoi graph. For , consider a geodesic in connecting the Voronoi cells containing and , and let be the graph distance from this geodesic to the cell containing . Geodesic-deviation conjecture. The family of random variables is tight. This asks whether long graph geodesics between opposite points of the hyperbolic plane remain within a tight random distance of the cell containing the origin; it is presented as an open qualitative question about how geodesics in the tessellation compare with hyperbolic geodesics.
References
Primary source
Itai Benjamini, Elliot Paquette and Joshua Pfeffer, “Anchored expansion, speed, and the hyperbolic Poisson Voronoi tessellation”, arXiv:1409.4312 (2014).
Progress summary
No public source reports progress on whether long hyperbolic Poisson–Voronoi geodesics stay within a bounded random distance of the central cell.
The conjecture asks whether geodesics joining opposite points in the hyperbolic Poisson–Voronoi graph remain close to the cell containing the origin, uniformly as the endpoints recede. No public discussion or published result addressing this conjecture was found.
Current status (as of August 2026): The conjecture remains open, with no recorded progress or resolution.
Sources
- arxiv.org
- hal.science
- arxiv.org
- matteodachille.github.io
- geosto24.sciencesconf.org
- quantamagazine.org
- scientificamerican.com
- quantamagazine.org
- quantamagazine.org
- arxiv.org
- arxiv.org
- ar5iv.labs.arxiv.org
- ar5iv.labs.arxiv.org
- ar5iv.labs.arxiv.org
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- quantamagazine.org
- scientificamerican.com
- arxiv.org
- mdpi.com
- arxiv.org
- arxiv.org
- mathstodon.xyz
- community.openai.com
- cdn.openai.com
- cdn.openai.com
Solutions 0
No solutions have been posted yet.