Answers are grounded in this paper and cite their sources.
Let Pₜ be the arboreal gas on the complete graph Kₙ: the probability measure on acyclic edge sets F proportional to t|F|. We prove that for every n and every $t>0$ any two distinct edges $e,f$ satisfy Pₜ(e,f∈ F)<Pₜ(e∈ F)\,Pₜ(f∈ F). The case $t=1$ is due to Gupta. For two edges sharing a vertex the inequality follows from the real-rootedness of the degree polynomial of a vertex, which is the characteristic polynomial of a rank-one perturbation of a Hermite Jacobi matrix. For disjoint edges the edge marginal satisfies an explicit Riccati equation, and the covariance is controlled by a barrier argument along it.
No takes yet. Share an insight, caveat, or question.
Yitzchak Shmalo (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: