arXiv (All)
open access
Variance Bounds for Minimum Perfect Matching Problem by Random Walk on Multinomial Distribution
We establish variance upper bounds for the minimum perfect matching problem in general metric spaces under a geometric partition condition. As a principal application, let $H_n$ be the minimum perfect matching cost of $n$ independent uniform points in $[0,1]^d$, where $n$ is even and $d\ge2$. We pro
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
- Perfect Matching in Product Graphs and in their Random Subgraphs#821390
- Discrete total variation under the multinomial, Part~1: expectation under the uniform null#1297718
- A Sharp Small-Coefficient Variant of Khintchine's Inequality and the Sharp $π/2$ Theorem#796925
- Permutations from ranking independent random variables#1249175
- A maximum matching based refinement of Brouwers conjecture#1070156
Record · ID 1324938
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