arXiv (OAI Expanded)
open access
Gaussian and non-Gaussian fluctuations in mean field stable matchings
Two sets of objects of size $n$ are to be matched to each other based on i.i.d.\ costs associated to every pair of objects. Objects prefer to be matched as cheaply as possible, and a matching is said to be stable if there is no pair of objects that would prefer to match to each other rather than to
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
- Synchronous Monte Carlo method and its application to a mean-field spin glass model#1143391
- Dropout Universality: Scaling Laws and Optimal Scheduling at the Edge-of-Chaos#1141547
- Gaussian Flow-Matching Schedules: Implications for Sampling and Training#1061467
- Gamma approximation and Poisson--Gaussian invariance principle on Poisson chaos#822535
- Low-Latency Out-of-Core ANN Search in High-Dimensional Space#168418
Record · ID 1069687
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