Fluctuations and efficient algorithms in first-passage percolation
Statement
For i.i.d. first-passage percolation on , prove or disprove that boundary fluctuations have a Tracy–Widom limit and that the variance of the passage time from to has order . Determine optimal computational bounds for finding a shortest path or estimating its length.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.