Inside the Voynich Network: graph analysis

[quimqu]

The name is "peper" not "pepper". I know because I made the same mistake...

Corrected, thank you.

Regarding the rest of comments, please note that I do count how often the pair appears, not just yes/no. You’re right, the graph can get some noise from random co-ocurrences, especially with a small window. I already drop all single links to clean it a bit, but yeah, it’s still kind of raw.

Your idea about checking if pairs appear more often than expected from random frequency (like an order-0 markov baseline) makes total sense. That would give a cutoff to keep only the meaningful edges. I’ll probably try that next (stay tunned  )

And true, the Voynich has fewer different words, so the average degree goes up a bit by definition. That’s why I focus more on the shape of the distributions and on modularity, not the absolute numbers.

Anyway, what’s cool is that both the Voynich and Timm graphs end up with similar heavy-tail shape as real texts (You are not allowed to view links. Register or Login to view.): not random at all, just a bit less connected. So yeah, your idea is spot on, I’ll test that. Thanks!