david on Nostr: I suppose one way to understand why cycles are bad is that you get paths that are ...
I suppose one way to understand why cycles are bad is that you get paths that are infinitely long. GrapeRank addresses this problem using a parameter called attenuation factor, aF, a number between 0 and 1. For any given path starting with the reference user, the weight of each successive hop is multiplied by aF. So the impact of a node that is N hops away on a given path is reduced by aF^N.
Published at
2024-12-11 17:42:55Event JSON
{
"id": "2593321f1c7e0483d79bdd2547a84328cd6e9fe6e2e3a2b2d06a3d93a61370a2",
"pubkey": "e5272de914bd301755c439b88e6959a43c9d2664831f093c51e9c799a16a102f",
"created_at": 1733938975,
"kind": 1,
"tags": [
[
"e",
"fd67227c096edf381a5a8029e17660f667cf47ecdbfb220fcd42f9696b582596",
"",
"root"
],
[
"e",
"a6e49c461e3fd27cebce55370f76e04c2360c950f7c9bfc9ec1fec5a01cdca8e",
"",
"reply"
],
[
"p",
"f683e87035f7ad4f44e0b98cfbd9537e16455a92cd38cefc4cb31db7557f5ef2"
]
],
"content": "I suppose one way to understand why cycles are bad is that you get paths that are infinitely long. GrapeRank addresses this problem using a parameter called attenuation factor, aF, a number between 0 and 1. For any given path starting with the reference user, the weight of each successive hop is multiplied by aF. So the impact of a node that is N hops away on a given path is reduced by aF^N.",
"sig": "2069b907d76c0afdbdeacd335451c461001f4a0fe15da793e59617457fd433a2ebf7184c96f865aa917bdb9fc1dd435d82cfe78840887ad4482825c243af3672"
}
