Structure of geodesics · Question 4.1
First passage percolation · AIMPL workshop record
Editorial mapping of AIMPL source category: Probability. http://aimpl.org/firstpercolation/ Not an author-supplied MSC code.
Problem statement
Does as ?
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
Workshop introduction
This is a summary of the set of problems discussed at the AIM workshop on first-passage percolation and related models in August 2015. The name of the person who raised the question at the workshop is mentioned within parenthesis for each problem.
In first-passage percolation the edges of the nearest neighbor lattice is equipped with non-negative random weights , which are usually assumed to be i.i.d. The resulting weighted graph induces a metric on , and it is understanding the large-scale behavior of distances, balls and geodesics in this random metric space which is the primary objective. See Source citation: arXiv:1511.03262 for an extensive recent survey.
Section context
The following is a list of problems related to the structure of large finite and infinite geodesics. Most work in this direction has been made in the case , so unless where stated otherwise, these problems should primarily be thought of as in two dimensions. We below let denote the geodesic between two points and .
Question context
Above, the question was raised regarding the possible existence of bigeodesics. The following question is a weaker version of that conjecture and concerns the probability that the geodesic between two far away points visit a given point midway between the two. The question has come to be known as the `midpoint problem', and originates from Benjamini, Kalai and Schramm Source citation: MR2016607.
Progress & source assessment
Dated source record, inspected 2026-09-10. Source reports a solution for a large class of two-dimensional models; broader scope is not certified. Source-reported results have not been independently verified.
Status note in the source
The problem has been solved by Ahlberg and Hoffman Source citation: arXiv:1609.02447 for a large class of first-passage percolation models on .
- [1]First passage percolation · Original question link
- [2]AIMPL source bibliography link
- [3]AIMPL text license · CC BY-SA 3.0 linkAIM Problem Lists (AIMPL), original contributors; CC BY-SA 3.0. Adaptation: structural TeX converted to Markdown, documented source macros expanded, and source bibliography links added. Mathematical wording retained. These adapted source texts remain under CC BY-SA 3.0.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.