Two-level relationships and Scale-Free Networks

Abstract

Through the distinction between ``real'' and ``virtual'' links between the nodes of a graph, we develop a set of simple rules leading to scale-free networks with a tunable degree distribution exponent. Albeit sharing some similarities with preferential attachment, our procedure is both faster than a naïve implementation of the Barabási and Albert model and exhibits different clustering properties. The model is thoroughly studied numerically and suggests that reducing the set of partners a node can connect to is important in seizing the diversity of scale-free structures.

References in corpus (10)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The Web of Human Sexual Contacts
• Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
• Organization of Growing Random Networks
• Measuring preferential attachment for evolving networks
• Growing networks with local rules: preferential attachment, clustering hierarchy and degree correlations
• Characterization and Modeling of weighted networks
• Generic scale of the "scale-free" growing networks
• Effect of the accelerating growth of communications networks on their structure