pith. sign in

arxiv: 1210.0376 · v2 · pith:DICG6ZNWnew · submitted 2012-10-01 · 🧮 math.PR · math.ST· stat.TH

Perfect simulation for the Feynman-Kac law on the path space

classification 🧮 math.PR math.STstat.TH
keywords algorithmbetterboundscomplexitydescribesdescripitionfeynman-kacgetting
0
0 comments X
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.