期刊
PHYSICAL REVIEW LETTERS
卷 102, 期 12, 页码 -出版社
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevLett.102.128701
关键词
-
资金
- National Science Foundation [DMS0804778]
- Direct For Mathematical & Physical Scien [0804778] Funding Source: National Science Foundation
- Division Of Mathematical Sciences [0804778] Funding Source: National Science Foundation
Directed acyclic graphs make up a fundamental class of networks that includes citation networks, food webs, and family trees, among others. Here we define a random graph model for directed acyclic graphs and give solutions for a number of the model's properties, including connection probabilities and component sizes, as well as a fast algorithm for simulating the model on a computer. We compare the predictions of the model to a real-world network of citations between physics papers and find surprisingly good agreement, suggesting that the structure of the real network may be quite well described by the random graph.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据