ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TDLA0(n,[0,+∞)2){\sf TDLA}_0(n,[0,+\infty)^2) be the square DLA tree with nn vertices, rooted at the corner c{\bf c}, and let v{\bf v} be a uniformly sampled vertex of the tree. Write w(tn)w(t_n) for its Euclidean width and dtn(c,v)d_{t_n}({\bf c},{\bf v}) for the graph distance from the root corner to v{\bf v}. The square DLA exponent conjecture. Both

w(tn)nαanddtn(c,v)nβ\frac{w(t_n)}{n^\alpha}\qquad\text{and}\qquad\frac{d_{t_n}({\bf c},{\bf v})}{n^\beta}

converge in distribution when α=β\alpha=\beta, for some α∈[0.55,0.61]\alpha\in[0.55,0.61]. The claim is an empirically motivated prediction for the common geometric and intrinsic scaling exponent of square DLA; the source reports simulations and no proof or resolution.

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.