摘要翻译：
我们研究有向运输网络的增长，如食物网，其中链路携带资源。我们提出了一个新节点（或物种）优先依附于已有节点的生长过程，该过程中，新节点（或物种）高度依赖于已有节点（以食物网的语言来说，猎物数量）和高度依赖于已有节点（或捕食者数量）。这个方案，我们称之为反向优先附加，旨在最大化每个新节点可用的资源数量。我们证明了在大的外部度下，外部度（捕食者）分布至少以指数速度衰减，并且在指数分布和delta函数之间是连续可调的。在大网络极限下，种群（猎物）分布是泊松分布。
---
英文标题：
《Network Growth with Preferential Attachment for High Indegree and Low
  Outdegree》
---
作者：
Volkan Sevim, Per Arne Rikvold
---
最新提交年份：
2008
---
分类信息：

一级分类：Physics        物理学
二级分类：Statistical Mechanics        统计力学
分类描述：Phase transitions, thermodynamics, field theory, non-equilibrium phenomena, renormalization group and scaling, integrable models, turbulence
相变，热力学，场论，非平衡现象，重整化群和标度，可积模型，湍流
--
一级分类：Quantitative Biology        数量生物学
二级分类：Populations and Evolution        种群与进化
分类描述：Population dynamics, spatio-temporal and epidemiological models, dynamic speciation, co-evolution, biodiversity, foodwebs, aging; molecular evolution and phylogeny; directed evolution; origin of life
种群动力学；时空和流行病学模型；动态物种形成；协同进化；生物多样性；食物网；老龄化；分子进化和系统发育；定向进化；生命起源
--

---
英文摘要：
  We study the growth of a directed transportation network, such as a food web, in which links carry resources. We propose a growth process in which new nodes (or species) preferentially attach to existing nodes with high indegree (in food-web language, number of prey) and low outdegree (or number of predators). This scheme, which we call inverse preferential attachment, is intended to maximize the amount of resources available to each new node. We show that the outdegree (predator) distribution decays at least exponentially fast for large outdegree and is continuously tunable between an exponential distribution and a delta function. The indegree (prey) distribution is poissonian in the large-network limit.
---
PDF链接：
https://arxiv.org/pdf/704.373