1. 06 May, 2011 1 commit
    • Tiago Peixoto's avatar
      Improve price_network() seeding semantics · c11b6af7
      Tiago Peixoto authored
      Now, if 'm' is larger than the seed graph, it is set to the size of the
      seed graph, and is increased progressively until it matches the desired
      value. This removes the need to start with a random seed graph of the
      appropriate size.
      
      This also includes modifications which make the code more robust
      against parameter choices which don't make much sense, e.g. lead to
      negative probabilites.
      c11b6af7
  2. 06 Mar, 2011 1 commit
  3. 02 Mar, 2011 1 commit
  4. 10 Feb, 2011 1 commit
  5. 21 Dec, 2010 1 commit
  6. 13 Nov, 2010 3 commits
  7. 04 Oct, 2010 1 commit
  8. 13 Jul, 2010 1 commit
    • Tiago Peixoto's avatar
      Change histogram binning semantics · 31791c81
      Tiago Peixoto authored
      Now the meaning of the bin edges given to the several histogram
      functions are the same as in numpy/scipy. This means that the last bin
      edge represents an upper bound on the last bin.
      31791c81
  9. 21 May, 2010 1 commit
  10. 03 May, 2010 3 commits
  11. 07 Mar, 2010 2 commits
  12. 20 Feb, 2010 4 commits
    • Tiago Peixoto's avatar
      Fix doctests · 33f7f0bb
      Tiago Peixoto authored
      This fixes the expected values for several doctests, after
      random_graph() re-factoring.
      33f7f0bb
    • Tiago Peixoto's avatar
      Refactor random_graph() · 1f28345e
      Tiago Peixoto authored
      Now the degree sequence is verified with Erdös-Gallai inequalities, and
      the edges are connected in a deterministic fashion. The edges then are
      rewired with the random_rewire() function.
      1f28345e
    • Tiago Peixoto's avatar
      Include probabilistic random_rewire() strategy · 64cb52b3
      Tiago Peixoto authored
      This includes also some internal refactoring, and bug fixes.
      64cb52b3
    • Tiago Peixoto's avatar
      Refactor random_rewire() · b678e65a
      Tiago Peixoto authored
      This extensively modifies the random_rewire() algorithm, so that only
      either the source or the edge of each edge is rewired (not both, as
      previously), and no parallel edges are created during the algorithm (if
      desired).
      
      The new version is much faster, and never gets stuck. However, more than
      one run may be necessary in order to obtain a uniform shuffling.
      b678e65a
  13. 28 Jan, 2010 1 commit
  14. 10 Jan, 2010 1 commit
  15. 23 Dec, 2009 1 commit
  16. 22 Dec, 2009 3 commits
  17. 06 Dec, 2009 2 commits
  18. 01 Dec, 2009 1 commit
  19. 05 Nov, 2009 1 commit
  20. 05 Oct, 2009 1 commit
  21. 06 Sep, 2009 1 commit
  22. 03 Sep, 2009 1 commit
  23. 27 Aug, 2009 1 commit
  24. 17 Aug, 2009 1 commit
  25. 07 Aug, 2009 1 commit
  26. 04 Aug, 2009 2 commits
  27. 02 Aug, 2009 1 commit
  28. 15 Jul, 2009 1 commit
    • Tiago Peixoto's avatar
      Improve correlated graph generation · e1dd1665
      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.
      e1dd1665