How to create random graph of n vertices with c fixed neighbours in MATLAB?
4 visualizaciones (últimos 30 días)
Mostrar comentarios más antiguos
I have written a code in MATLAB that allows me to generate a random graph of n vertices, each with c fixed neighbours without self connections (note the edges are directed, thus a connected to b does not imply b connected to a). However, it is terribly inefficient, especially when I need to it work on magnitudes such as n = 10000 and c = 1000. I was wondering if anyone could optimize it big time, or suggest anything constructive?
Thanks!
function [M]=matsrand(n,c)
MM=0; %arbitrary starting value
while MM ~=n*c
M = sparse(zeros(n));
ctin = zeros(1,n);
for i=1:n
rp = randperm(n); %generate vector of the randomly permuted order of n vertices
rp(rp==i)=[]; %get rid of itself to avoid self connection
noconnect=find(ctin(:)>=c); %generate list that i is not allowed to connect to
where=ismember(rp,noconnect); %returns 1 to the subset noconnect in rp
noconnectind=find(where);
rp(noconnectind(:))=[]; %remove the neurons i is not allowed to connect to
if length(rp)<c
break
else
r=rp(1:c);
end
M(i,r)=1;
ctin(r)=ctin(r)+1;
end
MM=sum(ctin);
end
3 comentarios
Matt Fig
el 8 de Ag. de 2012
Thanks! I see I misread your question. I thought you said that it was slow with n=c=1000, but now I see my mistake.
Respuestas (1)
Ver también
Categorías
Más información sobre Sequence and Numeric Feature Data Workflows en Help Center y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!