Models and average properties of scale-free directed networks

Abstract

We extend the merging model for undirected networks by Kim et al. [Eur. Phys. J. B 43, 369 (2004)] to directed networks and investigate the emerging scale-free networks. Two versions of the directed merging model, friendly and hostile merging, give rise to two distinct network types. We uncover that some non-trivial features of these two network types resemble two levels of a certain randomization/non-specificity in the link reshuffling during network evolution. Furthermore the same features show up, respectively, in metabolic networks and transcriptional networks. We introduce measures that single out the distinguishing features between the two prototype networks, as well as point out features which are beyond the prototypes.

7 pages, 8 figures

References in corpus (9)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• The large-scale organization of metabolic networks
• Random graphs with arbitrary degree distributions and their applications
• Evolution of networks
• Specificity and stability in topology of protein networks
• Pattern Detection in Complex Networks: Correlation Profile of the Internet
• Self Organized Scale-Free Networks from Merging and Regeneration
• Networking genetic regulation and neural computation: Directed network topology and its effect on the dynamics

Cited by in corpus (5)

• Weighted network modules
• An SIS epidemic model with vaccination in a dynamical contact network of mobile individuals with heterogeneous spatial constraints
• Optimization and Scale-freeness for Complex Networks
• Scale-freeness for networks as a degenerate ground state: A Hamiltonian formulation
• Reachability and recoverability of sink nodes in growing acyclic directed networks