We continue to test out spells from the big book of Generatingfunctionomancy, figuring out the average size of a finite component containing a randomly chosen nodes. The average size explodes at the network's transition to having a giant component, a classic critical point feature. We dust ourselves off, and head into the room marked Random Bipartite Affiliation graphs, All Are Welcome. We trust too much.

We endure more unimaginable horrors of seemingly simple probability calcuations, this time with coin flips (really random walks). On average, how many flips do we expect are needed to produce an HT sequence? What about an HH sequence?

Back of the envelope notes made during class.

2016/03/15

1:19:31