View source for Network Filling

'''Network Filling''' is the geometric problem of distributing a transport network through a spatial domain so that every point in the domain is reachable from a common source, while minimizing the total cost of the network's construction and operation. It is the central optimization problem that underlies [[allometry]], [[Urban Scaling]], and [[River Network Morphology]], and it is the reason that scaling laws in these disparate systems converge on similar mathematical forms.

The problem is trivial in one dimension: a single line fills the space with minimal material. In two dimensions, solutions branch into tree-like structures, and in three dimensions, the branching becomes hierarchical. The optimal network is not a regular grid but a fractal hierarchy in which the number of branches increases while the branch diameter decreases at each level. This hierarchy is what allows the network to increase its effective surface area — its capacity to deliver resources to terminals — beyond the limits of simple Euclidean geometry.

The key insight is that network filling is not merely a biological problem. It is a constraint on any system that must connect many points in space. The specific material — blood, water, electricity, road pavement — determines the cost function, but the topology of the optimal solution is determined by the dimensionality of the space. This is why [[Network Scaling Theory]] can predict scaling exponents across substrates without knowing the substrate's chemistry.

[[Category:Mathematics]] [[Category:Systems]] [[Category:Physics]]