{"paper_id":"2310.04146","title":"Efficient option pricing in the rough Heston model using weak simulation schemes","authors":["Christian Bayer","Simon Breneis"],"paper_date":"2023-10-06","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2310.04146v1","page_url":"https://thequant.space/flowcharts/efficient-option-pricing-in-the-rough-heston-model-using-wea/","scores":{"empirical_rigor":7,"math_complexity":8.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a weak simulation scheme for the rough Heston model that uses low‑dimensional Markovian approximations and achieves second‑order weak convergence with computational cost linear in the number of time steps.","quote":"... the new scheme exhibits second order weak convergence, while the computational cost increases linear with respect to the number of time steps.","summary":"We provide an efficient and accurate simulation scheme for the rough Heston model in the standard (H>0) as well as the hyper-rough regime (H > -1/2). The scheme is based on low-dimensional Markovian approximations of the rough Heston process derived in [“Bayer and Breneis, arXiv:2309.07023”], and…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The weak scheme and Euler scheme simulate a Markovian approximation of rough Heston, i.e., the underlying process is assumed to be Markovian.","type":"model","stated":"explicit","quote":"since they are simulations of a Markovian approximation of rough Heston."},{"assumption":"The coefficients (ci) are chosen to make the representation numerically stable, assuming nodes xi are ordered 0 ≤ x1 < … < xN.","type":"model","stated":"explicit","quote":"Assume without loss of generality that the nodes (xi) are ordered with 0 ≤x1 < · · · < xN."},{"assumption":"When pricing Bermudan options with the HQE scheme, the sample paths are treated as Markovian and past information is ignored.","type":"execution","stated":"explicit","quote":"we decided to just treat the sample paths simulated by the HQE scheme as Markovian paths, and to not make use of past information."}]},"datasets":{"status":"available","items":[{"name":"Synthetic rough Heston model simulations","provider":null,"kind":"synthetic","access":"public","period":null,"universe":null,"quote":"Extensive numerical tests for standard and path-dependent European options and Bermudan options show the method's accuracy and efficiency."}],"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 new weak simulation scheme achieves second‑order weak convergence while its computational cost grows linearly with the number of time steps, outperforming the quadratic cost of the HQE scheme.","kind":"theoretical","quote":"the new scheme exhibits second order weak convergence, while the computational cost increases linear with respect to the number of time steps."},{"finding":"Numerical experiments confirm the scheme’s accuracy for standard, path‑dependent European, and Bermudan options.","kind":"performance","quote":"Extensive numerical tests for standard and path-dependent European options and Bermudan options show the method's accuracy and efficiency."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":11,"citations":{"cited_by_in_corpus":2,"by_independent_authors":1,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":1,"unclassified":1},"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:20:59Z"},"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/"}