Critical phase-transition conjecture for parking on a random tree

About 10 years old · traced to

Let NN be the offspring variable with mean λ=1\lambda=1, variance var⁡(N)≤1{\operatorname{var}(N)}\leq 1, and let PP be a nonnegative integer-valued parking variable whose distribution is stochastically increasing in its mean α=E[P]\alpha={\mathbb E}[P]. Assume var⁡(P)<∞{\operatorname{var}(P)}<\infty for every α≥0\alpha\geq 0, and define

h(α)=var⁡(P)+α2−α=E[P2]−α.h(\alpha)={\operatorname{var}(P)}+\alpha^2-\alpha={\mathbb E}[P^2]-\alpha.

Define

αc=inf⁡{α≥0:α=1−var⁡(N)h(α)}.\alpha_c=\inf\left\{\alpha\geq 0:\alpha=1-\sqrt{{\operatorname{var}(N)}h(\alpha)}\right\}.

Critical phase-transition conjecture. The expected number of cars that can leave the root, XX, satisfies

E[X]={1−α+αvar⁡(N)−(1−α)2−var⁡(N)h(α)var⁡(N)if α≤αc,∞if α>αc.{\mathbb E}[X]=\begin{cases}\displaystyle\frac{1-\alpha+\alpha\operatorname{var}(N)-\sqrt{(1-\alpha)^2-\operatorname{var}(N)h(\alpha)}}{\operatorname{var}(N)}&\text{if }\alpha\leq\alpha_c,\\[6pt]\infty&\text{if }\alpha>\alpha_c.\end{cases}

The conjecture predicts a phase transition at αc\alpha_c: the jump from finite to infinite expected root output coincides with the onset of long-range dependence, above which the occupied cluster of the root appears to occupy a positive fraction of the tree.

References

Primary source

Christina Goldschmidt and Michał Przykucki, “Parking on a random tree”, arXiv:1610.08786 (2017).

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.