Not how much rain — but when. Why does the city hold through one storm, then go under in the next? A single probabilistic rule, applied to every cell in the landscape, reveals a threshold that no smooth rainfall model can predict — and gives a mathematical reason why PAGASA-style warning colours should be threshold-based.
The rule has a name. The threshold has a value. The phase transition belongs to a universality class. Everything in the story that follows is grounded in published mathematics — here is where it comes from.
Rule 250 says a cell is active if either neighbour is active — a lookup table of eight fixed 0/1 entries. Our rain model makes one change: replace those entries with a probability p. At p = 1 it is Rule 250 exactly. As p falls we walk into the interior of the rule cube, and a flood threshold appears that no integer rule number can show.
The related rules anchor the story: Rule 0 is where p → 0 leads — complete drainage, the absorbing state. Rule 255 is the opposite extreme — total saturation, every cell wet regardless of neighbourhood. Rule 184 is the conserved-flow cousin, the traffic/drainage channel model. And Rule 110 is the Class IV neighbour — Turing complete, the stochastic analogue of universal computation. Rule 22 is a chaotic/fractal comparator whose branching filaments visually resemble critical spreading, but it is classified as chaotic (Class III), not Class IV.
At p = 1 the wetting rule collapses to a deterministic statement: a cell activates if either neighbour is active. That is the complete output table of Rule 250. Type 250 into the lecture notebook's rule slider with a single-cell initial condition and the pattern is identical — the same filled triangle, the same checkerboard texture inside it. The verification is analytic: rule_to_table(250) produces the binary string 11111010, matching the wetting function's output for all eight neighbourhood configurations.
Wolfram, S. (2002). A New Kind of Science. Wolfram Media, p. 53. Rule 250 is the "OR of neighbours" spreading rule, Class II from a single seed.
Rule 250 maps the eight neighbourhoods to output table 11111010. Six of those entries are 1 — every neighbourhood that has at least one active neighbour. Two are 0: 010 (only the centre cell) and 000 (all dry). The probabilistic extension replaces those six wetting outputs with probability p, while the two dry outputs remain 0. At p = 1 the rule is exactly Rule 250. At p = 0 it collapses to Rule 0. The 256 Wolfram rules occupy the corners of an 8-dimensional binary cube; sweeping p walks the interior — the only place a phase transition can appear.
This family is called a Probabilistic Cellular Automaton (PCA): local neighbourhood, synchronous update, binary state. The model is the Domany–Kinzel stochastic CA on the site-directed-percolation diagonal p₁ = p₂ = p, with critical threshold pc ≈ 0.705485.
In 1984, Eytan Domany and Wolfgang Kinzel published a proof in Physical Review Letters that a family of 1+1-dimensional stochastic cellular automata is mathematically equivalent to directed percolation — one of the foundational universality classes in non-equilibrium statistical mechanics. Their automaton has two parameters: p₁ (probability a site activates when one neighbour is active) and p₂ (when both neighbours are active).
Our model sets p₁ = p₂ = p, which is the site-percolation diagonal of the DK parameter space. On that diagonal the critical point sits at p₁ = p₂ = 0.705485, computed by Jensen (2004) via series expansion to six significant figures. Our simulation measures p_c ≈ 0.70 — within rounding of a grid computation on a 100×120 cell lattice with finite-size effects. The agreement is expected: our model is the DK automaton on its site-DP diagonal.
The flood threshold this investigation measures is the directed-site-percolation critical point — the same quantity that appears in condensed matter physics, epidemic modelling, and forest-fire percolation.
Scope note: The theoretical pc ≈ 0.705485 applies to the 1+1D Domany–Kinzel corridor model. The Metro Manila map is used as a spatial visualisation and empirical motivation. A full 2D geographic flood CA would require its own neighbourhood definition and its own simulated critical threshold, which would differ from the 1+1D value.
Domany E & Kinzel W (1984). Equivalence of cellular automata to Ising models and directed percolation. Physical Review Letters, 53(4), 311–314. · Jensen I (2004). Low-density series expansions for directed percolation: III. Some two-dimensional lattices. Journal of Physics A, 37(27), 6899–6915 [pc = 0.705485 for site-DP in 1+1D].
Wolfram classified all 256 deterministic rules into four behavioural classes. Sweeping p gives a stochastic analogue of those classes — not a literal traversal (Wolfram's taxonomy applies to deterministic automata), but a recognisable correspondence. The underlying transition is a directed-percolation phase transition, which is a distinct result in its own right.
p < pc — every initial condition collapses to all-dry. The absorbing state. Rule 0 is its deterministic limit: all outputs zero, forever. Yellow-warning territory in Manila.p ≈ pc — the critical filament: branching, self-similar, neither dying nor spreading. The edge of chaos. The stochastic analogue of Rule 110, which Cook (2004) proved Turing complete. This is the orange warning.p > pc — active, disordered, never returning to dry. Wet activity survives and occupies a macroscopic fraction of the lattice. Red warning. Evacuate. (Note: the deterministic endpoint remains Rule 250 at p=1, not Rule 255.)The 256 Wolfram rules are the corners of an 8-dimensional binary cube. This investigation walks its interior — the only path on which a phase transition can appear.
Our concepts. One threshold. Now scroll to watch it cross.
Metro Manila sits between Manila Bay and Laguna de Bay, with the Marikina–Pasig river system threading through the metro and draining toward the bay under wet-season conditions. Every wet season, the Habagat brings warm, moisture-laden southwest monsoon flows that can deliver sustained rainfall over the western side of Luzon.
What engineers and residents repeatedly observe is not merely that more rain produces more water. It is that the city can appear to hold through one storm, then cross into widespread flooding under the next. The research question is this threshold: when does local wetting stop dying out and begin spreading as a persistent, system-level flood state?
Schematic map capturing the essential topology: bay to the west, lake to the southeast, Marikina and Pasig corridors threading through. Not survey-grade — the point is the drainage geometry, not the cadastral lines.
Reduce the landscape to a binary grid: each cell is wet (1) or dry (0). At each discrete time step, a cell updates using only its lateral neighbours. If at least one lateral neighbour is wet, the cell becomes wet with probability p. If neither lateral neighbour is wet, it remains dry. That is the complete rule.
At p = 1, the model becomes Wolfram Rule 250 exactly: deterministic spreading by the OR of the left and right neighbours. Below p = 1, the same rule becomes a Probabilistic Cellular Automaton governed by a single effective parameter p, representing the combined pressure of rainfall intensity, soil saturation, surface runoff, and drainage limitation.
In the theoretical model, p is spatially uniform. This preserves the clean Domany–Kinzel / directed-percolation interpretation and allows the flood threshold to be measured as a true phase transition.
Metro Manila enters as the visualization and motivation layer. Low-lying corridors such as Marikina and Pasig can be represented through the initial wet cells, basin geometry, or a separate topographic weighting extension. But the core rule remains local, binary, and uniform: neighbour influence plus probability p.
PAGASA's yellow warning — 7.5 to 15 mm per hour — sits below the critical threshold. Wet patches nucleate along the river corridors, then die out. With p < pc, the dynamics converge to the all-dry absorbing state: once every cell is dry, no update rule can reactivate them. This is the regime that Rule 0 represents in its deterministic limit — all outputs zero, regardless of neighbourhood. The city is stable, not because it cannot get wet, but because the absorbing state dominates.
PAGASA's orange rainfall level corresponds to intense rain, around 15 to 30 mm per hour. In this model, orange is interpreted as the critical-warning regime: the system is near the threshold where local wetting stops dying out quickly but has not yet become a persistent metro-wide flood.
At p ≈ pc, wet activity survives as thin, branching ribbons along vulnerable corridors such as the Marikina valley and Pasig system. These clusters are neither safely extinguished nor fully spreading. They persist because the birth of new wet cells and the death of existing wet cells are nearly balanced.
This branching survivor pattern is the stochastic analogue of Wolfram's edge-of-chaos idea: a state between complete order and complete disorder. Rule 110 is the correct Class IV reference point, famous for Turing completeness and complex localized structures. Rule 22 can remain as a chaotic/fractal comparator because its filaments visually resemble critical spreading, but it should not be treated as the main Class IV anchor.
This is the most structurally rich and information-dense regime in the model. It is the warning zone where the city may still hold — but small changes in rainfall, saturation, drainage, or initial wetting can push the system into persistent flooding.
PAGASA's red rainfall level corresponds to torrential rain, above 30 mm per hour. In this model, red is interpreted as the supercritical regime: the system has crossed pc, moving from the absorbing phase into the active directed-percolation phase.
In CA terms, wet activity no longer dies out quickly. A macroscopic fraction of cells remains active over time, and the system sustains persistent spreading rather than returning easily to the all-dry state. This is the stochastic analogue of Wolfram's Class III behaviour: active, irregular, and disordered.
The deterministic endpoint of this model remains Rule 250 at p = 1. Rule 255 — where every cell activates even with no wet neighbours — is a separate saturation corner of the rule cube, not the limit of the Rule 250 probabilistic path.
The transition is sharp but continuous. The same marginal increase in p that produced only short-lived wet patches below the threshold can produce persistent spreading above it. That asymmetry — extinction below pc, survival above pc — is the signature of a continuous directed-percolation phase transition. It gives a mathematical reason why an orange warning can escalate into red under the same weather system: once the effective wetting probability crosses the threshold, local flooding can become system-level persistence.
Measure the long-time flooded fraction across the full range of p, and the result is unambiguous. Below the threshold, wet activity dies out and the flooded fraction approaches zero. Near pc, the system becomes critical. Above pc, the flooded fraction rises sharply but continuously, following the directed-percolation order-parameter relation:
ρ ~ (p − pc)β
For 1+1D directed percolation, β ≈ 0.276. The transition is continuous — not a true jump — but on a finite lattice it can look abrupt because small changes in p produce large differences in survival time and flooded extent.
The measured critical point pc ≈ 0.70 is consistent with the published directed-site-percolation threshold (pc ≈ 0.705485) for the 1+1D square/diagonal lattice, within rounding and finite-size effects. The order-parameter curve is therefore the quantitative signature of the absorbing-to-active transition.
Not one cell knows what a flood is. Each cell executes the same local rule: check its neighbours, then activate with probability p. The flood is emergent — a global pattern produced by many local interactions, with no central coordinator and no cell-level awareness of the whole system.
This is the central lesson of cellular automata. Rule 110, which Matthew Cook proved Turing complete, shows the outer edge of what local CA rules can generate when information is encoded in their patterns. This investigation makes a simpler claim: if local rules can support computation, then they can certainly support spreading, clustering, extinction, and persistence. A flood threshold emerging from a probabilistic Rule 250 update is therefore theoretically natural.
The policy implication is also local. In the clean model, pc is a system-level threshold. But in a real city, the effective wetting probability is not evenly distributed. Low-lying, poorly drained corridors such as Marikina and Pasig are the places where wet activity is most likely to survive, branch, and carry the transition from local flooding to system-wide persistence.
Intervening there — restoring floodplains, clearing drainage, improving outflow, raising embankments, and protecting retention areas — reduces the local effective p or raises the local capacity required for spreading. The CA framework makes the intervention logic clear: flood control does not only mean treating the whole city uniformly. It means identifying the cells and corridors that carry the transition, then weakening the paths through which local wetting becomes persistent flood.
PAGASA names that danger in colours — yellow, orange, red. What this investigation adds is a mathematical reason why threshold-based warnings make sense: below the critical point, wet activity dies into the absorbing dry state; near it, the system reaches its most unstable and structurally rich configuration; above it, spreading becomes persistent. The warning line is not arbitrary. In the model, it appears as the sharp but continuous onset of a directed-percolation phase transition between inactive and active phases.
That is the finding: a probabilistic cellular automaton based on Wolfram Rule 250 reproduces threshold flood behaviour through a known universality class. Under the 1+1D Domany–Kinzel corridor interpretation, the model is measurable with a single effective parameter p. Every wet season, the Habagat can push the city's effective wetting conditions toward that line — and once the threshold is crossed, local wetting can become persistent system-level flooding.
Model: Wolfram Rule 250 made probabilistic, following the Domany–Kinzel stochastic cellular automaton. This is a threshold model, not a hydrodynamic forecast of any specific street or storm. The critical value pc ≈ 0.705 is consistent with the published directed-site-percolation value for the 1+1D model. PAGASA warning thresholds are empirical anchors and interpretive references, not model inputs.
The question that opened this story, the rule that powered it, the simulations that measured it, the insight it produced, and where a rigorous extension leads.
The central question is theoretical: as a single parameter — wetting probability p, representing rainfall intensity, soil saturation, and drainage capacity — increases continuously, does the steady-state flooded fraction rise smoothly or exhibit a sharp bifurcation? Metro Manila provides the empirical motivation: a city whose flood behavior exhibits an abrupt onset — technically a sharp but continuous directed-percolation phase transition — between the absorbing (dry) phase and the active (flooded) phase under southwest monsoon forcing. The investigation uses Wolfram's cellular automaton framework to ground that discontinuity in a known universality class.
The deterministic backbone is Rule 250: a cell activates if either neighbour is active. Verified byte-for-byte against the lecture notebook. The modification replaces the six wetting outputs with a probability p while keeping the two dry outputs (000 and 010) at zero — placing the model on the site-percolation diagonal (p₁ = p₂ = p) of the Domany–Kinzel stochastic CA parameter space. At p = 1 the model is exactly Rule 250 (Class II spreading). Below pc ≈ 0.705 it converges to the Rule 0 absorbing state (Class I). Above pc it enters the Class III active directed-percolation phase: wet activity survives with positive probability and occupies a macroscopic fraction of the lattice. The deterministic endpoint of the model is Rule 250 at p = 1, not Rule 255. The 256 Wolfram rules are the corners of an 8-dimensional binary cube; this model walks a path through its interior — the only way to observe a phase transition.
Wolfram catalogued all 256 elementary rules and found four behavioural classes. Our rain model starts at Rule 250 and walks into the probabilistic interior. Each relative below illuminates a different facet of why a simple update rule can produce flooding, traffic, fractals, or universal computation.
Rain that looks random isn't. Rule 30 shows that a fully deterministic rule — no coin flips — produces a pattern so disordered it was used as a real random-number generator in Mathematica for years. Our rain model adds genuine randomness (the p coin). Rule 30 is the reminder that you don't even need that.
"Simple deterministic rules produce apparent randomness."
Rule 90 is XOR of left and right neighbours — no centre cell. Because XOR is linear, the whole spacetime pattern is the superposition of individual seeds. Our Rule 250 (OR, not XOR) breaks that linearity. That single bit-flip from OR to XOR is the difference between fractal self-similarity and uniform flooding.
"XOR linearity produces the Sierpiński triangle."
Rule 110 sits at the Class IV 'edge of chaos' — the same class as our critical filament at p = p_c. Matthew Cook proved it is Turing complete. Our threshold at p_c ≈ 0.70 produces a similar thin, branching survivor, the same signature Wolfram associates with maximum computational capability.
"Computation emerges at the edge of chaos."
Rule 184 conserves the number of black cells: they move forward only when space is free, exactly like cars — or water packets draining through a channel. Below a critical density everything flows; above it a jam nucleates spontaneously. The same tipping-point geometry as our flood threshold, but for drainage throughput rather than spread.
"Local movement rules produce spontaneous congestion."
Rule 54 produces gliders — small moving structures that survive and interact. It shows that 'particles' are not built into the rule; they emerge from it. Our wet clusters near p_c also have particle-like character: they survive for a while, split, and die in patterns that have nothing to do with individual cells.
"Particles emerge from local update rules."
Rule 22 produces a pattern that looks random but contains hidden nested structure — it sits right between order and chaos. Our model at p = p_c does the same thing stochastically: the critical filament is neither periodic nor fully disordered, which is exactly Wolfram's characterisation of Class IV.
"Hidden structure survives near the chaos boundary."
Every cell becomes 0 by step 2 regardless of start. This is the absorbing state — once everything is off, nothing can turn on. Below p_c in our model, the dynamics converge to the same absorbing state (all-dry). Rule 0 is what p → 0 looks like in the deterministic limit.
"The absorbing state: nothing can restart what dies."
Every cell becomes 1 by step 2. The deterministic analogue of p = 1 with rain = 1: every cell is always wet, no coin needed. In our flood model this is the extreme upper-right corner of the DK phase diagram, well inside the active phase.
"Total saturation: every cell floods immediately."
A cell is 1 if the majority of its three-cell neighbourhood (itself plus two neighbours) is 1. This is a different kind of flood rule: you flood not because a neighbour spreads to you but because you are already surrounded. It models social flood decisions — a cell 'gives up' when outnumbered — rather than physical water spreading.
"Consensus emerges from local majority voting."
Rule 250 says a cell is active if either neighbour is active — a lookup table of eight fixed 0/1 entries. Our rain model replaces those entries with a probability p. At p = 1 it is Rule 250. As p falls, we enter the interior of the rule cube, and a flood threshold appears that no integer rule number can show. Rule 0 is where p → 0 leads (complete drainage), Rule 255 is total saturation, Rule 184 is the conserved-flow cousin, and Rules 110 and 22 are the Class IV neighbours whose critical filaments look like our tipping-point edge.
The steady-state flooded fraction is identically zero across the absorbing phase, then rises sharply at pc ≈ 0.705 — the directed-site-percolation critical point, matching published series-expansion results to three significant figures. This is not curve-fitting: the measurement recovers a theoretically predicted quantity from a minimal two-state CA, establishing that the threshold character of Manila flooding is not an engineering detail but a consequence of universality.
PAGASA's yellow orange red color ladder is the empirical manifestation of this universality class operating in a real catchment. The actionable implication is local: the threshold is set by the highest-p cells — the low-lying, poorly-drained corridors along the Marikina and Pasig. Interventions there shift pc and raise the rainfall intensity the city can absorb before tipping. The CA framework makes that causal chain explicit.
Real topography. Replace the sketched lowland weighting with cell-level p values derived from NAMRIA DEM data. The prediction: flood nucleation will follow true basin geometry, and pc will be measurably lower in the Marikina valley than in Quezon City uplands. This is a testable, falsifiable claim.
Rule 184 as a drainage channel model. Rule 184 conserves the number of active cells (cars / water packets) and produces a fundamental diagram — throughput as a function of density — with a capacity-jam transition. Applied to the Pasig drainage corridor, it predicts the rainfall rate at which outflow capacity is exceeded. That transition is the channel-level analogue of the metro-level pc found here.
Critical exponent measurement. Near pc, the flooded fraction scales as ρ ~ (p − pc)β with β ≈ 0.2765 for directed percolation in 1+1 dimensions. Fitting this exponent from simulation data and comparing it to the published value is a direct test of universality class membership.
Asynchronous update. Every result here assumes synchronous parallel update — a global clock. Real drainage is asynchronous. Breaking that assumption tests whether the threshold is a CA artifact or a robust physical result. Rule 250's perfect triangle dissolves under asynchrony; whether the critical point survives is an open question worth a week of simulation.