arXiv (All)
open access
Spatial Mixing and Deterministic Approximate Counting of Multi-spin Systems beyond Bounded Degree Graphs
We develop a framework for deterministic approximate counting of multi-spin systems beyond bounded-degree graphs. The algorithm recursively constructs rational polytopes containing the true marginal vectors and uses linear-fractional programming to obtain certified bounds on marginal ratios. For pos
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
- Strategyproof Aggregation in Euclidean Spaces: Rigidity and Median Optimality#1013989
- Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport#794105
- Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport#790086
- Stable Voting Rules on the Edge of Optimal Metric Distortion#985630
- Bang vectors in the real polarization problem: The exact dimensional range#819125
Record · ID 1000308
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