arXiv (All)
open access
Perfect sampling of Ising spin glasses with bounding chains
We study perfect sampling algorithms for Ising spin glasses based on coupling from the past and bounding chains, on several graph families and coupling distributions. For the single-site bounding chain, we establish coalescence in $O(n\log n)$ updates under Dobrushin conditions. On sparse random gra
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
- Phase Transitions in a Modified Ising Spin Glass Model: A Tensor-Network-based Sampling Approach#1402180
- Online Discrepancy of Sparse Random Vectors over Long Horizons#1457564
- The Phase Transitions in a $p$ spin Glass Model: A Numerical Study#1354883
- Upper and Lower Bounds on the Complexity of Unit-Distance Graph Realization in $\mathbb{Z}^d$#1467840
- Separating Field--Camp Alignment from Structural Balance in a Frustrated Random-Field Ising Model of Social Networks#1296585
Record · ID 1468904
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