Nick Schleicher

Subcritical inhomogeneous random graphs of preferential attachment type

We study the size of the connected component of early typical vertices in an inhomogeneous random graph of preferential attachment type. The main tools are a coupling of the graph to a killed branching random walk and a result for the number of particles absorbed in the killing barrier.