i want to get adjacency matrix of a network

Question

mks 2023-7-30

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/2002377-i-want-to-get-adjacency-matrix-of-a-network

评论： Steven Lord 2023-7-30

i have write this but is not running

clc;
clear all
n=10;
p=0.4;
adj_matrix = generate_adjacency_matrix(n, p);
function adj_matrix = generate_adjacency_matrix(n, p)
% Initialize an n x n matrix with all zeros
adj_matrix = zeros(n, n);
% Loop through all possible node pairs
for i = 1:n
    for j = 1:n
        % Skip diagonal elements (no self-loops)
        if i == j
            continue;
        end
        
        % Generate a random number between 0 and 1
        random_number = rand();
        
        % If the random number is less than p, add a link between nodes i and j
        if random_number < p
            adj_matrix(i, j) = 1;
            adj_matrix(j, i) = 1; % Since it's an undirected network
        end
    end
end
end
disp(adj_matrix);

1 个评论
显示 -1更早的评论隐藏 -1更早的评论

Bruno Luong 2023-7-30

编辑：Bruno Luong 2023-7-30

@MD KAUSAR SK The answer thread is unlike undirected graph, you should not duplicate it https://www.mathworks.com/matlabcentral/answers/2002382-network-adjacency-matrix-for-connecting-n-node-with-probability-p?s_tid=srchtitle

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Matt J 2023-7-30

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/2002377-i-want-to-get-adjacency-matrix-of-a-network#answer_1280782

编辑：Matt J 2023-7-30

在 MATLAB Online 中打开

Easier:

function adj_matrix = generate_adjacency_matrix(n, p)
  adj_matrix=triu(rand(n)<p,1);
  
  adj_matrix=adj_matrix+adj_matrix'; % Since it's an undirected network
end

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

Answer 2

Steven Lord 2023-7-30

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/2002377-i-want-to-get-adjacency-matrix-of-a-network#answer_1280797

在 MATLAB Online 中打开

If you want to generate both the graph object and its adjacency matrix, tell MATLAB to build the graph using just the upper triangular part of the random matrix.

n = 10;
p = 0.6;
A = rand(n) < p;
G = graph(A, 'upper');
adj = full(adjacency(G))
adj = 10×10
     0     0     1     0     0     1     0     1     0     0
     0     1     0     1     1     1     0     1     1     1
     1     0     1     1     0     1     0     1     0     1
     0     1     1     1     1     1     0     1     1     1
     0     1     0     1     1     1     0     1     1     1
     1     1     1     1     1     1     0     0     1     0
     0     0     0     0     0     0     0     1     0     1
     1     1     1     1     1     0     1     1     0     0
     0     1     0     1     1     1     0     0     1     1
     0     1     1     1     1     0     1     0     1     1
check = triu(A)+triu(A, 1).'
check = 10×10
     0     0     1     0     0     1     0     1     0     0
     0     1     0     1     1     1     0     1     1     1
     1     0     1     1     0     1     0     1     0     1
     0     1     1     1     1     1     0     1     1     1
     0     1     0     1     1     1     0     1     1     1
     1     1     1     1     1     1     0     0     1     0
     0     0     0     0     0     0     0     1     0     1
     1     1     1     1     1     0     1     1     0     0
     0     1     0     1     1     1     0     0     1     1
     0     1     1     1     1     0     1     0     1     1
isequal(adj, check)
ans = logical
   1