Abstract In this article, we consider mirror nodes, which are widely used to reduce local burden, and present two models that are practical for the Internet and probably some other networks. One model introduces an upper limit to the number of links that a node can have, beyond which the node will share the total links with a newly introduced one. Similarly, in the second model, if the number of links exceeds a limit, a new node will be introduced. Unlike the first model, the new node shares with the old one the chance of receiving new links but not the existing links. These models are analytically treated, and from the degree distribution, we can see that the number of nodes with medium links (half the upper limit) increases at the expense of the loss of highly connected nodes. By reducing the burden, this may improve the robustness of the networks.
Received: 16 July 2003
Revised: 09 September 2003
Accepted manuscript online:
A universal function of creep rate Li Jing-Tian (李菁田), Rong Xi-Ming (荣曦明), Wang Jian-Lu (王建录), Zhang Bang-Qiang (张邦强), Ning Xi-Jing (宁西京). Chin. Phys. B, 2015, 24(9): 093401.
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.