Topology Maximizing r(G)

Optimal Payment Channel Network Design | Pickhardt, arXiv:2601.04835

0.441
Best r(G) at n=4
K4
Optimal Topology (n=4)
38
Topologies Tested (n=4)
Cycle
Best Family (n>=5)

r(G) by Graph Family and Network Size

r(G) Distribution (n=4, all topologies)

Evolutionary Search Convergence (n=6)

Optimal Topology Summary

nBest r(G)Optimal Degree SeqFamilyTopologies Tested
30.673[2,2,2]Cycle = Complete4
40.441[3,3,3,3]Complete38
50.228[3,3,2,2,2]Near-cycle~700
60.100[2,2,2,2,2,2]Cycle (evo)150 (evo)