Let q be an odd prime power and φ a rational function with coefficients in a finite field F q . For n ≥ 1, each element of P 1 (F q n ) is either periodic or strictly preperiodic under iteration of φ. Denote by a n the proportion of periodic elements. Little is known about how a n changes as n grows, unless φ is a power map or Chebyshev polynomial. We give the first results on this question for a wider class of rational functions: a n has lim inf 0 when φ is quadratic and neither Lattès nor conjugate to a one-parameter family of exceptional maps. We also show that a n has limit 0 when φ is a quadratic polynomial with strictly preperiodic finite critical point and q is a square. Our methods yield additional results on periodic points for reductions of post-critically finite (PCF) rational functions defined over number fields.The difficulty of understanding a n in general is that P 1 (F q n ) is a finite set with no ambient geometry. In fact, φ can be lifted to a PCF rational map on the Riemann sphere, where we show that a n is given by counting elements of the iterated monodromy group (IMG) that act with fixed points at all levels of the tree of preimages. Using a martingale convergence theorem, we translate the problem to determining whether certain IMG elements exist. This in turn can be decisively addressed using the expansion of PCF rational maps in the orbifold metric.