Scaling-limit conjecture for affine preferential attachment looptrees

About 13 years old · traced to

Fix δ>−1\delta>-1, let SS be a finite tree, and let (Tn(S),δ)n≥∣S∣({T}^{(S),\delta}_n)_{n\geq |S|} be the affine preferential attachment tree sequence started from SS. Write Loop(T)\mathsf{Loop}(T) for the looptree associated with a tree TT.

Scaling-limit conjecture. There exists a random compact metric space Lδ(S)\mathcal{L}^{(S)}_{\delta} such that

n−12+δ⋅Loop(Tn(S),δ)⟶n→∞a.s.Lδ(S)n^{-\frac{1}{2+\delta}}\cdot\mathsf{Loop}(T^{(S),\delta}_n)\mathop{\longrightarrow}^{a.s.}_{n\to\infty}\mathcal{L}^{(S)}_{\delta}

holds almost surely for Gromov–Hausdorff convergence. Moreover, almost surely, the Hausdorff dimension of Lδ(S)\mathcal{L}^{(S)}_{\delta} is 2+δ2+\delta.

This predicts the scaling limit and dimension of the looptree associated with the affine preferential attachment tree. The statement is presented as a conjecture, and no proof or resolution is supplied in the source.

References

Primary source

Nicolas Curien, Thomas Duquesne, Igor Kortchemski and Ioan Manolescu, “Scaling limits and influence of the seed graph in preferential attachment trees”, arXiv:1406.1758 (2014).

Additional references

2 papers in this index state this conjecture (2013–2014). The statement above is taken from the most recent of them; the others are arXiv:1302.6727.

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.