I have been busy designing an algo to approximate the Pagerank of a subgraph based on the Pagerank on the whole graph.
The reason is to sort things in a way that reflects the position of the user in the network, not metrics that are too broad to be relevant.
Why approximate?
Because computing is in an exact way takes too much time and has to be done for all npubs in the subgraph, which can be tens of thousands.
I think this will be a cool tool for WoT things on Nostr.
cc franzap (npub1wf4…dgh9) this can improve the ordering of people for a given app in zap.store (npub10r8…t2p8)
pippellia
npub176p…vgup
2024-06-24 19:41:01
Author Public Key
npub176p7sup477k5738qhxx0hk2n0cty2k5je5uvalzvkvwmw4tltmeqw7vgupPublished at
2024-06-24 19:41:01Event JSON
{
"id": "2eea4c567982e68323136b66e07b5efb452b685cbcdf8642a74890f32c2862bf",
"pubkey": "f683e87035f7ad4f44e0b98cfbd9537e16455a92cd38cefc4cb31db7557f5ef2",
"created_at": 1719250861,
"kind": 1,
"tags": [
[
"p",
"726a1e261cc6474674e8285e3951b3bb139be9a773d1acf49dc868db861a1c11",
"",
"mention"
],
[
"p",
"78ce6faa72264387284e647ba6938995735ec8c7d5c5a65737e55130f026307d",
"",
"mention"
]
],
"content": "I have been busy designing an algo to approximate the Pagerank of a subgraph based on the Pagerank on the whole graph.\n\nThe reason is to sort things in a way that reflects the position of the user in the network, not metrics that are too broad to be relevant.\n\nWhy approximate?\nBecause computing is in an exact way takes too much time and has to be done for all npubs in the subgraph, which can be tens of thousands.\n\nI think this will be a cool tool for WoT things on Nostr.\n\ncc nostr:npub1wf4pufsucer5va8g9p0rj5dnhvfeh6d8w0g6eayaep5dhps6rsgs43dgh9 this can improve the ordering of people for a given app in nostr:npub10r8xl2njyepcw2zwv3a6dyufj4e4ajx86hz6v4ehu4gnpupxxp7stjt2p8\n",
"sig": "02695e275463d73f4754f5074159cc4510847918497330b768f62455182c2ccf192d6a29aeb3c05f1ed7149a42992013adfc484b2417635a99e9e406da98f45a"
}