We will look at walks on a network. Consider a network of N nodes. Assume that each pair of nodes are connected by a link with probability p. In the following we neglect loops and work in the limit of large N. Start from a randomly chosen node and perform a random walk from node to node. You are not allowed to walk back along the link you arrived along. See Fig. 8.16. The walk in panelAis allowed but the walk in panel B is not.

Figure 8.16

Transcribed Image Text:

A B