Fluctuations of motifs and non self-averaging in complex networks. A self- vs non-self-averaging phase transition scenario

preprint2014arXivOpen access

Abstract

Complex networks have been mostly characterized from the point of view of the degree distribution of their nodes and a few other motifs (or modules), with a special attention to triangles and cliques. The most exotic phenomena have been observed when the exponent γγ of the associated power law degree-distribution is sufficiently small. In particular, a zero percolation threshold takes place for γ<3γ<3, and an anomalous critical behavior sets in for γ<5γ<5. In this Letter we prove that in sparse scale-free networks characterized by a cut-off scaling with the sistem size NN, relative fluctuations are actually never negligible: given a motif ΓΓ, we analyze the relative fluctuations RΓR_Γ of the associated density of ΓΓ, and we show that there exists an interval in γγ, [γ1,γ2][γ_1,γ_2], where RΓR_Γ does not go to zero in the thermodynamic limit, where γ1≈kminγ_1\approx k_{\mathrm{min}} and γ2≈2kmaxγ_2\approx 2 k_{\mathrm{max}}, kmink_{\mathrm{min}} and kmaxk_{\mathrm{max}} being the smallest and the largest degree of ΓΓ, respectively. Remarkably, in (γ1,γ2)(γ_1,γ_2) RΓR_Γ diverges, implying the instability of ΓΓ to small perturbations.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.