{"paper_id":"2503.02965","title":"Complex discontinuities of the square root of Fredholm determinants in the Volterra Stein-Stein model","authors":["Eduardo Abi Jaber","Maxime Guellil"],"paper_date":"2025-03-04","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2503.02965v2","page_url":"https://thequant.space/flowcharts/complex-discontinuities-of-the-square-root-of-fredholm-deter/","scores":{"empirical_rigor":4,"math_complexity":8.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper derives a complex‑plane formula for the Fourier–Laplace transform that accounts for Fredholm determinant crossings and introduces efficient algorithms to detect and handle these crossings, improving pricing accuracy and computational speed.","quote":"derive an expression for the transform to account for such crossings and develop efficient algorithms to detect and handle them","summary":"Fourier-based methods are central to option pricing and hedging when the Fourier-Laplace transform of the log-price and integrated variance is available semi-explicitly. This is the case for the Volterra Stein-Stein stochastic volatility model, where the characteristic function is known…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The Volterra kernel K is of continuous and bounded type in L2(R).","type":"model","stated":"explicit","quote":"For K being a Volterra kernel of continuous and bounded type in L2 R, we introduce the following notation for det(Φ)"},{"assumption":"The determinant crossing count k is an integer counting the number of times the Fredholm determinant crosses the negative real axis.","type":"model","stated":"explicit","quote":"This formula introduces a prefactor eiπk, where k corresponds to the number of time the determinant has crossed the negative real axis."},{"assumption":"The discretization step n can be chosen coarse for a low‑precision proxy without affecting the sign of the transform.","type":"statistical","stated":"implied","quote":"we can reasonably expect that even a coarse approximation will share the same sign as the true value"}]},"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 proposed determinant‑based formula combined with the hybrid or Lipschitz algorithms yields superior accuracy and substantially lower computational time compared to the traditional trace formula.","kind":"performance","quote":"we demonstrate the superior accuracy and computational efficiency of the determinant formula (1.13), combined with either the Hybrid Algorithm 1, the Lipschitz Algorithm 2, or the prefactor‑free formula (3.8), relative to the trace formula (1.6)"},{"finding":"A low‑precision proxy based on a coarse discretization can correctly adjust the sign of the Fourier–Laplace transform with negligible extra cost.","kind":"theoretical","quote":"the sign obtained from the determinant formula (3.1) along the grid is compared to the sign of this proxy, and is adjusted if the two signs differ, thereby recovering the correct value of the Fourier–Laplace transform"},{"finding":"When the extra cost of computing a matrix square root is negligible, the prefactor‑free formula becomes computationally more efficient; otherwise it is less advantageous.","kind":"performance","quote":"the additional cost of computing a matrix square root becomes negligible, making the prefactor‑free formula computationally more efficient"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":18,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"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-14T17:43:26Z"},"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/"}