# Random networks generation

Jump to navigation
Jump to search

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

## popular random network models

### random

Generates a random network where a link between two nodes exists with probability p.

- node count: the number of nodes
- probability: probability p
- directed: select to generate directed network

This random network model is usually referred to as G(n,p) model.

### preferential

Generates a random network with preferred connections. A new node connects more likely to a existing node with high degree. Generated networks may contain multi-links and self-loops.

- node count: the number of nodes
- outdegree: the number of edges a new node creates
- directed: select to generate directed network

This random network model is usually referred to as scale free model.

### small world

Generates a random network with neighborhood radius r and probability of edge rewiring p.

- node count: the number of nodes
- probability: probability p
- radius: neighborhood radius r

This random network model is usually referred to as small world model.

## models peculiar to graph drawing

### planar

Generates a planar graph by randomly distributing points in the plane and applying a Delaunay triangulation.

- node count: the number of nodes