GitLab

This fixes a bug in the "correlated" mode in random_rewire().

This implements a general "blockmodel" generation / rewiring algorithm,
using Gibbs acceptence / rejection sampling (a.k.a Metropolis-Hastings).

This also implements some optimizations in the rewiring code, which
makes it more efficient on filtered graphs.

This introduces several simplifications and corrections to the graph
rewire algorithm, to guarantee unbiased sampling.

Now a move is outright rejected if it produces a
self-loop/parallel-edge, instead of retried. This also adds a
"non-sweep" mode, where edges are rewired randomly, possibly with
repetition.

The edge moves are now simplified to the target of the edges only,
since swaping sources is redundant.

The number of iterations can now be explicitly modified, so it is not
necessary to call the function more than once, and it is emphasized in
the documentation that only after sufficiently many iterations can the
graph be guaranteed to be fully mixed.

This makes the calculation coherent with the definition given in the
documentation.

This fixes a leftover bug from the removal of the 'core' submodule.

Added more DOI links to references, and other cosmetic changes.

absolute_trust() is now called trust_transitivity(), and the whole
trust matrix can now be efficiently calculated.

This fixes the expected values for several doctests, after
random_graph() re-factoring.

Now use _best weights_ to in-neighbours to determine trust, to avoid path
multiplicity catastrophe.

This also adds the epsilon parameter, which drops paths with weight
below this value.

Small fixes of some examples in the docstrings.

Use the original, simpler, path weight calculation.

This fixes how paths are weighted in the absolute_trust algorithm.

This completes all the documentation up to this point.

This dumps the random-path approach, and implements a deterministic,
priority queue algorithm.

Path sampling is done using different bias, and the edge sampling is now
done correctly. There is now only one parameter 'n_iter' which replaces
'min/max_iter' and 'epslon'.

The RNG object must be passed by _reference_ not by value, as is the
default! Otherwise the RNG state does not change...

This modified several docstrings and introduces a quick-start guide.

Now paths are weighted according to their trust value until the last
hop, and paths are not counted twice.