Adaptation and optimization of biological transport networks

Similarity and economy of scale in urban transportation networks and optimal transport-based infrastructures

Designing and optimizing the structure of urban transportation networks is a challenging task. In this study, we propose a method inspired by optimal transport theory and the principle of economy of scale that uses little information in input to generate structures that are similar to those of public transportation networks. Contrarily to standard approaches, it does not assume any initial backbone network infrastructure but rather extracts this directly from a continuous space using only a few origin and destination points, generating networks from scratch. Analyzing a set of urban train, tram and subway networks, we find a noteworthy degree of similarity in several of the studied cases between simulated and real infrastructures. By tuning one parameter, our method can simulate a range of different subway, tram and train networks that can be further used to suggest possible improvements in terms of relevant transportation properties. Outputs of our algorithm provide naturally a principled quantitative measure of similarity between two networks that can be used to automatize the selection of similar simulated networks.

Optimal Transport with Constraints: From Mirror Descent to Classical Mechanics

Finding optimal trajectories for multiple traffic demands in a congested network is a challenging task. Optimal transport theory is a principled approach that has been used successfully to study various transportation problems. Its usage is limited by the lack of principled and flexible ways to incorporate realistic constraints. We propose a principled physics-based approach to impose constraints flexibly in optimal transport problems. Constraints are included in mirror descent dynamics using the D'Alembert-Lagrange principle from classical mechanics. This results in a sparse, local and linear approximation of the feasible set leading in many cases to closed-form updates.

Goldilocks Fluctuations: Dynamic Constraints on Loop Formation in Scale-Free Transport Networks

Adaptive transport networks are known to contain loops when subject to hydrodynamic fluctuations. However, fluctuations are no guarantee that a loop will form, as shown by loop-free networks driven by oscillating flows. We provide a complete stability analysis of the dynamical behavior of any loop formed by fluctuating flows. We find a threshold for loop stability that involves an interplay of geometric constraints and hydrodynamic forcing mapped to constant and fluctuating components. Loops require fluctuation in the relative size of the flux between nodes, not just a temporal variation in the flux at a given node. Hence, there is both a minimum and a maximum amount of fluctuation relative to the constant-flux component where loops are supported.

Hemodynamic regulation allows stable growth of microvascular networks

How do vessels find optimal radii? Capillaries are known to adapt their radii to maintain the shear stress of blood flow at the vessel wall at a set point, yet models of adaptation purely based on average shear stress have not been able to produce complex loopy networks that resemble real microvascular systems. For narrow vessels where red blood cells travel in a single file, the shear stress on vessel endothelium peaks sharply when a red blood cell passes through. We show that stable shear-stress-based adaptation is possible if vessel shear stress set points are cued to the stress peaks. Model networks that respond to peak stresses alone can quantitatively reproduce the observed zebrafish trunk microcirculation, including its adaptive trajectory when hematocrit changes or parts of the network are amputated. Our work reveals the potential for mechanotransduction alone to generate stable hydraulically tuned microvascular networks.

Bilevel Optimization for Traffic Mitigation in Optimal Transport Networks

Global infrastructure robustness and local transport efficiency are critical requirements for transportation networks. However, since passengers often travel greedily to maximize their own benefit and trigger traffic jams, overall transportation performance can be heavily disrupted. We develop adaptation rules that leverage optimal transport theory to effectively route passengers along their shortest paths while also strategically tuning edge weights to optimize traffic. As a result, we enforce both global and local optimality of transport. We prove the efficacy of our approach on synthetic networks and on real data. Our findings on the international European highways suggest that thoughtfully devised routing schemes might help to lower car-produced carbon emissions.

Bifurcations in adaptive vascular networks: Toward model calibration

Transport networks are crucial for the functioning of natural and technological systems. We study a mathematical model of vascular network adaptation, where the network structure dynamically adjusts to changes in blood flow and pressure. The model is based on local feedback mechanisms that occur on different time scales in the mammalian vasculature. The cost exponent γ tunes the vessel growth in the adaptation rule, and we test the hypothesis that the cost exponent is γ=1/2 for vascular systems [D. Hu and D. Cai, Phys. Rev. Lett. 111, 138701 (2013)]. We first perform bifurcation analysis for a simple triangular network motif with a fluctuating demand and then conduct numerical simulations on network topologies extracted from perivascular networks of rodent brains. We compare the model predictions with experimental data and find that γ is closer to 1 than to 1/2 for the model to be consistent with the data. Our study, thus, aims at addressing two questions: (i) Is a specific measured flow network consistent in terms of physical reality? (ii) Is the adaptive dynamic model consistent with measured network data? We conclude that the model can capture some aspects of vascular network formation and adaptation, but also suggest some limitations and directions for future research. Our findings contribute to a general understanding of the dynamics in adaptive transport networks, which is essential for studying mammalian vasculature and developing self-organizing piping systems.

Memory capacity of adaptive flow networks

Biological flow networks adapt their network morphology to optimize flow while being exposed to external stimuli from different spatial locations in their environment. These adaptive flow networks retain a memory of the stimulus location in the network morphology. Yet, what limits this memory and how many stimuli can be stored are unknown. Here, we study a numerical model of adaptive flow networks by applying multiple stimuli subsequently. We find strong memory signals for stimuli imprinted for a long time into young networks. Consequently, networks can store many stimuli for intermediate stimulus duration, which balance imprinting and aging.

Infrastructure adaptation and emergence of loops in network routing with time-dependent loads

Network routing approaches are widely used to study the evolution in time of self-adapting systems. However, few advances have been made for problems where adaptation is governed by time-dependent inputs. In this work we study a dynamical systems where the edge conductivities of a network are regulated by time-varying mass loads injected on nodes. Motivated by empirical observations, we assume that conductivities adapt slowly with respect to the characteristic time of the loads. Furthermore, assuming the loads to be periodic, we derive a dynamics where the evolution of the system is controlled by a matrix obtained with the Fourier coefficients of the input loads. Remarkably, we find a sufficient condition on these coefficients that determines when the resulting network topologies are trees. We show an example of this on the Bordeaux bus network where we tune the input loads to interpolate between loopy and tree topologies. We validate our model on several synthetic networks and provide an expression for long-time solutions of the original conductivities.

The glymphatic system: Current understanding and modeling

We review theoretical and numerical models of the glymphatic system, which circulates cerebrospinal fluid and interstitial fluid around the brain, facilitating solute transport. Models enable hypothesis development and predictions of transport, with clinical applications including drug delivery, stroke, cardiac arrest, and neurodegenerative disorders like Alzheimer's disease. We sort existing models into broad categories by anatomical function: Perivascular flow, transport in brain parenchyma, interfaces to perivascular spaces, efflux routes, and links to neuronal activity. Needs and opportunities for future work are highlighted wherever possible; new models, expanded models, and novel experiments to inform models could all have tremendous value for advancing the field.

Memory Formation in Adaptive Networks

The continuous adaptation of networks like our vasculature ensures optimal network performance when challenged with changing loads. Here, we show that adaptation dynamics allow a network to memorize the position of an applied load within its network morphology. We identify that the irreversible dynamics of vanishing network links encode memory. Our analytical theory successfully predicts the role of all system parameters during memory formation, including parameter values which prevent memory formation. We thus provide analytical insight on the theory of memory formation in disordered systems.

Temporal Evolution of Erosion in Pore Networks: From Homogenization to Instability

We study the dynamics of flow networks in porous media using two and three dimensional pore-network models. We consider a class of erosion dynamics for a single phase flow with no deposition, chemical reactions, or topology changes assuming a constitutive law depending on flow rate, local velocities, or shear stress at the walls. We show that depending on the erosion law, the flow may become uniform and homogenized or become unstable and develop channels. By defining an order parameter capturing these different behaviors we show that a phase transition occurs depending on the erosion dynamics. Using a simple model, we identify quantitative criteria to distinguish these regimes and correctly predict the fate of the network, and discuss the experimental relevance of our result.

Sustainable optimal transport in multilayer networks

Traffic congestion is one of the major challenges faced by the transportation industry. While this problem carries a high economic and environmental cost, the need for an efficient design of optimal paths for passengers in multilayer network infrastructures is imperative. We consider an approach based on optimal transport theory to route passengers preferably along layers that are more carbon-efficient than the road, e.g., rails. By analyzing the impact of this choice on performance, we find that this approach reduces carbon emissions considerably compared to shortest-path minimization. Similarly, we find that this approach distributes traffic more homogeneously, thus alleviating the risk of traffic congestion. Our results shed light on the impact of distributing traffic flexibly across layers guided by optimal transport theory.

Multicommodity routing optimization for engineering networks

Optimizing passengers routes is crucial to design efficient transportation networks. Recent results show that optimal transport provides an efficient alternative to standard optimization methods. However, it is not yet clear if this formalism has empirical validity on engineering networks. We address this issue by considering different response functions-quantities determining the interaction between passengers-in the dynamics implementing the optimal transport formulation. Particularly, we couple passengers' fluxes by taking their sum or the sum of their squares. The first choice naturally reflects edges occupancy in transportation networks, however the second guarantees convergence to an optimal configuration of flows. Both modeling choices are applied to the Paris metro. We measure the extent of traffic bottlenecks and infrastructure resilience to node removal, showing that the two settings are equivalent in the congested transport regime, but different in the branched one. In the latter, the two formulations differ on how fluxes are distributed, with one function favoring routes consolidation, thus potentially being prone to generate traffic overload. Additionally, we compare our method to Dijkstra's algorithm to show its capacity to efficiently recover shortest-path-like graphs. Finally, we observe that optimal transport networks lie in the Pareto front drawn by the energy dissipated by passengers, and the cost to build the infrastructure.

A growth model for water distribution networks with loops

Water distribution networks (WDNs) expand their service areas over time. These growth dynamics are poorly understood. One facet of WDNs is that they have loops in general, and closing loops may be a functionally important process for enhancing their robustness and efficiency. We propose a growth model for WDNs that generates networks with loops and is applicable to networks with multiple water sources. We apply the proposed model to four empirical WDNs to show that it produces networks whose structure is similar to that of the empirical WDNs. The comparison between the empirical and modelled WDNs suggests that the empirical WDNs may realize a reasonable balance between cost, efficiency and robustness in terms of the network structure. We also study the design of pipe diameters based on a biological positive feedback mechanism. Specifically, we apply a model inspired by Physarum polycephalum to find moderate positive correlations between the empirical and modelled pipe diameters. The difference between the empirical and modelled pipe diameters suggests that we may be able to improve the performance of WDNs by following organizing principles of biological flow networks.

Optimal Transport in Multilayer Networks for Traffic Flow Optimization

Modeling traffic distribution and extracting optimal flows in multilayer networks is of the utmost importance to design efficient, multi-modal network infrastructures. Recent results based on optimal transport theory provide powerful and computationally efficient methods to address this problem, but they are mainly focused on modeling single-layer networks. Here, we adapt these results to study how optimal flows distribute on multilayer networks. We propose a model where optimal flows on different layers contribute differently to the total cost to be minimized. This is done by means of a parameter that varies with layers, which allows to flexibly tune the sensitivity to the traffic congestion of the various layers. As an application, we consider transportation networks, where each layer is associated to a different transportation system, and show how the traffic distribution varies as we tune this parameter across layers. We show an example of this result on the real, 2-layer network of the city of Bordeaux with a bus and tram, where we find that in certain regimes, the presence of the tram network significantly unburdens the traffic on the road network. Our model paves the way for further analysis of optimal flows and navigability strategies in real, multilayer networks.

Optimal Elasticity of Biological Networks

Reinforced elastic sheets surround us in daily life, from concrete shell buildings to biological structures such as the arthropod exoskeleton or the venation network of dicotyledonous plant leaves. Natural structures are often highly optimized through evolution and natural selection, leading to the biologically and practically relevant problem of understanding and applying the principles of their design. Inspired by the hierarchically organized scaffolding networks found in plant leaves, here we model networks of bending beams that capture the discrete and nonuniform nature of natural materials. Using the principle of maximal rigidity under natural resource constraints, we show that optimal discrete beam networks reproduce the structural features of real leaf venation. Thus, in addition to its ability to efficiently transport water and nutrients, the venation network also optimizes leaf rigidity using the same hierarchical reticulated network topology. We study the phase space of optimal mechanical networks, providing concrete guidelines for the construction of elastic structures. We implement these natural design rules by fabricating efficient, biologically inspired metamaterials.

Discontinuous transition to loop formation in optimal supply networks

The structure and design of optimal supply networks is an important topic in complex networks research. A fundamental trait of natural and man-made networks is the emergence of loops and the trade-off governing their formation: adding redundant edges to supply networks is costly, yet beneficial for resilience. Loops typically form when costs for new edges are small or inputs uncertain. Here, we shed further light on the transition to loop formation. We demonstrate that loops emerge discontinuously when decreasing the costs for new edges for both an edge-damage model and a fluctuating sink model. Mathematically, new loops are shown to form through a saddle-node bifurcation. Our analysis allows to heuristically predict the location and cost where the first loop emerges. Finally, we unveil an intimate relationship among betweenness measures and optimal tree networks. Our results can be used to understand the evolution of loop formation in real-world biological networks.

Supply networks with optimal structure do not contain loops but these can arise as a result of damages or fluctuations. Here Kaiser et al. uncover the mechanisms of loop formation, predict their location and draw analogies with loop formation in biological networks such as plants and animal vasculature.

Human-on-Leaf-Chip: A Biomimetic Vascular System Integrated with Chamber-Specific Organs

The vascular network is a central component of the organ-on-a-chip system to build a 3D physiological microenvironment with controlled physical and biochemical variables. Inspired by ubiquitous biological systems such as leaf venation and circulatory systems, a fabrication strategy is devised to develop a biomimetic vascular system integrated with freely designed chambers, which function as niches for chamber-specific vascularized organs. As a proof of concept, a human-on-leaf-chip system with biomimetic multiscale vasculature systems connecting the self-assembled 3D vasculatures in chambers is fabricated, mimicking the in vivo complex architectures of the human cardiovascular system connecting vascularized organs. Besides, two types of vascularized organs are built independently within the two halves of the system to verify its feasibility for conducting comparative experiments for organ-specific metastasis studies in a single chip. Successful culturing of human hepatoma G2 cells (HepG2s) and mesenchymal stem cells (MSCs) with human umbilical vein endothelial cells (HUVECs) shows good vasculature formation, and organ-specific metastasis is simulated through perfusion of pancreatic cancer cells and shows distinct cancer encapsulation by MSCs, which is absent in HepG2s. Given good culture efficacy, study design flexibility, and ease of modification, these results show that the bioinspired human-on-leaf-chip possesses great potential in comparative and metastasis studies while retaining organ-to-organ crosstalk.

Resilience of three-dimensional sinusoidal networks in liver tissue

Can three-dimensional, microvasculature networks still ensure blood supply if individual links fail? We address this question in the sinusoidal network, a plexus-like microvasculature network, which transports nutrient-rich blood to every hepatocyte in liver tissue, by building on recent advances in high-resolution imaging and digital reconstruction of adult mice liver tissue. We find that the topology of the three-dimensional sinusoidal network reflects its two design requirements of a space-filling network that connects all hepatocytes, while using shortest transport routes: sinusoidal networks are sub-graphs of the Delaunay graph of their set of branching points, and also contain the corresponding minimum spanning tree, both to good approximation. To overcome the spatial limitations of experimental samples and generate arbitrarily-sized networks, we developed a network generation algorithm that reproduces the statistical features of 0.3-mm-sized samples of sinusoidal networks, using multi-objective optimization for node degree and edge length distribution. Nematic order in these simulated networks implies anisotropic transport properties, characterized by an empirical linear relation between a nematic order parameter and the anisotropy of the permeability tensor. Under the assumption that all sinusoid tubes have a constant and equal flow resistance, we predict that the distribution of currents in the network is very inhomogeneous, with a small number of edges carrying a substantial part of the flow-a feature known for hierarchical networks, but unexpected for plexus-like networks. We quantify network resilience in terms of a permeability-at-risk, i.e., permeability as function of the fraction of removed edges. We find that sinusoidal networks are resilient to random removal of edges, but vulnerable to the removal of high-current edges. Our findings suggest the existence of a mechanism counteracting flow inhomogeneity to balance metabolic load on the liver.

Optimal Transport Flows for Distributed Production Networks

Network flows often exhibit a hierarchical treelike structure that can be attributed to the minimization of dissipation. The common feature of such systems is a single source and multiple sinks (or vice versa). In contrast, here we study networks with only a single source and sink. These systems can arise from secondary purposes of the networks, such as blood sugar regulation through insulin production. Minimization of dissipation in these systems leads to vascular shunting, a single vessel connecting the inlet and outlet. We show instead how optimizing the transport time yields network topologies that match those observed in the insulin-producing pancreatic islets. These are patterns of periphery-to-center and center-to-periphery flows. The obtained flow networks are broadly independent of how the flow velocity depends on the flow flux, but continuous and discontinuous phase transitions appear at extreme flux dependencies. Lastly, we show how constraints on flows can lead to buckling of the branches of the network, a feature that is also observed in pancreatic islets.

Impact of global structure on diffusive exploration of organelle networks

We investigate diffusive search on planar networks, motivated by tubular organelle networks in cell biology that contain molecules searching for reaction partners and binding sites. Exact calculation of the diffusive mean first-passage time on a spatial network is used to characterize the typical search time as a function of network connectivity. We find that global structural properties — the total edge length and number of loops — are sufficient to largely determine network exploration times for a variety of both synthetic planar networks and organelle morphologies extracted from living cells. For synthetic networks on a lattice, we predict the search time dependence on these global structural parameters by connecting with percolation theory, providing a bridge from irregular real-world networks to a simpler physical model. The dependence of search time on global network structural properties suggests that network architecture can be designed for efficient search without controlling the precise arrangement of connections. Specifically, increasing the number of loops substantially decreases search times, pointing to a potential physical mechanism for regulating reaction rates within organelle network structures.

Phenotypes of Vascular Flow Networks

Complex distribution networks are pervasive in biology. Examples include nutrient transport in the slime mold Physarum polycephalum as well as mammalian and plant venation. Adaptive rules are believed to guide development of these networks and lead to a reticulate, hierarchically nested topology that is both efficient and resilient against perturbations. However, as of yet, no mechanism is known that can generate such networks on all scales. We show how hierarchically organized reticulation can be constructed and maintained through spatially correlated load fluctuations on a particular length scale. We demonstrate that the network topologies generated represent a trade-off between optimizing transport efficiency, construction cost, and damage robustness and identify the Pareto-efficient front that evolution is expected to favor and select for. We show that the typical fluctuation length scale controls the position of the networks on the Pareto front and thus on the spectrum of venation phenotypes.

Robust Increase in Supply by Vessel Dilation in Globally Coupled Microvasculature

Neuronal activity induces changes in blood flow by locally dilating vessels in the brain microvasculature. How can the local dilation of a single vessel increase flow-based metabolite supply, given that flows are globally coupled within microvasculature? Solving the supply dynamics for rat brain microvasculature, we find one parameter regime to dominate physiologically. This regime allows for robust increase in supply independent of the position in the network, which we explain analytically. We show that local coupling of vessels promotes spatially correlated increased supply by dilation.

Auxin transport model for leaf venation

The plant hormone auxin controls many aspects of the development of plants. One striking dynamical feature is the self-organization of leaf venation patterns which is driven by high levels of auxin within vein cells. The auxin transport is mediated by specialized membrane-localized proteins. Many venation models have been based on polarly localized efflux-mediator proteins of the PIN family. Here, we investigate a modelling framework for auxin transport with a positive feedback between auxin fluxes and transport capacities that are not necessarily polar, i.e. directional across a cell wall. Our approach is derived from a discrete graph-based model for biological transportation networks, where cells are represented by graph nodes and intercellular membranes by edges. The edges are not a priori oriented and the direction of auxin flow is determined by its concentration gradient along the edge. We prove global existence of solutions to the model and the validity of Murray's Law for its steady states. Moreover, we demonstrate with numerical simulations that the model is able connect an auxin source-sink pair with a mid-vein and that it can also produce branching vein patterns. A significant innovative aspect of our approach is that it allows the passage to a formal macroscopic limit which can be extended to include network growth. We perform mathematical analysis of the macroscopic formulation, showing the global existence of weak solutions for an appropriate parameter range.

Optimizing biologically inspired transport networks by control

Transportation networks with intrinsic flow dynamics governed by the Kirchhoff's current law are ubiquitous in natural and engineering systems. There has been recent work on designing optimal transportation networks based on biological principles with the goal to minimize the total dissipation associated with the flow. Despite being biologically inspired, e.g., adaptive network design based on slime mold Physarum polycephalum, such methods generally lead to suboptimal networks due to the difficulty in finding a global or nearly global optimum of the nonconvex optimization function. Here we articulate a design paradigm that combines engineering control and biological principles to realize optimal transportation networks. In particular, we show how small control signals applied only to a fraction of edges in an adaptive network can lead to solutions that are far more optimal than those based solely on biological principles. We also demonstrate that control signals, if not properly designed, can lead to networks that are less optimal. Incorporating control principle into biology-based optimal network design has broad applications not only in biomedical science and engineering but also in other disciplines such as civil engineering for designing resilient infrastructure systems.

A Priori Estimates for a Nonlinear System with Some Essential Symmetrical Structures

In this paper, we are concerned with a nonlinear system containing some essential symmetrical structures (e.g., cross-diffusion) in the two-dimensional setting, which is proposed to model the biological transport networks. We first provide an a priori blow-up criterion of strong solution of the corresponding Cauchy problem. Based on this, we also establish a priori upper bounds to strong solution for all positive times.

Morphological organization of point-to-point transport in complex networks

We investigate the structural organization of the point-to-point electric, diffusive or hydraulic transport in complex scale-free networks. The random choice of two nodes, a source and a drain, to which a potential difference is applied, selects two tree-like structures, one emerging from the source and the other converging to the drain. These trees merge into a large cluster of the remaining nodes that is found to be quasi-equipotential and thus presents almost no resistance to transport. Such a global “tree-cluster-tree” structure is universal and leads to a power law decay of the currents distribution. Its exponent, −2, is determined by the multiplicative decrease of currents at successive branching points of a tree and is found to be independent of the network connectivity degree and resistance distribution.

Network models for characterization of trabecular bone

Trabecular bone is a lightweight, compliant material organized as a web of struts and rods (trabeculae) that erode with age and the onset of bone diseases like osteoporosis, leading to increased fracture risk. The traditional diagnostic marker of osteoporosis, bone mineral density (BMD), has been shown in ex vivo experiments to correlate poorly with fracture resistance when considered on its own, while structural features in conjunction with BMD can explain more of the variation in trabecular bone strength. We develop a network-based model of trabecular bone by creating graphs from micro-computed tomography images of human bone, with weighted links representing trabeculae and nodes representing branch points. These graphs enable calculation of quantitative network metrics to characterize trabecular structure. We also create finite element models of the networks in which each link is represented by a beam, facilitating analysis of the mechanical response of the bone samples to simulated loading. We examine the structural and mechanical properties of trabecular bone at the scale of individual trabeculae (of order 0.1 mm) and at the scale of selected volumes of interest (approximately a few mm), referred to as VOIs. At the VOI scale, we find significant correlations between the stiffness of VOIs and 10 different structural metrics. Individually, the volume fraction of each VOI is most strongly correlated to the stiffness of the VOI. We use multiple linear regression to identify the smallest subset of variables needed to capture the variation in stiffness. In a linear fit, we find that node degree, weighted node degree, Z-orientation, weighted Z-orientation, trabecular spacing, link length, and the number of links are the structural metrics that are most significant (p<0.05) in capturing the variation of stiffness in trabecular networks.

Microvscular networks with uniform flow

Within animals, oxygen exchange occurs within vascular transport networks containing potentially billions of microvessels that are distributed throughout the body. By comparison, large blood vessels are theorized to minimize transport costs, leading to tree-like networks that satisfy Murray's law. We know very little about the principles underlying the organization of healthy micro-vascular networks. Indeed capillary networks must also perfuse tissues with oxygen, and efficient perfusion may be incompatible with minimization of transport costs. While networks that minimize transport costs have been well-studied, other optimization principles have received much less scrutiny. In this work we derive the morphology of networks that uniformize blood flow distribution, inspired by the zebrafish trunk micro-vascular network. To find uniform flow networks, we devise a gradient descent algorithm able to optimize arbitrary differentiable objective functions on transport networks, while exactly respecting arbitrary differentiable constraint functions. We prove that in a class of networks that we call stackable, which includes a model capillary bed, the uniform flow network will have the same flow as a uniform conductance network, i.e., in which all edges have the same conductance. This result agrees with uniform flow capillary bed network found by the algorithm. We also show that the uniform flow completely explains the observed radii within the zebrafish trunk vasculature. In addition to deriving new results on optimization of uniform flow in micro-vascular networks, our algorithm provides a general method for testing hypotheses about possible optimization principles underlying real microvascular networks, including exposing tradeoffs between flow uniformity and transport cost.

Optimal Noise-Canceling Networks

Natural and artificial networks, from the cerebral cortex to large-scale power grids, face the challenge of converting noisy inputs into robust signals. The input fluctuations often exhibit complex yet statistically reproducible correlations that reflect underlying internal or environmental processes such as synaptic noise or atmospheric turbulence. This raises the practically and biophysically relevant question of whether and how noise filtering can be hard wired directly into a network's architecture. By considering generic phase oscillator arrays under cost constraints, we explore here analytically and numerically the design, efficiency, and topology of noise-canceling networks. Specifically, we find that when the input fluctuations become more correlated in space or time, optimal network architectures become sparser and more hierarchically organized, resembling the vasculature in plants or animals. More broadly, our results provide concrete guiding principles for designing more robust and efficient power grids and sensor networks.

Comparing two classes of biological distribution systems using network analysis

Distribution networks-from vasculature to urban transportation pathways-are spatially embedded networks that must route resources efficiently in the face of pressures induced by the costs of building and maintaining network infrastructure. Such requirements are thought to constrain the topological and spatial organization of these systems, but at the same time, different kinds of distribution networks may exhibit variable architectural features within those general constraints. In this study, we use methods from network science to compare and contrast two classes of biological transport networks: mycelial fungi and vasculature from the surface of rodent brains. These systems differ in terms of their growth and transport mechanisms, as well as the environments in which they typically exist. Though both types of networks have been studied independently, the goal of this study is to quantify similarities and differences in their network designs. We begin by characterizing the structural backbone of these systems with a collection of measures that assess various kinds of network organization across topological and spatial scales, ranging from measures of loop density, to those that quantify connected pathways between different network regions, and hierarchical organization. Most importantly, we next carry out a network analysis that directly considers the spatial embedding and properties especially relevant to the function of distribution systems. We find that although both the vasculature and mycelia are highly constrained planar networks, there are clear distinctions in how they balance tradeoffs in network measures of wiring length, efficiency, and robustness. While the vasculature appears well organized for low cost, but relatively high efficiency, the mycelia tend to form more expensive but in turn more robust networks. As a whole, this work demonstrates the utility of network-based methods to identify both common features and variations in the network structure of different classes of biological transport systems.

The pial vasculature of the mouse develops according to a sensory-independent program

The cerebral vasculature is organized to supply the brain’s metabolic needs. Sensory deprivation during the early postnatal period causes altered neural activity and lower metabolic demand. Neural activity is instructional for some aspects of vascular development, and deprivation causes changes in capillary density in the deprived brain region. However, it is not known if the pial arteriole network, which contains many leptomeningeal anastomoses (LMAs) that endow the network with redundancy against occlusions, is also affected by sensory deprivation. We quantified the effects of early-life sensory deprivation via whisker plucking on the densities of LMAs and penetrating arterioles (PAs) in anatomically-identified primary sensory regions (vibrissae cortex, forelimb/hindlimb cortex, visual cortex and auditory cortex) in mice. We found that the densities of penetrating arterioles were the same across cortical regions, though the hindlimb representation had a higher density of LMAs than other sensory regions. We found that the densities of PAs and LMAs, as well as quantitative measures of network topology, were not affected by sensory deprivation. Our results show that the postnatal development of the pial arterial network is robust to sensory deprivation.

Organization and scaling in water supply networks

Public water supply is one of the society's most vital resources and most costly infrastructures. Traditional concepts of these networks capture their engineering identity as isolated, deterministic hydraulic units, but overlook their physics identity as related entities in a probabilistic, geographic ensemble, characterized by size organization and property scaling. Although discoveries of allometric scaling in natural supply networks (organisms and rivers) raised the prospect for similar findings in anthropogenic supplies, so far such a finding has not been reported in public water or related civic resource supplies. Examining an empirical ensemble of large number and wide size range, we show that water supply networks possess self-organized size abundance and theory-explained allometric scaling in spatial, infrastructural, and resource- and emission-flow properties. These discoveries establish scaling physics for water supply networks and may lead to novel applications in resource- and jurisdiction-scale water governance.

Optimal occlusion uniformly partitions red blood cells fluxes within a microvascular network

In animals, gas exchange between blood and tissues occurs in narrow vessels, whose diameter is comparable to that of a red blood cell. Red blood cells must deform to squeeze through these narrow vessels, transiently blocking or occluding the vessels they pass through. Although the dynamics of vessel occlusion have been studied extensively, it remains an open question why microvessels need to be so narrow. We study occlusive dynamics within a model microvascular network: the embryonic zebrafish trunk. We show that pressure feedbacks created when red blood cells enter the finest vessels of the trunk act together to uniformly partition red blood cells through the microvasculature. Using mathematical models as well as direct observation, we show that these occlusive feedbacks are tuned throughout the trunk network to prevent the vessels closest to the heart from short-circuiting the network. Thus occlusion is linked with another open question of microvascular function: how are red blood cells delivered at the same rate to each micro-vessel? Our analysis shows that tuning of occlusive feedbacks increase the total dissipation within the network by a factor of 11, showing that uniformity of flows rather than minimization of transport costs may be prioritized by the microvascular network.

Arterial trees shuttle red blood cells from the heart to billions of capillaries distributed throughout the body. These trees have long been thought to be organized to minimize transport costs. Yet red blood cells are tightly squeezed within the finest vessels, meaning that these vessels account for as much as half of the total transport costs within the arterial network. It is unclear why vessel diameters and red blood cell diameters are so closely matched in a network that is presumed to optimize transport. Here, we use mathematical modeling and direct observations of red blood cell movements in embryonic zebrafish to show that occlusive feedbacks—the pressure feedbacks that alter the flows into a vessel when it is nearly blocked by a red blood cell—can optimally distribute red blood cells through microvessels. In addition to revealing an adaptive function for the matching of vessel and red blood cell diameters, this work shows that uniformity of red blood cell fluxes can be a unifying principle for understanding the elegant hydraulic organization of microvascular networks.

Current reinforcement model reproduces center-in-center vein trajectory of Physarum polycephalum

Vein networks span the whole body of the amoeboid organism in the plasmodial slime mould Physarum polycephalum, and the network topology is rearranged within an hour in response to spatio-temporal variations of the environment. It has been reported that this tube morphogenesis is capable of solving mazes, and a mathematical model, named the 'current reinforcement rule', was proposed based on the adaptability of the veins. Although it is known that this model works well for reproducing some key characters of the organism's maze-solving behaviour, one important issue is still open: In the real organism, the thick veins tend to trace the shortest possible route by cutting the corners at the turn of corridors, following a center-in-center trajectory, but it has not yet been examined whether this feature also appears in the mathematical model, using corridors of finite width. In this report, we confirm that the mathematical model reproduces the center-in-center trajectory of veins around corners observed in the maze-solving experiment.

Mean-field approach to evolving spatial networks, with an application to osteocyte network formation

We consider evolving networks in which each node can have various associated properties (a state) in addition to those that arise from network structure. For example, each node can have a spatial location and a velocity, or it can have some more abstract internal property that describes something like a social trait. Edges between nodes are created and destroyed, and new nodes enter the system. We introduce a "local state degree distribution" (LSDD) as the degree distribution at a particular point in state space. We then make a mean-field assumption and thereby derive an integro-partial differential equation that is satisfied by the LSDD. We perform numerical experiments and find good agreement between solutions of the integro-differential equation and the LSDD from stochastic simulations of the full model. To illustrate our theory, we apply it to a simple model for osteocyte network formation within bones, with a view to understanding changes that may take place during cancer. Our results suggest that increased rates of differentiation lead to higher densities of osteocytes, but with a smaller number of dendrites. To help provide biological context, we also include an introduction to osteocytes, the formation of osteocyte networks, and the role of osteocytes in bone metastasis.

Central loops in random planar graphs

Random planar graphs appear in a variety of contexts and it is important for many different applications to be able to characterize their structure. Local quantities fail to give interesting information and it seems that path-related measures are able to convey relevant information about the organization of these structures. In particular, nodes with a large betweenness centrality (BC) display nontrivial patterns, such as central loops. We first discuss empirical results for different random planar graphs and we then propose a toy model which allows us to discuss the condition for the emergence of nontrivial patterns such as central loops. This toy model is made of a star network with N_{b} branches of size n and links of weight 1, superimposed to a loop at distance ℓ from the center and with links of weight w. We estimate for this model the BC at the center and on the loop and we show that the loop can be more central than the origin if w<w_{c} where the threshold of this transition scales as w_{c}∼n/N_{b}. In this regime, there is an optimal position of the loop that scales as ℓ_{opt}∼N_{b}w/4. This simple model sheds some light on the organization of these random structures and allows us to discuss the effect of randomness on the centrality of loops. In particular, it suggests that the number and the spatial extension of radial branches are the crucial ingredients that control the existence of central loops.

Global Optimization, Local Adaptation, and the Role of Growth in Distribution Networks

Highly optimized complex transport networks serve crucial functions in many man-made and natural systems such as power grids and plant or animal vasculature. Often, the relevant optimization functional is nonconvex and characterized by many local extrema. In general, finding the global, or nearly global optimum is difficult. In biological systems, it is believed that such an optimal state is slowly achieved through natural selection. However, general coarse grained models for flow networks with local positive feedback rules for the vessel conductivity typically get trapped in low efficiency, local minima. In this work we show how the growth of the underlying tissue, coupled to the dynamical equations for network development, can drive the system to a dramatically improved optimal state. This general model provides a surprisingly simple explanation for the appearance of highly optimized transport networks in biology such as leaf and animal vasculature.

Asymmetries arising from the space-filling nature of vascular networks

Cardiovascular networks span the body by branching across many generations of vessels. The resulting structure delivers blood over long distances to supply all cells with oxygen via the relatively short-range process of diffusion at the capillary level. The structural features of the network that accomplish this density and ubiquity of capillaries are often called space-filling. There are multiple strategies to fill a space, but some strategies do not lead to biologically adaptive structures by requiring too much construction material or space, delivering resources too slowly, or using too much power to move blood through the system. We empirically measure the structure of real networks (18 humans and 1 mouse) and compare these observations with predictions of model networks that are space-filling and constrained by a few guiding biological principles. We devise a numerical method that enables the investigation of space-filling strategies and determination of which biological principles influence network structure. Optimization for only a single principle creates unrealistic networks that represent an extreme limit of the possible structures that could be observed in nature. We first study these extreme limits for two competing principles, minimal total material and minimal path lengths. We combine these two principles and enforce various thresholds for balance in the network hierarchy, which provides a novel approach that highlights the tradeoffs faced by biological networks and yields predictions that better match our empirical data.

Structural self-assembly and avalanchelike dynamics in locally adaptive networks

Transport networks play a key role across four realms of eukaryotic life: slime molds, fungi, plants, and animals. In addition to the developmental algorithms that build them, many also employ adaptive strategies to respond to stimuli, damage, and other environmental changes. We model these adapting network architectures using a generic dynamical system on weighted graphs and find in simulation that these networks ultimately develop a hierarchical organization of the final weighted architecture accompanied by the formation of a system-spanning backbone. In addition, we find that the long term equilibration dynamics exhibit behavior reminiscent of glassy systems characterized by long periods of slow changes punctuated by bursts of reorganization events.

Easily repairable networks: reconnecting nodes after damage

We introduce a simple class of distribution networks that withstand damage by being repairable instead of redundant. Instead of asking how hard it is to disconnect nodes through damage, we ask how easy it is to reconnect nodes after damage. We prove that optimal networks on regular lattices have an expected cost of reconnection proportional to the lattice length, and that such networks have exactly three levels of structural hierarchy. We extend our results to networks subject to repeated attacks, in which the repairs themselves must be repairable. We find that, in exchange for a modest increase in repair cost, such networks are able to withstand any number of attacks.