Critical percolation on preferential attachment graphs with infinite variance

Abstract

We study the inhomogeneous random graph with preferential attachment kernel and degree distribution with power-law exponent τ∈(2,3) as a representative of the class of graphs of preferential attachment type with infinite variance degrees. Under bond percolation with a positive retention probability independent of the size n of the graph there is a unique macroscopic component with high probability. We therefore investigate percolation probabilities pn0. We identify a moving critical window at pc βn(τ-3)/(2τ-2). Above this window, when pn pc, the maximal component has size of order n p(τ-1)/(3-τ)_n and it is unique. Below this window, when n1/(1-τ) pn pc, it is non-unique, star-shaped and has size of order n1/(τ-1) pn. In the critical window itself, the largest component scaled by n converges in distribution to a positive random variable with a law given in terms of a subcritical Norros-Reittu graph. This behaviour is markedly different from that seen for other classes of scale-free graphs and is conjectured to persist throughout the broad class of growing graphs with infinite variance.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…