mplorentz on Nostr: Finally got around to reading this “Navigating the social graph” paper from ...
Finally got around to reading this “Navigating the social graph” paper from pippellia (npub176p…vgup). I did not know about adjacency matrices. Is anyone representing the follow graph as a matrix in Nostr (or elsewhere)? I would love to learn more about how this works. Right now Nos builds up DAG of the two hops follow graph in memory as-needed. It’s quite expensive in terms of performance and I wonder how we might take advantage of adjacency matrix operations to make it cheaper.