> Hi, sorry for letting you misunderstand. What I am not sure is that why at > last multiply > > m since I thought Ki/2m * Kj/2m * 2v was the last result. Thanks! You are generating m edges, and each generated edge falls between vertices i and j with probability Ki/2m * Kj/2m * 2. Therefore, the probability of finding at least a single edge (generated in any of the m steps) is equal to m * (Ki/2m * Kj/2m * 2), that is, Ki*Kj/2m.
-- T. _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
