Payment-failure times for random Lightning paths
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912792776278016 |
|---|---|
| author | Abedesselam, Taki E. M. Giacomelli, Fabio Pasquale, Francesco Salvi, Michele |
| author_facet | Abedesselam, Taki E. M. Giacomelli, Fabio Pasquale, Francesco Salvi, Michele |
| contents | We study a random process over graphs inspired by the way payments are executed in the Lightning Network, the main layer-two solution on top of Bitcoin. We first prove almost tight upper and lower bounds on the time it takes for a payment failure to occur, as a function of the number of nodes and the edge capacities, when the underlying graph is complete. Then, we show how such a random process is related to the edge-betweenness centrality measure and we prove upper and lower bounds for arbitrary graphs as a function of edge-betweenness and capacity. Finally, we validate our theoretical results by running extensive simulations over some classes of graphs, including snapshots of the real Lightning Network. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_16376 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Payment-failure times for random Lightning paths Abedesselam, Taki E. M. Giacomelli, Fabio Pasquale, Francesco Salvi, Michele Networking and Internet Architecture Probability We study a random process over graphs inspired by the way payments are executed in the Lightning Network, the main layer-two solution on top of Bitcoin. We first prove almost tight upper and lower bounds on the time it takes for a payment failure to occur, as a function of the number of nodes and the edge capacities, when the underlying graph is complete. Then, we show how such a random process is related to the edge-betweenness centrality measure and we prove upper and lower bounds for arbitrary graphs as a function of edge-betweenness and capacity. Finally, we validate our theoretical results by running extensive simulations over some classes of graphs, including snapshots of the real Lightning Network. |
| title | Payment-failure times for random Lightning paths |
| topic | Networking and Internet Architecture Probability |
| url | https://arxiv.org/abs/2511.16376 |