Do peaks of random labelings repel each other?
Statement
Choose uniformly a bijective labeling of the vertices of the discrete square by , and call a vertex a peak when all adjacent vertices have lower labels. Condition on there being exactly two peaks, and let be their graph distance. Does converge in distribution to as ?
Record
- Source
- Added
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.