Log-periodic oscillations due to discrete effects in complex networks
Abstract
We show that discretization of internode distribution in complex networks affects internode distances lij calculated as a function of degrees (ki kj) and an average path length <l> as function of network size N. For dense networks there are log-periodic oscillations of above quantities. We present real-world examples of such a behavior as well as we derive analytical expressions and compare them to numerical simulations. We consider a simple case of network optimization problem, arguing that discrete effects can lead to a nontrivial solution.
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.