arXiv (All)
open access
Rapid mixing in unimodal landscapes and efficient simulatedannealing for multimodal distributions
We consider nearest neighbor weighted random walks on the $d$-dimensional box $[n]^d$ that are governed by some function $g:[0,1] \ra [0,\iy)$, by which we mean that standing at $x$, a neighbor $y$ of $x$ is picked at random and the walk then moves there with probability $(1/2)g(n^{-1}y)/(g(n^{-1}y)
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
- Tightness Analysis of First Passage Times of $d$-Dimensional Branching Random Walk#128311
- Local MixVR: Breaking the Communication-Sample Dependence in Distributed Learning#1143790
- Testing Bipartiteness in Logarithmic Rounds#1155230
- Accurate Sampling from Diffusion Models#1077973
- Higher-Order Gaussian Approximations on Path Space for the Simple Symmetric Exclusion Process#1297660
Record · ID 1217218
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