Scalable computation of the maximum flow in large brain connectivity networks
Jingyun Qian, Georg Hahn

TL;DR
This paper introduces a scalable Monte Carlo algorithm for approximating maximum flow in large brain connectivity networks, providing confidence bounds and significantly reducing runtime compared to classic methods.
Contribution
A novel Monte Carlo approach for maximum flow approximation in large networks that scales efficiently and includes confidence interval estimation.
Findings
Algorithm achieves accurate maximum flow estimates.
Runtime scales as O(|V|^{3.5}) with chosen parameters.
Validated on simulated and real brain network data.
Abstract
We are interested in computing an approximation of the maximum flow in large (brain) connectivity networks. The maximum flow in such networks is of interest in order to better understand the routing of information in the human brain. However, the runtime of for the classic Edmonds-Karp algorithm renders computations of the maximum flow on networks with millions of vertices infeasible, where is the set of vertices and is the set of edges. In this contribution, we propose a new Monte Carlo algorithm which is capable of computing an approximation of the maximum flow in networks with millions of vertices via subsampling. Apart from giving a point estimate of the maximum flow, our algorithm also returns valid confidence bounds for the true maximum flow. Importantly, its runtime only scales as , where is the number of Monte Carlo…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFunctional Brain Connectivity Studies · Neural dynamics and brain function · EEG and Brain-Computer Interfaces
