LIPIcs.AofA.2024.14.pdf
- Filesize: 1.12 MB
- 10 pages
We study the size of the connected component of early typical vertices in a subcritical inhomogeneous random graph with a kernel of preferential attachment type. The principal tools in our analysis are, first, a coupling of the neighbourhood of a typical vertex in the graph to a killed branching random walk and, second, an asymptotic result for the number of particles absorbed at the killing barrier in this branching random walk.
Feedback for Dagstuhl Publishing