Designer Nets from Local Strategies

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.)

References in corpus (4)

• Statistical mechanics of complex networks
• Evolution of networks
• Infinite-Order Percolation and Giant Fluctuations in a Protein Interaction Network
• Finiteness and Fluctuations in Growing Networks

Cited by in corpus (12)

• Nonuniversal power law scaling in the probability distribution of scientific citations
• How Famous is a Scientist? -- Famous to Those Who Know Us
• Emergence of Global Preferential Attachment From Local Interaction
• Finite size effects in Barabasi-Albert growing networks
• Emergent Network Modularity
• Sublinear but Never Superlinear Preferential Attachment by Local Network Growth
• Fame Emerges as a Result of Small Memory
• Highly Dispersed Networks Generated by Enhanced Redirection
• Sustainable growth in complex networks
• Highly Dispersed Networks
• Greedy Connectivity of Geographically Embedded Graphs
• Growing Networks with Super-Joiners