Self-similarity in Fractal and Non-fractal Networks

Abstract

We study the origin of scale invariance (SI) of the degree distribution in scale-free (SF) networks with a degree exponent γ under coarse graining. A varying number of vertices belonging to a community or a box in a fractal analysis is grouped into a supernode, where the box mass M follows a power-law distribution, Pm(M) M-η. The renormalized degree k of a supernode scales with its box mass M as k Mθ. The two exponents η and θ can be nontrivial as η γ and θ <1. They act as relevant parameters in determining the self-similarity, i.e., the SI of the degree distribution, as follows: The self-similarity appears either when γ η or under the condition θ=(η-1)/(γ-1) when γ> η, irrespective of whether the original SF network is fractal or non-fractal. Thus, fractality and self-similarity are disparate notions in SF networks.

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…