Erdos-Renyi Random Graph

Random graph generation.

Description

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)

• MATLAB release: MATLAB 6.5 (R13)

[lizhen you]

 

[roger lin]

 

[LIU Jie]

GOOD

[ziqiang zuo]

it is a good routine, but in the processof reconncetion, it permites a vertex to connect itself. To avoid this, I change the code :
 vToRec=nonAdj(ceil(rand*length(nonAdj))); to
 vToRec=vDisToRec;
    while vToRec==vDisToRec
          vToRec=nonAdj(ceil(rand*length(nonAdj)));
    end

[David]

Also the last line does not make the matrix symmetric. SInce you work on the upper triangle of the matrix, the easiest way to make the matrix symmetric is:
replace
A=A+fliplr((flipud(triu(A))));
with
A=A+A';

[A.Y.]

Good and working implementation. Might have been better if plotting function supports curved edges.