Percolation forest fire models are a familiar template for studying complexity and a starting point
for HOT. Percolation is the simplest model which exhibits a critical phase transition. Sites on a
two-dimensional square lattice are occupied (trees) or vacant (firebreaks). Contiguous sets of
nearest neighbor occupied sites define connected clusters. The forest fire model includes a coupling
to external disturbance, modeled by sparks which impact individual sites, burning through the
corresponding connected cluster. In the HOT version, the goal is to optimize yield, defined to be the
density remaining after a single spark. I have investigated a variety of different optimization
schemes, including optimal placement of vertical and horizontal strips of vacancies amidst an
otherwise full lattice, growth of an optimal forest by placing trees in the best location one at a
time, optimizing local densities in coarse grained regions of a superimposed design grid, and
Darwinian evolution by mutation and natural selection. All of these lead to similar results.
Optimized lattices consist of compact cellular regions of contiguous tress, separated by efficient
linear barriers formed by vacancies. These robustness barriers are concentrated in regions where
sparks are common, and sparse in regions where sparks are rare. Barriers to cascading failure is a
useful abstraction for robustness mechanisms in real systems. In some cases, barriers are physical
constraints (such as skin, cell walls, and highway lane dividers). However, barriers may also occur
in a system's state space, constructed via complex, regulatory feedback loops in the system's dynamics
(such as immune systems, and the TCP/IP protocol suite). The lattice models illustrate the emergence
of robustness barriers and other key features associated with HOT, including (1) high efficiency,
performance, and robustness to designed-for uncertainties, (2) hypersensitivity to design flaws and
unanticipated perturbations, (3) nongeneric, specialized, structured configurations, and (4) power
laws.