2000 character limit reached
Non-Universality in Semi-Directed Barabasi-Albert Networks (1205.0149v1)
Published 1 May 2012 in physics.comp-ph, cs.SI, and physics.soc-ph
Abstract: In usual scale-free networks of Barabasi-Albert type, a newly added node selects randomly m neighbors from the already existing network nodes, proportionally to the number of links these had before. Then the number N(k) of nodes with k links each decays as 1/kgamma where gamma=3 is universal, i.e. independent of m. Now we use a limited directedness in the construction of the network, as a result of which the exponent gamma decreases from 3 to 2 for increasing m.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.