Degree Distribution on a Random Network

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.

An Erdös-Rényi random graph is one chosen at random from all the graphs with a given number of nodes () and edges (). The degree of a vertex in such a graph follows a Poisson distribution with mean . The blue curve in the left plot is a continuous approximation of , where is the cumulative distribution function of a Poisson distribution with parameter . The red dots show the fraction of nodes of a particular graph with degree .

Contributed by: Jorge Villalobos (March 2011)
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.