Erdos-Renyi Random Graph

Versione 1.0.0.0 (2,86 KB) da Pablo Blinder
Random graph generation.
4.0
(13)
8,7K download
Aggiornato 25 gen 2005

Nessuna licenza

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)

Cita come

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

Compatibilità della release di MATLAB
Creato con R13
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Categorie
Scopri di più su Graph and Network Algorithms in Help Center e MATLAB Answers
Tag Aggiungi tag

Community Treasure Hunt

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

Start Hunting!

Versione Pubblicato Note della release
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