Thanks so much Tiago!
Sent with ProtonMail Secure Email.
‐‐‐ Original Message ‐‐‐
On Thursday, July 23, 2020 1:35 PM, Tiago de Paula Peixoto
wrote:
> Am 23.07.20 um 08:31 schrieb Snehal Shekatkar:
>
> > Sorry for bothering again. A small query: If the graph size is say
> > 10^4, and
Hi Tiago,
Sorry for bothering again. A small query: If the graph size is say 10^4, and
the degrees are drawn from the discrete-power law or some other right-skewed
distribution for which the second moment diverges, would n_iter = 1000 be
enough for the Markov chain to saturate? Is there a rule
Hello,
If I compare the implementation for the probability in the
graph/generation/graph_price.hh
which is (can be found in multiple places)
p = pow(Deg()(w, g) + c, gamma);
With what is written in the documentation
Am 23.07.20 um 08:31 schrieb Snehal Shekatkar:
> Sorry for bothering again. A small query: If the graph size is say
> 10^4, and the degrees are drawn from the discrete-power law or some
> other right-skewed distribution for which the second moment diverges,
> would n_iter = 1000 be enough for the
