Reproduce “From Walks to Skeletons: A Reusable Transport Architecture for Interactive Monte Carlo PDE Solvers” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Yunfeng Liao, Yucheng Wu, Xiucheng Li

The transport skeleton reuses Walk-on-Spheres continuations in a persistent directed acyclic graph for repeated boundary solves. It uses bounded reweighting to attach query states and reevaluates changed boundary values from graph leaves. On a multi-object domain, an independent-path skeleton was 8.1× faster cumulatively after eight solves, including construction; attached evaluation excludes setup, and repair can fail for rare contributions.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.