Perfect simulation for the Feynman-Kac law on the path space
classification
🧮 math.PR
math.STstat.TH
keywords
algorithmbetterboundscomplexitydescribesdescripitionfeynman-kacgetting
read the original abstract
This paper describes an algorithm of interest. This is a preliminary version and we intend on writing a better descripition of it and getting bounds for its complexity.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.