ProbXiv
Explorersign in
Problem archiveProblem record

Statement

In a uniformly random spanning tree of a grid graph with NN vertices, we know the probability of having an exactly balanced split edge is at least 1N2\frac{1}{N^2}. Can we improve this to 1N\frac{1}{N}? Empirically, this seems like the right answer. It would suffice to extend the 1N2\frac{1}{N^2} lower bound to a neighborhood of other edges around the central edge.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.