Scaling-limit conjecture for uniformly random graphic sequences

At least 2 years old · documented by

Let D1≥⋯≥DnD_1\ge\dotsb\ge D_n be a uniformly random graphic sequence of length nn. The scaling-limit conjecture. There exists a random continuous function D:[0,1]→RD:[0,1]\to\mathbb{R} such that

(n−1/2(D⌊tn⌋−(1−t)n),0≤t≤1)→d(Dt,0≤t≤1)\left(n^{-1/2}\big(D_{\lfloor tn\rfloor}-(1-t)n\big),0\le t\le 1\right)\overset{d}{\to}\left(D_t,0\le t\le 1\right)

in the uniform topology.

This conjecture proposes a functional scaling limit for fluctuations of a uniformly random graphic sequence around the deterministic profile (1−t)n(1-t)n. The source presents it as a direction for future work and does not identify the limiting process or establish the convergence.

References

Primary source

Paul Balister, Serte Donderwinkel, Carla Groenland, Tom Johnston and Alex Scott, “Counting graphic sequences via integrated random walks”, arXiv:2301.07022 (2024).

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.