Square DLA exponent conjecture

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.

Sources & referencesView supporting material

Primary source

Luis Fredes and Jean-Francois Marckert, “Models of random subtrees of a graph”, arXiv:2102.12738 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.