Modulated scale-free network in Euclidean space
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A numerical study indicates that the random network grown by introducing at unit rate randomly selected nodes on the Euclidean space is scale free for all values of alpha>alpha(c) and the degree distribution decays stretched exponentially for the other values ofalpha.
Abstract
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(i) with a directed link of length l using a probability proportional to k(i)l(alpha). Our numerical study indicates that the network is scale free for all values of alpha>alpha(c) and the degree distribution decays stretched exponentially for the other values of alpha. The link length distribution follows a power law: D(l) approximately l(delta), where delta is calculated exactly for the whole range of values of alpha.
