IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2607.25353.html

How Likely and How Deep? Sharp Joint Bounds on Risk-Neutral Crash Probability and Conditional Depth from Option Bid-Ask Quotes

Author

Listed:
  • Jirong Zhuang

Abstract

A finite panel of option quotes with bid-ask spreads generally does not point-identify either the risk-neutral probability of breaching a specified threshold or the expected shortfall below that threshold conditional on a breach. Sharp marginal bounds characterize each quantity in isolation but not their jointly attainable combinations: values within the two marginal intervals may require different risk-neutral distributions, so pairing them can produce a tail scenario inconsistent with the option panel. We characterize the closure of the jointly attainable probability and loss pairs under finite bid-ask constraints. Partitioning the state space at observed strikes and at the crash threshold makes the model-implied value of every retained option linear in cell probabilities and first moments, and one additional variable tracks mass at the threshold itself. Under a strict interior condition, the identified set is the projection of a finite linear system, and an adaptive hull algorithm recovers the probability-loss polygon. Vertical sections report the conditional depths consistent with a candidate crash probability, and the support function gives sharp upper and lower values for any portfolio of digital and put payoffs. In 557 weekly SPX panels from January 2013 to August 2023, with 1,966 primary cases, the complete put wing lowers median transformed area by 5.4-18.2% relative to a local set of eight strikes, and the joint set fills a median 63.40% of the benchmark formed from separate marginal bounds and the universal probability-loss restriction.

Suggested Citation

  • Jirong Zhuang, 2026. "How Likely and How Deep? Sharp Joint Bounds on Risk-Neutral Crash Probability and Conditional Depth from Option Bid-Ask Quotes," Papers 2607.25353, arXiv.org.
  • Handle: RePEc:arx:papers:2607.25353
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2607.25353
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2607.25353. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.