Number of loops of size h in growing scale-free networks

Abstract

The hierarchical structure of scale-free networks has been investigated focusing on the scaling of the number Nh(t) of loops of size h as a function of the system size. In particular we have found the analytic expression for the scaling of Nh(t) in the Barab\'asi-Albert (BA) scale-free network. We have performed numerical simulations on the scaling law for Nh(t) in the BA network and in other growing scale free networks, such as the bosonic network (BN) and the aging nodes (AN) network. We show that in the bosonic network and in the aging node network the phase transitions in the topology of the network are accompained by a change in the scaling of the number of loops with the system size.

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…