Finite-torus approximation conjecture for the DLA tree

Let TDLA0(n,Torus(nc)){\sf TDLA}_0(n,{ \sf Torus}(n^c)) denote the finite-graph DLA tree with nn vertices rooted at 00, and let dlan{\bf dla}_n denote the standard DLA tree with nn vertices. The finite-torus DLA conjecture. There \exists C(1/2,1)C\in(1/2,1) such that, for every c>Cc>C,

Dvar(TDLA0(n,Torus(nc)),dlan)n+0,D_{\sf var}\left({\sf TDLA}_0(n,{ \sf Torus}(n^c)),{\bf dla}_n\right)\mathop{\longrightarrow}_{n\to+\infty}0,

where DvarD_{\sf var} is total variation distance. The conjecture asserts that a sufficiently large polynomial torus reproduces the law of the standard planar DLA tree; the source gives 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.