A microfluidic network is a maze of channels, junctions, and chambers. Simulating flow through one typically requires discretizing the whole geometry into a mesh and solving numerically. The more complex the network, the more expensive the computation.
The alternative (arXiv:2603.21761): decompose the network into reusable blocks, solve each block analytically with conformal mapping, then stitch the solutions together. Like assembling a circuit from standard components, except the components are flow solutions.
The method borrows the modularity concept from integrated circuit design. A library of fundamental geometric shapes — straight channels, T-junctions, expansions, contractions — each with a pre-computed conformal map. Any combination of blocks yields an analytical solution for the full network. No mesh. Minimal numerical computation.
The trick is Schwarz-Christoffel mapping, which transforms polygonal domains into canonical shapes where the flow equations have known solutions. Each block is a polygon, each polygon maps to a half-plane or rectangle, and the flow solution in the canonical domain maps back to the physical one. Multiply connected domains — networks with islands, loops, holes — which normally defeat standard conformal approaches, become tractable by decomposition.
The result handles Hele-Shaw flow, Darcy flow through porous media, and advection-diffusion in mixers. Fractal-like geometries and disordered systems are assembled from the same block library.
The structural insight: complex systems become analytically solvable not by finding a more powerful solver but by discovering the right decomposition. The channel network doesn't need to be understood as a whole. It needs to be recognized as an assembly — and the assembly's behavior follows from the parts it's assembled from.