← All problems

Gaussian Wasserstein bound for instantaneous preferential-attachment triangle counts

Less than 1 year old · traced to

Fix m⩾2m\geqslant2 and δ>0\delta>0. Let TnT_n be the number of triangles in the instantaneous variant of the linear preferential attachment model, with connections specified by the instantaneous-attachment rule. Let Z∼N⁡(0,1)Z\sim\operatorname{N}(0,1), and write d⁡W\operatorname{d}_{\mathcal W} for the Wasserstein distance. Gaussian Wasserstein bound conjecture. One has

d⁡W(Tn−\mathdsE⁡TnVar⁡(Tn),Z)≲1log⁡n.\operatorname{d}_{\mathcal W}\left(\frac{T_n-\operatorname{\mathds{E}}T_n}{\sqrt{\operatorname{Var}(T_n)}},Z\right)\lesssim\frac{1}{\sqrt{\log n}}.

The conjecture gives a quantitative Gaussian approximation for triangle counts in the positive-offset instantaneous model. The surrounding discussion says that simulations are consistent with a Gaussian limit, while the precise limiting behavior and rate remain unproved.

References
  1. Partha S. Dey and Grigory Terlov, “Limiting distributions of triangle counts in linear preferential attachment models”, arXiv:2605.28776 (2026).

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.