Finite-torus approximation conjecture for the DLA tree
Finite-torus approximation conjecture for the DLA tree
Let denote the finite-graph DLA tree with vertices rooted at , and let denote the standard DLA tree with vertices. The finite-torus DLA conjecture. There \exists such that, for every ,
where 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
Sign in to submit a solution.
No solutions have been posted yet.