c*********n
发帖数: 128 | 1 A graph {E, V}. The edges of the graph are assigned randomly between
vertices.
For two random vertices i and j, with degrees k_i and k_j, respectively,
what is the probablity that there is an edge between them?
I think the result is
k_i*k_j/m
where m is the total number of edges in the graph.
For any edge E, the probability that E is connecting vertices j is
k_j/m
Considering i is connected with k_i edges, then the probability is
k_i * (k_j/m)
But some paper gives
k_i*k_j/(2m)
What do you guys s | c*********n
发帖数: 128 | 2 没人给指点一下？
【在 c*********n 的大作中提到】
: A graph {E, V}. The edges of the graph are assigned randomly between
: vertices.
: For two random vertices i and j, with degrees k_i and k_j, respectively,
: what is the probablity that there is an edge between them?
: I think the result is
: k_i*k_j/m
: where m is the total number of edges in the graph.
: For any edge E, the probability that E is connecting vertices j is
: k_j/m
: Considering i is connected with k_i edges, then the probability is
| c*********n
发帖数: 128 | 3 Thank you for your reply.
I am talking about undirected graph, for sure. |
|
