Worked case · Chapter 9, Networks, Dependence, and Resilience · p. 353 · sources checked 9 November 2026
Middle East cable corridors
which chokepoints decide connectivity, and which investments buy resilience rather than capacity?
The network
- Planner → Routes and chokepoints commits one route receives new capacity
- Adversary or accident → Routes and chokepoints acts a set of chokepoints lost
- Routes and chokepoints → Planner pays surviving capacity, and whether it stays above the service threshold
The mapping
The six fields of the model card, as the book fills them in for this situation.
| Field | In the case |
|---|---|
| 1 Decision-makers | a planner choosing where to add capacity; an adversary or an accident removing chokepoints; nature |
| 2 Time | one period: an outage lasting long enough to matter, repairs not modelled |
| 3 Information | the routes and the chokepoints they cross are public; the model ignores which party controls what |
| 4 Commitment | capacity is built before outages occur |
| 5 Payoffs | surviving capacity between the two regions, and the probability that it stays above a service threshold |
| 6 Strategies | sets of chokepoints lost; one route receiving new capacity |
What the mathematics licenses.
Five statements about the model; the mapping to the region is a reconstruction R.
- Count corridors, not cables. Ten cables through one corridor are one route against the loss of that corridor. Treated as ten independent links (each failing with 's probability, independently of the others and of , so that the corridor's shared exposure to Egypt disappears as well), they would make connection look assured; keeping shared and splitting only 's risk among the cables still gives . Counted as the corridor they share, the probability is exactly , the product of the two chokepoints' survival D [Proposition 9.13 (p. 378)(b)].
- One chokepoint can take two thirds. Losing either or cuts capacity from to ; two chokepoints, chosen well, leave (Table 9.1 (p. 357)). The worst pairs are not the two famous straits but a strait and a land crossing shared by both bypasses, , or Egypt and the Levant, : the routes designed to avoid one chokepoint concentrate on another D [Proposition 9.13 (p. 378)(a)].
- Two different robustness counts. At most four routes are pairwise chokepoint-disjoint (R1, R4, R5, R6), and four chokepoints, such as , , , , together cross every route; the two certificates prove that both numbers are for this table. The equality is a fact about this route table, checked by enumeration: for an arbitrary list of routes given as sets of chokepoints it can fail, and Menger's theorem applies only when the routes are all the paths of a graph. Four is the number of losses needed to stop everything; to break the service threshold, one loss ( or ) is enough D [Proposition 9.13 (p. 378)(a)].
- The same capacity buys different resilience. Adding four units of capacity raises the probability of staying connected from by nothing if the units go into the same corridor (R1), to for the Egypt bypass that still crosses (R2), to for the bypass of that still crosses and (R3), and to for any route that shares no chokepoint with R1 (R4–R6) (Figure 9.6 (p. 357)). Sharing a chokepoint is not fatal here: R3, which shares with the corridor, still delivers about of the best gain; what it loses is the probability that fails D [from Proposition 9.13 (p. 378)(c)]. Under a regional shock that removes the Red Sea and Hormuz together the ordering is the same at lower levels ( to ) D [Proposition 9.13 (p. 378)(c)].
- Capacity and resilience are different purchases. The same four units of capacity add nothing to the probability of service if placed on the corridor (R1) and the most if placed on a route that shares none of its chokepoints (R4, R5, R6). A planning document that reports only terabits added answers the first question and is silent on the second R.
Where the mapping breaks.
Outages are rarely total: a damaged cable is repaired in weeks or months, and the binding constraint is often the repair (permits for territorial waters, the availability of cable ships, the safety of crews in contested waters), which turns the problem into one of dynamics (Chapter 7) rather than topology. Capacity is not fungible: traffic between particular cities, with latency requirements, cannot simply move to a route around Africa. Terrestrial routes have chokepoints of their own, such as borders, power and permits, that the model's single letters hide. Failures are neither independent nor fixed: the regional shock in the model is one stylised correlation, and real risks change with events. And the model has no owners: who controls a landing station, a crossing permit or a repair ship is exactly what decides the real problem, and it is absent here.
In the book
The full case runs through six steps: The situation, as documented; The model card; What the mathematics licenses; Where the mapping breaks; What one would have to measure; Sources. The numbers in step 3 are certified in the chapter's engine room, and the sources in step 6 are listed with the day they were read. The site shows the model mapping (step 2), what the mathematics licenses (step 3) and where the mapping breaks (step 4); the full case is on p. 353 of the book.