Random Acyclic Networks

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

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.


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.


Contributed by: Seth J. Chandler (May 2009)
Open content licensed under CC BY-NC-SA



The algorithm for generating the graph comes in part from [1].


[1] M. Karrer and M. E. J. Newman, "Random Acyclic Networks," Physical Review Letters 102, 2009 pp. 128701(1)–128701(4).

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.