I Made a Graph of Wikipedia... This Is What I Found

Oh, and it just so happens that these articles and these four articles alone make up the entirety of community number 42, so now we know that in the vast majority of In some cases there is a path between two articles and it will almost always have eight links or less, but

what

is the average path length between two articles? To test

this

, I randomly selected 10,000 pairs of articles and calculated the average path length for each of them. The path length between two items was 4.8. It is worth noting that about 8% of the time a path did not exist, this is consistent with how we

found

that about 8% of the items were unreachable in the main graph.

You will also notice that paths with lengths less than three and greater than eight were extremely rare in In fact, only one path out of the 10,000 tested had a length of 10, this

made

me wonder

what

is the longest path between two articles on Wikipedia now As I already mentioned, finding two items whose shortest path between them is 10 or more is extremely rare as it only happens around 0.01. Therefore, % of the time, a path with a length of 15 would be incredibly rare. A route with a length of 30 would seem practically impossible, but what if I told you that the longest route I

found

has over 60 links?

Sorry, I said 60. I meant 160 166 to be exact, this path starts in the article of athletics in the 1953 Arab games and ends in a list of roads number 999. The reason why this path is so long is because The only way to get to the list of highways numbered 999. is to start at the list of highways numbered 825 and then tediously click on each successive number until you reach 999. It takes a long time, but it's the only way to connect these two items. . I guess in some ways it's like a real highway. I can't say for sure that this is the longest path on Wikipedia, as it is not feasible to calculate every path, but it is certainly one of the longest.

Those were the most interesting things I found in the Wikipedia graph, but I wanted to talk about them. one last thing, one last item, actually, at first glance, Fanta cake looks like a normal short lb item, but there's actually something quite special about it. You see that it only has a Fanta cukin link, but when you click on it, it actually redirects to itself. There are redirect pages on Wikipedia to help people find pages more easily, for example if I search for USA it automatically redirects me to the USA article. The US page is just a redirect page.

In Fukin's case, it just redirects to Fanta Cake, but for some reason. The only link in the Fanta pie is the Fanta cukin which creates a loop of its own. Technically speaking, the Fanta cake is actually a dead end because, as I mentioned above, there are no paths to any other items. I like to call this a disguised dead end because it looks at first like it has a link, but upon closer inspection it actually just links to itself, but that's not what makes Fant cake unique; There are actually a handful of Disguise dead ends. What makes Fanta cake special is that it is also an orphan page, making it a page in disguise. dead end orphan, the only one of its kind, at least it was when I started making this video, but it has since been edited and has links to other pages, it's for the same reason that when you watch this video, a lot of the information can It may be a little incorrect or outdated, but I don't think that's necessarily a bad thing.

In fact, that's the beauty of Wikipedia: it's an ever-growing, ever-changing network of information, a place where anyone has the power to free an article from a lonely existence. Thanks to my sponsors on GitHub who support the channel and allow me to make videos like this, which required a lot of time and effort by sponsoring me on GitHub. You get access to the code for all my videos, including this one. Link in description. If you're interested, if you

made

it this far and enjoyed the video, consider subscribing and leaving a like because it really helps, thanks for watching.