Random Graph Models

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.

A random (or pseudorandom) graph is a graph in which properties such as the number of graph vertices and graph edges are determined in some random way. Random graph models are generated to analyze and model component sizes, degree distributions, power laws, and so on. This Demonstration shows five types of random graphs to be used as optional distributions to the command RandomGraph introduced in Mathematica 8. You can also vary the values of their specific parameters. The coloring of the vertices is also random.

Contributed by: Jaime Rangel-Mondragon (August 2011)
Based on work by: Roger Germundsson, Charles Pooh, Jae Bum Jung, Yan Zhuang, Henrik Tidefelt, and Tim Shedelbower
Open content licensed under CC BY-NC-SA




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.