A random network is grown by introducing at unit rate randomly selected nodes on the Euclidean space. A node is randomly connected to its ith predecessor of degree kᵢ with a directed link of length l using a probability proportional to kᵢl^α. Our numerical study indicates that the network is scale free for all values of α>αc and the degree distribution decays stretched exponentially for the other values of α. The link length distribution follows a power law: D(l)~l^δ, where δ is calculated exactly for the whole range of values of α.
No takes yet. Share an insight, caveat, or question.
Manna et al. (2002) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: