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

  • memcache job offers

    I get occasional recruiter spam that specifically calls out "my work on memcached". This is pretty funny because all I did was make some trivial…

  • application stack

    "Put yourself in 1995. I'm going to tell the you of 1995 that in 2010, there will be a software platform with the following properties:" Luis Villa…

  • bsd license advertising

    Did you know that the 3-clause BSD (that is, the one with the "advertising" clause stripped) license still has an advertising requirement? Read it…

  • Post a new comment

    Error

    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.
  • 1 comment