Evan Martin (evan) wrote in evan_tech,
Evan Martin
evan
evan_tech

more on the degree distribution

As I've mentioned before, the LJ friends output data includes both outlinks and inlinks. The graph I showed before used all of this data. This is the top graph below.

The lower graph ignores the inlink data and generates it using the outlink data. This is more like the picture that a web crawler would have of the web, and what I was using after I saw that avva was ranked so high. It helps explain my latest results.

(Both graphs are chopped so that their axes are the same and so you can see the interesting bits.)



The user way out to the right in the lower graph? tsenft, the mystery high-scorer from before. This clearly indicates I need to crawl more data. :)
Subscribe

  • no go

    Two friends of mine were pretty enthusiastic about the Go language, so I tried writing a program in it yesterday. It is frustrating because despite…

  • playing with vala

    I actually was toying with making something like Vala back in college. It's pretty cute. Much like using the sane subset of C++, as you write code…

  • chromium.el

    This weekend I wrote some Emacs Lisp to write some utility functions I find useful for hacking on Chromium. It's fun to have a reason to use Lisp!…

  • Post a new comment

    Error

    switch
    default userpic
    When you submit the form an invisible reCAPTCHA check will be performed.
    You must follow the Privacy Policy and Google Terms of use.
    Help
  • 1 comment