For the inhomogeneous random graph with kernel of preferential attachment type and degree distribution with power-law exponent \(\tau \in (2,3)\) we study the decay of the size of the giant component when the edge density approaches zero. It turns out that the giant component is significantly smaller than for the inhomogeneous random graph with a kernel of rank one.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

The Size of the Giant in Inhomogeneous Random Graphs of Preferential Attachment Type

  • Peter Mörters,
  • Lucas Schätze

摘要

For the inhomogeneous random graph with kernel of preferential attachment type and degree distribution with power-law exponent \(\tau \in (2,3)\) we study the decay of the size of the giant component when the edge density approaches zero. It turns out that the giant component is significantly smaller than for the inhomogeneous random graph with a kernel of rank one.