{"paper_id":"2407.17151","title":"High order approximations and simulation schemes for the log-Heston process","authors":["Aurélien Alfonsi","Edoardo Lombardo"],"paper_date":"2024-07-24","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2407.17151v2","page_url":"https://thequant.space/flowcharts/high-order-approximations-and-simulation-schemes-for-the-log/","scores":{"empirical_rigor":4,"math_complexity":9.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes weak approximation schemes of arbitrary order for the Heston model using random grid boosting combined with the Ninomiya‑Victoir scheme or an exact volatility sampler.","quote":"We present weak approximations schemes of any order for the Heston model that are obtained by using the method developed by Alfonsi and Bally (2021).","summary":"We present weak approximations schemes of any order for the Heston model that are obtained by using the method developed by Alfonsi and Bally (2021). This method consists in combining approximation schemes calculated on different random grids to increase the order of convergence. We apply this…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The Ninomiya‑Victoir scheme is applied only when σ² ≤ 4a.","type":"model","stated":"explicit","quote":"consider either the Ninomiya‑Victoir scheme for σ²"},{"assumption":"Exact CIR simulation of the volatility component is available for any σ > 0.","type":"model","stated":"explicit","quote":"or the exact CIR simulation for any σ > 0"},{"assumption":"The test functions f must belong to a high‑order Sobolev‑type space C^{12ν}_{pol}.","type":"statistical","stated":"explicit","quote":"∀f ∈C^{12ν}_{pol}(R × R+), ∃C > 0, L ∈N, ∥ˆP_{ν,n}f −P_T f∥_{0,L+3ν} ≤C∥f∥_{12ν,L} (T/n)^{2ν}"},{"assumption":"Regularity assumption on f is strong but required for the analysis.","type":"other","stated":"explicit","quote":"The regularity assumption on f required by Theorem 2.1 is rather strong, but needed with our analysis."}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"synthetic"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"pricing-calibration","findings":[{"finding":"The random‑grid boosting method can achieve any prescribed order of weak convergence for the log‑Heston process.","kind":"theoretical","quote":"we show rigorously that we can achieve then any order of convergence."},{"finding":"Numerical experiments on European and Asian options confirm the theoretical orders (2 and 4) of convergence.","kind":"performance","quote":"the estimated slopes are in line with the theoretical order of convergence (2 and 4)"},{"finding":"Using the “one‑step” coupling reduces the variance of the correction term compared to other couplings.","kind":"statistical","quote":"The “one‑step” coupling is even much better. It gives a variance"},{"finding":"The scheme based on the Strang composition with Bernoulli random variable has higher variance and requires an extra random variable.","kind":"statistical","quote":"the scheme using a Bernoulli random variable has a correcting term of higher variance. Besides, it requires to simulate one more random variable."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":31,"citations":{"cited_by_in_corpus":3,"by_independent_authors":1,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":1,"unclassified":2},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":1,"extracted_at":"2026-11-14T18:05:15Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}