Shortest routes in random proximity networks
Statement
For random proximity graphs on a planar Poisson point process, determine rigorous orders of magnitude for the transversal deviation of a shortest network route between points at Euclidean distance and for the variance of its route 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.