Vol. I, Ch. 12 · Part 3. Enterprise Architectures · Week 6
Enterprise Risk, Resilience, and Robustness Architecture
Learning outcomes
After completing this chapter, the reader should be able to:
- Define enterprise risk mathematically: the exposure of declared objectives to the state distribution, evaluated by declared risk functionals.
- Distinguish risk, uncertainty, robustness, and resilience as four different mathematical objects answering four different questions.
- Construct enterprise risk vectors with declared loss channels and architectural supports.
- Model enterprise vulnerabilities as damage maps on the architecture.
- Analyze resilience and recoverability through basin geometry and contraction rates, including recovery to the volatility band rather than to a point.
- Evaluate enterprise robustness: worst-case guarantees, robustness radii, and the price of the worst case.
- Measure enterprise survivability: survival functions, hazards, and the race between shock arrival and recovery.
- Understand systemic enterprise risk: gain-weighted propagation, cascade thresholds, and common-shock dependence.
- Integrate uncertainty into architectural analysis: stress equilibria, reverse stress tests, and the audit framework.
- Prepare the risk architecture for unification in UETA and optimization under uncertainty in Volume II.
Reading guide
Work through the chapter in section order; the full development, proofs, and worked examples are in the book — this page indexes them and does not replace them.
Motivation for the Risk Architecture
Motivation for the Risk ArchitectureRisk, Uncertainty, and the Architecture
Risk, Uncertainty, and the ArchitectureShocks, Stress, and Vulnerability
Shocks, Stress, and VulnerabilityEnterprise Robustness
Enterprise RobustnessEnterprise Resilience and Recoverability
Enterprise Resilience and RecoverabilityEnterprise Survivability
Enterprise SurvivabilityRisk Propagation and Systemic Risk
Risk Propagation and Systemic RiskThe Risk Architecture Assembled
The Risk Architecture AssembledWorked Examples
Worked ExamplesPreparation for the Unified Architecture
Preparation for the Unified ArchitectureChapter Summary
Chapter SummaryExercises
ExercisesNotes and Sources
Notes and Sources
On the map
AXIOM
This chapter is instrumented by:
Launch the module, load the chapter model, modify inputs, run the optimization, and compare against the worked examples in the book.
Exercises
19 exercises, grouped A concept checks · B mathematical · C computational · D enterprise applications. Starred (★) exercises are on the advanced track. Full solutions appear in the Instructor's Manual, Chapter 12.
A. Concept checks
- 12.1Using Table (see book), classify each of the following statements by which member of the quartet it invokes, rewriting any that conflate two: "we can absorb a $20 "there is a $5 breach at the identity provider would take out three systems"; "we were back inside plan range within four quarters.
- 12.2Explain the Knightian split (Definition (see book)) in two sentences, give one enterprise channel you would treat with a declared law and one with only a set, and justify each choice.
- 12.3"Choosing between VaR and expected shortfall is a technical detail for the risk team.
- 12.4A post-crisis report tracks distance to the pre-shock operating point and concludes "recovery incomplete" eight quarters running.
- 12.5Explain, without formulas, the two distinct reasons systemic risk exceeds the sum of marginal risks (Theorem (see book)(iv)), with one enterprise instance of each.
B. Mathematical exercises
- 12.6Construct your own VaR subadditivity failure at the $99 choose loss probabilities and sizes for two independent exposures so that each has $\mathrm{VaR}_{0.
- 12.7Prove the minimax inequality of Theorem (see book)(ii) in full, and construct a decision–disturbance table with a strict gap; interpret the gap as the value of foresight about the disturbance.
- 12.8Derive the recovery clock (see book) from the contraction bound, including the ceiling; then derive the first-order sensitivity near and interpret the divergence.
- 12.9Verify Theorem (see book)(ii)'s construction: compute both recovery clocks for a shock at , exhibit a shock size where the rankings reverse, and prove that no scalar score , strictly monotone in each argument, can rank both comparisons consistently.
- 12.10 ★Complete the induction of Theorem (see book)(ii): state the entrywise vector induction precisely, justify the triangle-inequality step from the componentwise Lipschitz hypothesis, and show where nonexpansiveness in a component's own state is used (exhibit a counterexample bound when it fails).
- 12.11Prove the Neumann equivalence of Theorem (see book)(iii): convergence of iff , using Theorem 7.
- 12.12Prove the hazard factorization and the expected-survival identity of Theorem (see book)(i), and evaluate both for stationary $h = 1.6 quarter survival under the stressed hazard $9.
- 12.13 ★Generalize the common-shock construction of Theorem (see book)(iv): for common-cause probability and idiosyncratic probability per unit, derive the exact joint failure probability and the ratio to the independence estimate; show the ratio is maximized as and compute its limit ; interpret.
C. Computational exercises
- 12.14(With AXIOM-12 or the Chapter 12 notebook.
- 12.15(With AXIOM-12 or the Chapter 12 notebook.
- 12.16(With AXIOM-12 or the Chapter 12 notebook.
D. Enterprise applications
- 12.17Construct the risk vector for an enterprise you know: eight or more channels of Table (see book) with loss channel, architectural support (from your Exercise 9.
- 12.18Audit one real stress-testing exercise you have seen against Table (see book): score each row present/absent/partial, identify whether a reverse stress test (robustness radius) was run, and write the two-paragraph gap memo.
- 12.19Write the race memo for one recurring shock channel: estimate from the record, compute from your enterprise's observed recovery episodes (state the tolerance used), report , and propose one lever on each of , , and margin with rough costs.
Downloads
- Lecture deck DCT_V1_Ch12_Slides.pptx · 434 KB
- Python laboratory DCT_V1_Ch12_Lab.ipynb · 10 KB
- Excel workbook DCT_V1_Ch12_Lab.xlsx · 17 KB
- Open the laboratory
All three companions consume the same seeded engine (26112), so their numbers agree by construction — the MFMF convention, carried forward.

