Random Acyclic Networks
This Demonstration generates random acyclic graphs from user-specified degree distribution and user-specified temporal attachment preferences. You select the number of nodes on the graph. You select the distribution family from which the out-degree distribution will be drawn as well as the parameters of that distribution family. You also select how edges from a source node should select their target. You can choose to select all predecessor nodes equally based on their in-degree, give preference to newer nodes, give preference to older nodes, or give preference to nodes in the middle. A "connectivity parameter" permits you to alter the strength of this preference. The "variant generator" slider lets you create a variety of networks, all of which have the same degree distribution. You also select how the vertices of the final graph are displayed.[more]
This Demonstration and the program behind it can be used to explore the sort of processes that might account for the structure of discovered acyclic graphs such as precedent networks.[less]
The algorithm for generating the graph comes in part from .
 M. Karrer and M. E. J. Newman, "Random Acyclic Networks," Physical Review Letters 102, 2009 pp. 128701(1)–128701(4).