More Like this

1. Is mean curvature flow a gradient flow?

   https://doi.org/10.1090/proc/16572  

   Huang, Zhonggan (June 2023, AMS)
2. Improving Flow Matching by Aligning Flow Divergence

   Huang, Yuhao; Transue, Taos; Wang, Shih-Hsin; Feldman, William M; Zhang, Hong; Wang, Bao (May 2025, ICML, https://openreview.net/forum?id=FeZimuj6SG)
3. Towards a Flow- and Path-Sensitive Information Flow Analysis

   https://doi.org/10.1109/CSF.2017.17  

   Li, Peixuan; Zhang, Danfeng (August 2017, 30th IEEE Computer Security Foundations Symposium)
4. Three‐Dimensional Subsurface Flow Path Controls on Flow Permanence

   https://doi.org/10.1029/2020WR028270  

   Dohman, J. M.; Godsey, S. E.; Hale, R. L. (October 2021, Water Resources Research)
5. Maximum Flow and Minimum-Cost Flow in Almost-Linear Time

   https://doi.org/10.1109/FOCS54457.2022.00064  

   Chen, Li; Kyng, Rasmus; Liu, Yang P.; Peng, Richard; Gutenberg, Maximilian Probst; Sachdeva, Sushant (October 2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS))

   We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and capacities in m^{1+o(1)} time. Our algorithm builds the flow through a sequence of m^{1+o(1)} approximate undirected minimum-ratio cycles, each of which is computed and processed in amortized m^{o(1)} time using a new dynamic graph data structure. Our framework extends to algorithms running in m^{1+o(1)} time for computing flows that minimize general edge-separable convex functions to high accuracy. This gives almost-linear time algorithms for several problems including entropy-regularized optimal transport, matrix scaling, p-norm flows, and p-norm isotonic regression on arbitrary directed acyclic graphs. 

   more » « less