Stable star marginals and strict edge correlations for random forests
Loading original first page…
Abstract
For the unrooted spanning-forest measure on any finite simple graph with arbitrary positive edge weights, we prove real stability of the full incident-edge marginal at every vertex. Thus each star is strongly Rayleigh, incident edges are nonpositively correlated, and every vertex degree has a Poisson-binomial law. The proof identifies a classical optional-component-mark forest polynomial with a stable determinant differential operator applied to a signed matching polynomial. We also prove strict pairwise negative edge correlation on every complete graph K_N, N ≥ 3, and complete bipartite graph K_(m,n), m,n ≥ 2, at every common positive fugacity. Their disjoint-edge proofs use exact Hermite and Laguerre counts, continued fractions and scalar crossing barriers, with complete exact polynomial certificates. Quantitative bipartite critical and supercritical deficit asymptotics are also established, with explicit critical-profile endpoint and supercritical matching coefficient. Empty forests and isolated vertices are included.
Read the full paper in the original PDF.
Edition files
- Paper.pdf204.2 KiB · pdf
SHA-256
340998d704e45534147da12237b2538b5686ed4bd4e74bcdda86c0f457a9df27 - Publication_Package.zip392.1 KiB · package
SHA-256
9b7c97077031eeaf3d33e3bdda81fc97e71d6340acc952d2511cd844363be7b8
Available editions
Research details
- Subjects
- Mathematics · Combinatorics and Graph Theory · Probability and Statistics
- Keywords
- random forests, real stable polynomials, negative dependence, Poisson-binomial laws, arboreal gas
- Manuscript date
- 2026-10-23
- Reader reuse
- none
Scope
For the unrooted spanning-forest measure on any finite simple graph with arbitrary positive edge weights, we prove real stability of the full incident-edge marginal at every vertex.
Disclosures
AI-assisted tools supported research exploration, literature discovery, manuscript preparation and exact verification code. The author is responsible for the mathematical arguments and supporting computations.
Reproduction
Complete searchable manuscript and 23-member source package with editable sources and necessary reader-facing verification material. Build instructions and computational scope are stated in the package; proofs are given in the manuscript.