pith. sign in

arxiv: cond-mat/0401196 · v1 · submitted 2004-01-12 · ❄️ cond-mat.dis-nn · cond-mat.stat-mech

Designer Nets from Local Strategies

classification ❄️ cond-mat.dis-nn cond-mat.stat-mech
keywords degreelocalmethodadditionnodeparametersscale-freestrategies
0
0 comments X
read the original abstract

We propose a local strategy for constructing scale-free networks of arbitrary degree distributions, based on the redirection method of Krapivsky and Redner [Phys. Rev. E 63, 066123 (2001)]. Our method includes a set of external parameters that can be tuned at will to match detailed behavior at small degree k, in addition to the scale-free power-law tail signature at large k. The choice of parameters determines other network characteristics, such as the degree of clustering. The method is local in that addition of a new node requires knowledge of only the immediate environs of the (randomly selected) node to which it is attached. (Global strategies require information on finite fractions of the growing net.)

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.