We address liquidity placement in the Bitcoin Lightning Network (LN): given a fixed budget, which channels should a node open to maximize its routing capacity? We cast this as a budget-constrained combinatorial optimization problem on graphs, selecting $k$ edge additions that maximize $s$--$t$ max-flow, a theory-grounded measure of routing capacity, and solve it with graph reinforcement learning.
arXiv:2607. 23467v1 Announce Type: new Abstract: We study an integrated pickup-and-delivery problem on sparse, non-Euclidean networks that jointly optimizes cyclic routing, cargo flow allocation, and cross-cycle service.
By Haomiao Sun, Fang He, Congyuan Ji, Xindi Tang
arXiv:2408. 05885v3 Announce Type: replace Abstract: Generative Flow Networks (GFlowNets) have been shown effective to generate combinatorial objects with desired properties.
By Puhua Niu, Shili Wu, Mingzhou Fan, Xiaoning Qian
arXiv:2608. 13212v1 Announce Type: new Abstract: Networked systems, from power grids to traffic networks and cloud clusters, carry loads across nodes with limited capacity.
By Orkun Irsoy, Leman Akoglu, Osman Yagan
arXiv:2606. 06272v1 Announce Type: new Abstract: Generative Flow Networks (GFlowNets) are a framework for sampling structured objects via stochastic trajectories in a directed graph.
By Ian Maksimov, Nikita Morozov, Denis Belomestny, Sergey Samsonov
arXiv:2606. 15793v1 Announce Type: cross Abstract: This paper explores policy gradient algorithms for training stochastic policies to sample from structured discrete probability distributions under the Generative Flow Network (GFlowNet) framework.
By Anna Zykova-Myzina, Timofei Gritsaev, Daniil Tiapkin, Nikita Morozov