[graph-tool] n_iter with parallel edges allowed
Tiago de Paula Peixoto
tiago at skewed.de
Thu Jul 23 10:05:19 CEST 2020
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 Markov chain to saturate? Is
> there a rule of thumb for choosing n_iter when the scaling index of
> the power-law and the graph size are given?
Unfortunately, there is no known rule of thumb to know how fast the
chain mixes. My inclination is to say that 1000 sweeps is often enough,
but I would encourage you to experiment and draw your own conclusions.
Tiago de Paula Peixoto <tiago at skewed.de>
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 833 bytes
Desc: OpenPGP digital signature
More information about the graph-tool