How to create random graph?

100 visualizaciones (últimos 30 días)
Deepthi B
Deepthi B el 10 de Mayo de 2021
Comentada: Christine Tobler el 20 de Dic. de 2021
Hi ,
I want to check whether the network that I have obtained is a small world network or not. For that I have to find out the clustering coefficient and shortest path length of a random network with the same number of nodes and links in my network. Is it possible to find out?

Respuesta aceptada

Christine Tobler
Christine Tobler el 10 de Mayo de 2021
You can use
s = randi(n, e, 1);
t = randi(n, e, 1);
G = graph(s, t, [], n);
which will give you a graph with n nodes and e edges. Note that G may have multiple edges connecting the same two nodes, and may also have self-loops (edges connecting a node to itself). If you don't want repeating edges, use the following instead:
G = graph(true(n)); % Self-loops are possible
%G = graph(true(n), 'omitselfloops'); % Alternative without self-loops
p = randperm(numedges(G), e);
G = graph(G.Edges(p, :));
  5 comentarios
Norbert Cyran
Norbert Cyran el 19 de Dic. de 2021
Why are you generating true matrix for nodes and random values for edges??
Christine Tobler
Christine Tobler el 20 de Dic. de 2021
Hi Norbert,
The true(n) matrix is an adjacency matrix that contains all possible edges in the graph (omitting self-loops or not depending if that option is used or not). Then, I'm choosing a random subset of those edges using the randperm function.

Iniciar sesión para comentar.

Más respuestas (1)

Deepthi B
Deepthi B el 13 de Mayo de 2021
Thank You

Categorías

Más información sobre Graph and Network Algorithms 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!

Translated by