Physics – Condensed Matter – Statistical Mechanics
Scientific paper
2007-04-14
Physics
Condensed Matter
Statistical Mechanics
9 pages, 4 figures
Scientific paper
10.1140/epjb/e2007-00310-5
The "power of choice" has been shown to radically alter the behavior of a number of randomized algorithms. Here we explore the effects of choice on models of tree and network growth. In our models each new node has k randomly chosen contacts, where k > 1 is a constant. It then attaches to whichever one of these contacts is most desirable in some sense, such as its distance from the root or its degree. Even when the new node has just two choices, i.e., when k=2, the resulting network can be very different from a random graph or tree. For instance, if the new node attaches to the contact which is closest to the root of the tree, the distribution of depths changes from Poisson to a traveling wave solution. If the new node attaches to the contact with the smallest degree, the degree distribution is closer to uniform than in a random graph, so that with high probability there are no nodes in the network with degree greater than O(log log N). Finally, if the new node attaches to the contact with the largest degree, we find that the degree distribution is a power law with exponent -1 up to degrees roughly equal to k, with an exponential cutoff beyond that; thus, in this case, we need k >> 1 to see a power law over a wide range of degrees.
D'Souza Raissa M.
Krapivsky Paul. L.
Moore Cristopher
No associations
LandOfFree
The power of choice in network growth does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The power of choice in network growth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The power of choice in network growth will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-730420