1. 23 Nov, 2020 1 commit
  2. 08 Jun, 2020 1 commit
  3. 22 Mar, 2020 1 commit
  4. 05 Jun, 2019 1 commit
  5. 14 Feb, 2018 1 commit
  6. 19 Nov, 2017 1 commit
  7. 02 Oct, 2017 1 commit
  8. 29 Sep, 2017 1 commit
  9. 01 Jan, 2017 1 commit
  10. 04 Dec, 2016 1 commit
  11. 01 Jan, 2016 1 commit
  12. 26 Sep, 2015 1 commit
  13. 17 Sep, 2015 1 commit
  14. 16 Jul, 2015 1 commit
  15. 15 Jul, 2015 2 commits
  16. 23 Apr, 2015 1 commit
  17. 29 Jan, 2015 1 commit
  18. 08 Jan, 2015 1 commit
  19. 14 Mar, 2014 1 commit
  20. 03 Feb, 2014 1 commit
    • Tiago Peixoto's avatar
      Improve speed of random_rewire() when parallel edges are not allowed · 0e21f9a5
      Tiago Peixoto authored
      This also changes the semantics of random_rewire() when parallel edges
      / self loops are forbidden, but the initial graph contains them. Now,
      instead of throwing an exception, the rewiring is attempted, with no
      new parallel edges / self-loops being created. Under some
      circumstances, if the degree sequence is graphical, eventually the
      graph can become simple after sufficiently many sweeps.
      0e21f9a5
  21. 03 Jan, 2014 1 commit
  22. 02 Jan, 2014 1 commit
  23. 21 Dec, 2013 1 commit
  24. 10 Nov, 2013 1 commit
  25. 25 Apr, 2013 1 commit
  26. 11 Feb, 2013 1 commit
  27. 10 Jan, 2013 1 commit
  28. 06 Jan, 2013 1 commit
  29. 26 Dec, 2012 1 commit
  30. 02 Aug, 2012 1 commit
  31. 03 Jun, 2012 1 commit
  32. 02 May, 2012 1 commit
  33. 29 Apr, 2012 3 commits
  34. 14 Sep, 2011 1 commit
  35. 02 Sep, 2011 1 commit
  36. 26 Aug, 2011 1 commit
  37. 24 Aug, 2011 1 commit
    • Tiago Peixoto's avatar
      Several improvements to random_rewire() / random_graph() · 8240714e
      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
      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.
      8240714e