LA Probability Forum

USC KAP 414

Hambly and Jordan (2004) introduced the series-parallel graph, a random hierarchial lattice that is easy to define: Start with the graph consisting of one edge connecting two terminal nodes. At each subsequent step of the construction, perform independent coin flips for each edge of the graph, and replace the edge by two edges in series if the coin is heads-up or two edges in parallel if tails. This results in a sequence of random graphs, which can be interpreted as a resistor network. Hambly and Jordan showed that the logarithm of the resistance grows linearly if the coins are biased to land more often heads-up. In this talk, I will discuss what happens in the critical case when fair coins are used. Starting with a new recursive distributional equation (RDE) proposed by Gurel-Gurevich, I develop a framework for analyzing RDE's based on parabolic PDE theory and use this to characterize the asymptotic behavior of the log. resistance. In the sub- or supercritical case (where the coins are biased), I discuss a tantalizing connection to the Fisher-KPP equation and front propagation.