pith. sign in

arxiv: cond-mat/0507198 · v1 · submitted 2005-07-08 · ❄️ cond-mat.stat-mech · cond-mat.dis-nn

Self-similar Scale-free Networks and Disassortativity

classification ❄️ cond-mat.stat-mech cond-mat.dis-nn
keywords networksscale-freeself-similarrenormalizationassortativedisassortativedisassortativityfeature
0
0 comments X
read the original abstract

Self-similar networks with scale-free degree distribution have recently attracted much attention, since these apparently incompatible properties were reconciled in a paper by Song et al. by an appropriate box-counting method that enters the measurement of the fractal dimension. We study two genetic regulatory networks ({\it Saccharomyces cerevisiae} and {\it Escherichai coli} and show their self-similar and scale-free features, in extension to the datasets studied by Song et al. Moreover, by a number of numerical results we support the conjecture that self-similar scale-free networks are not assortative. From our simulations so far these networks seem to be disassortative instead. We also find that the qualitative feature of disassortativity is scale-invariant under renormalization, but it appears as an intrinsic feature of the renormalization prescription, as even assortative networks become disassortative after a sufficient number of renormalization steps.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.