[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Definition of Modularity
|
From: |
Tamás Nepusz |
|
Subject: |
Re: [igraph] Definition of Modularity |
|
Date: |
Wed, 13 Feb 2013 22:59:19 +0100 |
> 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.