Local entropy and nonextensivity of networks ensembles

Abstract

Nonextensivity is foreseeable in network ensembles, as heterogeneous interactions generally exist in complex networked systems that need to be described by network ensembles. But this nonextensivity has not been literatured proved yet. In this work, the existence of nonextensivity in the binary and weighted network ensembles is theoretically proved for the first time (both in the microcanonical and canonical ensemble) based on the finding of the local entropy's nonlinear change when new nodes are added to the network ensembles. This proof also shows that the existence of nonextensivity is the main difference between the network ensembles and other traditional models in statistical physics (Ising model).

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…