Random acyclic networks

Simple item page
dc.creatorKarrer, Brian
dc.creatorNewman, M. E. J.
dc.date2009-02-23
dc.date.accessioned2026-07-07T12:54:43Z
dc.date.available2026-07-07T12:54:43Z
dc.descriptionDirected acyclic graphs are 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.
dc.description4 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0902.4013
dc.identifierhttp://arxiv.org/abs/0902.4013
dc.identifierPhys. Rev. Lett. 102, 128701 (2009)
dc.identifierdoi:10.1103/PhysRevLett.102.128701
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/224030
dc.subjectPhysics and Society
dc.subjectStatistical Mechanics
dc.subjectData Analysis, Statistics and Probability
dc.titleRandom acyclic networks
dc.typetext

Files

Collections

arXiv