arXiv (All)
open access
A Randomized Approximation Algorithm for Doubly Free-Boundary Macdonald Processes
We construct an approximate sampler for finite doubly free-boundary Macdonald rail-yard processes with Macdonald, boundary, and edge parameters in $(0,1)$. The construction allows arbitrary finite sequences of additions and removals of horizontal or vertical strips and all four boundary types. It re
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
- Higher-Order Fluctuations of the Log-Partition Function for Ising Models on Inhomogeneous Random Graphs#1156570
- Parallel Sampling from the Ising p-Spin Model / Nima Anari, Aniket Das, Alireza Haqi#1188554
- Narrow-band analysis of nonstationary processes#176886
- Active-Trace Complexity Bounds for Moreau--Yosida Unadjusted Langevin Sampling#451287
Record · ID 1344196
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