Zusammenfassung
The author considers the limiting behavior of simple random walks Xn on two types of random graphs: the family tree of a critical branching process, and the incipient infinite cluster of the critical two-dimensional bond percolation model. In each case, he shows that the limiting behavior is subdiffusive in the sense that Xn behaves like nα for some power α<12. The results are most complete in the branching model, for which the result is that, when normalized by n1/3, the distance from Xn to the root of the family tree has a limiting distribution. The proofs are quite long and complex.
Nutzer