Scale-free network on a vertical plane

Abstract

A scale-free network is grown in the Euclidean space with a global directional bias. On a vertical plane, nodes are introduced at unit rate at randomly selected points and a node is allowed to be connected only to the subset of nodes which are below it using the attachment probability: ${\pi }_i(t)\sim k_i(t){\ell }^{\alpha }$. Our numerical results indicate that the directed scale-free network for $\alpha =0$ belongs to a different universality class compared to the isotropic scale-free network. For $\alpha <{\alpha }_c$ the degree distribution is stretched exponential in general which takes a pure exponential form in the limit of $\alpha \to -\infty$. The link length distribution is calculated analytically for all values of $\alpha$.

4 pages, 4 figures

References in corpus (13)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Lethality and centrality in protein networks
• The structure of scientific collaboration networks
• The diameter of the world wide web
• Degree Distributions of Growing Networks
• Robust Patterns in Food Web Structure
• Scale-free Networks on Lattices
• Modulated Scale-free Network in the Euclidean Space
• Connectivity Distribution of Spatial Networks
• Clustering properties of a generalised critical Euclidean network
• Scale-free Network on Euclidean Space Optimized by Rewiring of Links

Cited by in corpus (8)

• Impacts of preference and geography on epidemic spreading
• Geographical networks evolving with optimal policy
• A directed network model for World-Wide Web
• Impact of network structure on the capacity of wireless multihop ad hoc communication
• Numerical evaluation of the upper critical dimension of percolation in scale-free networks
• Phase transitions in Ising model on a Euclidean network
• Limit theorems for random spatial drainage networks
• Spectral properties of adjacency and distance matrices for various networks