arXiv (All)
open access
Random Matching Between Distinct Distributions in Two Dimensions
Given two independent $n$-point samples drawn from possibly distinct probability distributions on a compact 2-dimensional surface, we minimize the total squared distance over all perfect bipartite matchings. Under regularity assumptions, the expected matching cost minus $n$ times the squared 2-Wasse
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
- Degree-Parameterized Analysis of Sampling-Based Online Matching#1083917
- Dynamic Directed Random Matching#21611
- Blue Noise as a Lattice Gibbs Ensemble#1199942
- Confidence-Based Surface Prior for Energy-Minimization Stereo Matching#300573
- Random bipartite graphs with i.i.d. weights and applications to inhomogeneous random intersection graphs#1130446
Record · ID 1492117
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