Scaling limit of random recursive square subdivision
Statement
Start with a unit square and repeatedly choose a current square uniformly and subdivide it into four squares. Let be the minimum number of current squares in a connected set joining the bottom-left corner to the top-right corner after subdivisions. Does there exist a deterministic scaling function such that converges to a nondegenerate random variable? Does a shortest crossing stabilize under further subdivisions?
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.