Erdos-Renyi Random Graph

Version 1.0.0.0 (2.86 KB) by Pablo Blinder
Random graph generation.
4.0
(13)
8.6K Downloads
Updated 25 Jan 2005

No License

The Erdos-Renyi (Erdos and Renyi, 1959) is the first ever proposed algorithm for the formation of random graphs. It selects with equal probability pairs of nodes from the graph set of nodes and connects them with a predefined probability.

To rewire, with probability (p=0.01) a 100 vertex regular graph (vertex deg=4):
>>G=erdosRenyi(40,0.01,4);

To see display the graph issue:
>>plotGraphBasic(G,6,1);

6 is the marker size. 1 tells function to add labels (0 disables labbeling)

Cite As

Pablo Blinder (2024). Erdos-Renyi Random Graph (https://www.mathworks.com/matlabcentral/fileexchange/4206-erdos-renyi-random-graph), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R13
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Graph and Network Algorithms in Help Center and MATLAB Answers

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Version Published Release Notes
1.0.0.0

Major changes
i) stablish initial node degree for the regular lattice.
ii) Implements new data structure for storing graph.
iii) Bug fixed: missing vertex in display