[Jung-support] [jung - Open Discussion] about probability of creating an edge in Bara

[SourceForge.net <no...@so...>]

Read and respond to this message at: 
https://sourceforge.net/forum/message.php?msg_id=3706139
By: nobody

Recently I checked the source code of BarabasiAlbertGenerator.java.

"The At a given timestep, the probability p of creating an edge between an existing
vertex v and the newly added vertex is
 p = (degree(v) + 1) / (|E| + |V|);
"

This method is extended from original one
p = degree(v) / |E|
in Barabasi’s paper


However, I think above expression is correct only for directed graph, and for
the undirected graph the computation method should be

p = (degree(v) + 1) / (2*|E| + |V|);

and it is original form is  p = degree(v) / 2*|E|

Anyone also check this problem?

______________________________________________________________________
You are receiving this email because you elected to monitor this forum.
To stop monitoring this forum, login to SourceForge.net and visit: 
https://sourceforge.net/forum/unmonitor.php?forum_id=252062