PHYSICS · Multi-part · Fermi University Physics · Mathematical Methods for Physics · Thermal, Statistical & Complex Systems · Complex and collective systems
Many Parts, One Behaviour, Ch Random graphs, the giant component and percolation on networks
Problem
A rumour spreads through a large population. Each person who hears it forwards it to a number of new listeners k=0,1,2,… with probability P(k)=(1−p)pk, independently at every step, where p=0.7 (a geometric offspring distribution). Different people forward independently of one another.
((a)) Find the mean number of new listeners b per person who has heard the rumour.
((b)) Find the extinction probability of the rumour, that is, the probability that the chain of forwards eventually stops, using the offspring generating function R(x)=∑kP(k)xk and the self-consistency condition u=R(u) for the smaller root u∈[0,1).