Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.01444 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913083584151552 |
|---|---|
| author | Tang, Pengfei Zhang, Zibo |
| author_facet | Tang, Pengfei Zhang, Zibo |
| contents | We uncover a close connection between the second moment of the degree of a typical vertex in a random subgraph and the pairwise negative correlation (p-NC) property. On one hand, we exploit this connection to prove the p-NC property for non-adjacent edges in minimal spanning trees on complete graphs. On the other hand, we apply the classical p-NC property of uniform spanning trees to derive a universal upper bound on the second moment of the degree of a uniformly chosen vertex in uniform spanning trees on finite, connected, regular graphs, thereby resolving an open question posed by Nachmias and Peres. Furthermore, we determine that the optimal upper bound is exactly 6, and the method for achieving this optimal bound is interesting in itself -- the proof uses Edmonds' matroid polytope theorem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_01444 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | From second moments to pairwise negative correlation: applications to minimal and uniform spanning trees Tang, Pengfei Zhang, Zibo Probability We uncover a close connection between the second moment of the degree of a typical vertex in a random subgraph and the pairwise negative correlation (p-NC) property. On one hand, we exploit this connection to prove the p-NC property for non-adjacent edges in minimal spanning trees on complete graphs. On the other hand, we apply the classical p-NC property of uniform spanning trees to derive a universal upper bound on the second moment of the degree of a uniformly chosen vertex in uniform spanning trees on finite, connected, regular graphs, thereby resolving an open question posed by Nachmias and Peres. Furthermore, we determine that the optimal upper bound is exactly 6, and the method for achieving this optimal bound is interesting in itself -- the proof uses Edmonds' matroid polytope theorem. |
| title | From second moments to pairwise negative correlation: applications to minimal and uniform spanning trees |
| topic | Probability |
| url | https://arxiv.org/abs/2605.01444 |