arXiv (All)
open access
From second moments to pairwise negative correlation: applications to minimal and uniform spanning trees
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Distributed Statistical Zero-Knowledge Proofs via Sumcheck#187288
- Faster Minimum k-Cut II: Near-Optimal and Deterministic for Weighted Graphs#1064341
- Randomly perturbed digraphs also have bounded-degree spanning trees#206107
- Extremal Spanning Trees of Random Marked Graphs with Independent Edge Weights#1062064
- Faster Minimum k-Cut I: Simple and Sparse Weighted Graphs#1064325
Record · ID 1049819
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive