pull down to refresh

Thanks for the work, i will re-read it again when i have more time:
Two questions:
  • For the 'Betweenness centrality' in the paper, what does 'shortest path' mean in your context? Is it really in terms of number of hops? I have found that using this notionĀ of 'shortest path' is quickly limited in what information it brings, since it considers that every channel is equal (in capacity to route any amount, in any direction, at any moment of time, and in cost to route that payment). We are not in a purely mathematical graph, but on the lightning network. For me, it seems that shortest path in LN should more be a measure of 'cheapest path', AND, 'path that can actually route the payment', not just a number of hops. (Spoiler alert about what might be in next part of my articles about what i learnt building a LN channel advisor i guess)
  • Is that historical channel update data openly available so i can also use it for my LN channel advisor, instead of just relying on immediate LN network state?