 02 May, 2012 1 commit


Tiago Peixoto authored

 26 Aug, 2011 1 commit


Tiago Peixoto authored
This implements a general "blockmodel" generation / rewiring algorithm, using Gibbs acceptence / rejection sampling (a.k.a MetropolisHastings). This also implements some optimizations in the rewiring code, which makes it more efficient on filtered graphs.

 24 Aug, 2011 1 commit


Tiago Peixoto authored
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 selfloop/paralleledge, instead of retried. This also adds a "nonsweep" 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.

 10 Feb, 2011 1 commit


Tiago Peixoto authored

 13 Nov, 2010 1 commit


Tiago Peixoto authored

 25 Jul, 2010 1 commit


Tiago Peixoto authored
This enables support for older versions of GCC (>=4.2), by falling back to the boost tr1 implementation when the GCC version is less than 4.4.

 03 May, 2010 1 commit


Tiago Peixoto authored
Vectors are used now instead of unordered_sets, which dramatically improves performace.

 07 Mar, 2010 1 commit


Tiago Peixoto authored

 20 Feb, 2010 1 commit


Tiago Peixoto authored
Now the degree sequence is verified with ErdösGallai inequalities, and the edges are connected in a deterministic fashion. The edges then are rewired with the random_rewire() function.

 06 Sep, 2009 1 commit


Tiago Peixoto authored

 04 Aug, 2009 1 commit


Tiago Peixoto authored
Target degrees were not being sampled correctly from their probability.

 15 Jul, 2009 1 commit


Tiago Peixoto authored
random_graph() now uses a modified algorithm for generation of correlated graphs, which is more efficient. Instead of giving a function which returns a sample of the correlated target degree, the user must give a function which will just compute its probability. This probability will then be used to choose the edges.

 23 May, 2009 1 commit


Tiago Peixoto authored
The generators from boost::random seem to have a bug which causes them to be biased. The generators from tr1::random seem to be in better shape. See: http://thread.gmane.org/gmane.comp.lib.boost.user/48006

 10 Mar, 2009 1 commit


Tiago Peixoto authored
Thins changes the graph filtering code slightly to wrap graph types with GraphWrap, which automatically updates the edge index list when edges are removed and added to the graph. This also changes how graphs are passed to algorithms, which is now by reference instead of pointer. (hence this touches lots of code, but changes are trivial)

 27 Jul, 2008 1 commit


Tiago Peixoto authored
Fix possible deadlock condition in random graph generation with no_parallel and/or no_self_loops.

 06 Apr, 2008 1 commit


Tiago Peixoto authored
It is now much simpler, and works better.
