Synchronous and Asynchronous Recursive Random Scale-Free Nets

Abstract

We investigate the differences between scale-free recursive nets constructed by a synchronous, deterministic updating rule (e.g., Apollonian nets), versus an asynchronous, random sequential updating rule (e.g., random Apollonian nets). We show that the dramatic discrepancies observed recently for the degree exponent in these two cases result from a biased choice of the units to be updated sequentially in the asynchronous version.

References in corpus (13)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• The large-scale organization of metabolic networks
• Evolution of networks
• The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
• Pseudofractal Scale-free Web
• Classification of scale-free networks
• Maximal planar networks with large clustering coefficient and power-law degree distribution
• Self-similar disk packings as model spatial scale-free networks
• Recursive graphs with small-world scale-free properties
• High dimensional random Apollonian networks
• Deterministic Small-World Networks
• Random Apollonian Networks

Cited by in corpus (10)

• High dimensional random Apollonian networks
• Evolving Apollonian Networks with Small-world Scale-free topologies
• Random Sierpinski network with scale-free small-world and modular structure
• Evolving small-world scale-free networks consist of cliques
• Evolving small-world networks with geographical attachment preference
• A unified model for Sierpinski networks with scale-free scaling and small-world effect
• Recursive weighted treelike networks
• Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks
• Infinitely Robust Order and Local Order-Parameter Tulips in Apollonian Networks with Quenched Disorder
• Phase transition in the rich-get-richer mechanism due to finite-size effects