betaFeedback

WorksPhysics and Astronomy

Adaptive Hagen-Poiseuille flows on graphs

Abstract

We derive a class of equations describing low Reynolds number steady flows of incompressible and viscous fluids in networks made of straight channels, with several sources and sinks, and adaptive conductivities. The flow is controlled by the fluxes at sources and sinks. The network is represented by a graph and the adaptive conductivities describe the transverse channel elasticities, mirroring several network structures found in physics and biology. Minimising the dissipated energy per unit time, we have found an explicit form for the adaptation equations and, asymptotically in time, a steady state tree geometry for the graph connecting sources and sinks is reached. A phase transition tuned by an order parameter for the adapted steady sate graph has been found.

Systems with network structures characterizing their functioning are veins in tumours [1], channels transporting nutrients in leaves [2, 3], animals’ vasculature [4], microorganisms with adaptive vein networks as the Physarum polycephalum [5, 6], and Dictyostelium discoideum [7], transportation systems [8], or electrical networks [9]. Formal systems as the travelling salesman problem [10], the Steiner tree geometries [11], and the first passage percolation [12] are challenging network optimisation problems in graphs, with important applications in physics, biology and engineering.

Physarum polycephalum is a slime mould with a complex life cycle, showing a great adaptability to environmental changes. It has an adaptive network of veins, which transport the endoplasmatic fluid from food sources to the different regions of the slime mould body, and whose geometry and adaptability are responsible for growth and motility [13]. The veins walls of the network show rhythmic transverse oscillations, regulated by food sources and other external stimuli, [14] and [15]. Despite lacking any kind of neural circuit, Physarum shows a high-level behaviour, where, for example, the choice of the shortest path between food sources in a maze has been observed [17]. Moreover, in the presence of multiple food sources, Physarum can build networks with a great compromise between production cost, transport efficiency and fault tolerance [19]. The main biochemical and physical mechanisms responsible by the rhythmic behaviour and the movements of Physarum is a challenging problem and has not been identified [18].

In the particular case of the dynamics and optimisation of vein networks in Physarum, several modelling approaches aiming to explore the formation and optimisation of network paths have been introduced, [19]. These approaches were based on the phenomenology of Hagen-Poiseuille flows in graphs, and optimisation has been introduced by controlling channel conductivity through ad hoc local evolution laws, together with stochastic actualisation processes. These models converge to steady network paths, which, in some cases, are close to Steiner tree type of connections, [11] and [20], or even shortest path solutions [10, 17].

However, in all these modelling approaches some basic physical principles are not taken into account, as is the case of the conservation of volume of the circulating fluid. On the other hand, it is difficult to understand that the local conductivity of channels could change independently of the other channel conductivities of the network, a hypothesis subjacent to the modelling approaches just described.

The main goal of this paper is to construct a class of models describing the flow of incompressible and viscous fluids in networks of veins or channels, in conformity with the properties of fluids. The network is described by a graph where edges represent channels, and vertices are spatial distribution hubs of fluid. The veins are elastic and their diameters can change in response to the flux of fluid in the channels.

We consider simple undirected graphs G=(V,E)\mathcal{G} = (V,E), embedded in a nn dimensional Euclidean space, where VV is the set of NN nodes or vertices with coordinates (xi1,…,xin)(x^1_i,\ldots,x^n_i), with i=1,…,Ni = 1,\ldots,N, and EE is the set of MM straight edges (i,j)(i,j), connecting nodes ii and jj. The graph G\mathcal{G} is connected in the sense that it has only one component. The graph G\mathcal{G} describes the geometry of a network of veins.

Edges represent elastic cylindrical channels that can expand or contract transversely to the flow. The edge connecting node ii to node jj has fixed length LijL_{ij} and radius rijr_{ij}. The fluid in the network is viscous and incompressible, the flow is laminar (low Reynolds numbers) with no-slip boundary conditions, being a Hagen-Poiseuille (H-P) type flow [21]. The dynamic viscosity of the fluid is η\eta.

Networks have KK sources and RR sinks, located at fixed nodes. The flux of fluid from outside to the interior of the network and vice versa, occurring at node jj, is represented by SjS_j. If the network has a source at node jj, then Sj>0S_j > 0. If it has a sink at node jj, then Sj<0S_j < 0, otherwise Sj=0S_j = 0. As the fluid in the network of veins is incompressible, we have

∑j=1NSj=∑j:sourcesSj+∑j:sinksSj=0,(1)\sum_{j=1}^{N} S_j=\sum_{j:\mathrm{sources}} S_j+\sum_{j:\mathrm{sinks}} S_j=0, \tag*{(1)}

and the volume of fluid in the network is constant.

The steady state of the flow is characterised by the pressure pip_i at the node ii, and the flux along the channel or edge connecting nodes ii and jj is

Qij=πrij48η(pi−pj)Lij:=Dij(pi−pj)Lij,(2)Q_{ij}=\frac{\pi r_{ij}^{4}}{8\eta}\frac{(p_i-p_j)}{L_{ij}}:=D_{ij}\frac{(p_i-p_j)}{L_{ij}}, \tag*{(2)}

where DijD_{ij} is the conductivity of the channel (i,j)(i,j), and Dij=DjiD_{ij}=D_{ji}. If Qij>0Q_{ij}>0, then the flow is from ii to jj. If Qij<0Q_{ij}<0, the flow is from jj to ii. The ratios Dij/LijD_{ij}/L_{ij} have the role of graph weights.

The volume of a channel connecting node ii to node jj is Vij=πrij2LijV_{ij}=\pi r_{ij}^{2}L_{ij}. As Dij=πrij4/8ηD_{ij}=\pi r_{ij}^{4}/8\eta, we have Vij=8πηLijDijV_{ij}=\sqrt{8\pi\eta}L_{ij}\sqrt{D_{ij}}. As the fluid is incompressible, the volume of fluid in the network is constant and is

V=∑(i,j)∈EVij=β∑(i,j)∈ELijDij,(3)\mathcal{V}=\sum_{(i,j)\in E}V_{ij}=\beta\sum_{(i,j)\in E}L_{ij}\sqrt{D_{ij}}, \tag*{(3)}

where β=8πη\beta=\sqrt{8\pi\eta}.

The steady state of the H-P flow in the network is determined by the Kirchhoff law

∑j:(i,j)∈EQij=Si,i=1…,N.(4)\sum_{j:(i,j)\in E}Q_{ij}=S_i,\quad i=1\ldots,N. \tag*{(4)}

The system of conservation laws (4) can be written in the form Wp=SWp=S, where, by (2), WW is the generalised Laplacian matrix of the graph GG, depending of DijD_{ij} and LijL_{ij}, and W=WTW=W^{T}, [22]. The vector SS describes the sources and the sinks, obeys condition (1), and pp is the vector of pressures. If i≠ji\ne j and (i,j)∈E(i,j)\in E, then wij<0w_{ij}<0. If i≠ji\ne j and (i,j)∉E(i,j)\notin E, then wij=0w_{ij}=0. As wii>0w_{ii}>0, the matrix WW is diagonally dominated. As the graph GG has one component, then rank⁡(W)=N−1\operatorname{rank}(W)=N-1, [23]. As W1=0W\mathbf{1}=0, the eigenvector 1\mathbf{1} of WW corresponds to the zero eigenvalue with multiplicity 1. Then, the system of equations (4) can be solved for all the pressures, up to an additive constant, and the fluxes are well determined by (2).

The dissipated energy per unit time of the H-P steady flow is

P=∑(i,j)∈EQij2DijLij.(5)\mathcal{P}=\sum_{(i,j)\in E}\frac{Q_{ij}^{2}}{D_{ij}}L_{ij}. \tag*{(5)}

The steady state solution of the linear equations (4), with sources and sinks, is obtained for fixed conductivities DijD_{ij} and lengths LijL_{ij}. However, as it has been observed in organisms, the flow in veins induce the increase or decrease the radius of channels, affecting the conductivity of veins, [24] and [25]. Due to the incompressibility of the fluid, this affects all the network structure which can not be described by local mechanisms.

To obtain a law for the rate of change of the conductivities of the network, we assume that the area of channels can change as a function of fluxes, and make the ansatz

ddtDij=f(Q)−cDij,(i,j)∈E(6)\frac{d}{dt}\sqrt{D_{ij}}=f(\mathbf{Q})-c\sqrt{D_{ij}},\quad(i,j)\in E \tag*{(6)}

where, by (2), in a H-P flow, Dij\sqrt{D_{ij}} is proportional to the area of the (i,j)(i,j) channel, f(Q)f(\mathbf{Q}), with f(0)=0f(0)=0, is an unknown function of the global flux Q\mathbf{Q} in the network, and c>0c>0 is some constant.

Assuming conservation of volume, by (3), we have

ddtV=β∑(i,j)∈ELijddtDij=0,(7)\frac{d}{dt}\mathcal{V}=\beta\sum_{(i,j)\in E}L_{ij}\frac{d}{dt}\sqrt{D_{ij}}=0, \tag*{(7)}

which, by (6) and (3), implies that

∑(i,j)∈ELijf(Q)=c∑(i,j)∈ELijDij=cβV(8)\sum_{(i,j)\in E}L_{ij}f(\mathbf{Q})=c\sum_{(i,j)\in E}L_{ij}\sqrt{D_{ij}}=\frac{c}{\beta}\mathcal{V} \tag*{(8)}

is constant.

Defining a new function gg by the relation

f(Q):=cβVg(Qij)∑(k,m)∈ELkmg(Qkm)f(\mathbf{Q}):=\frac{c}{\beta}\mathcal{V}\frac{g(Q_{ij})}{\sum_{(k,m)\in E}L_{km}g(Q_{km})}

and introducing this last expression into (6), we conclude that

ddτDij=αg(Qij)∑(k,m)∈ELkmg(Qkm)−Dij,(i,j)∈E(9)\frac{d}{d\tau}\sqrt{D_{ij}}=\alpha\frac{g(Q_{ij})}{\sum_{(k,m)\in E}L_{km}g(Q_{km})}-\sqrt{D_{ij}},\quad(i,j)\in E \tag*{(9)}

where τ=ct\tau=ct and α=V/β\alpha=\mathcal{V}/\beta, and the first term on the right-hand side of the above equation depends on the fluxes of all the channels in the network. Therefore, we have shown that, for any choice of the function gg, the adaptation equation (9) maintains invariant the volume of fluid in the network.

To analyse the temporal evolution of the geometry of the network of veins and eventually its dynamical adaptation, given prescribed sources and sinks fluxes, the function gg in (9) must be chosen. For that, we introduce the simple criterion of minimisation of the dissipated energy per unit time during the flow ([9, 26, 27, 28]), also preserving the total volume V\mathcal{V} of the fluid. So, by (3) and (5), we consider the Lagrangian

L=P−λ(V−β∑(k,m)∈ELkmDkm),\mathcal{L}=\mathcal{P}-\lambda\left(\mathcal{V}-\beta\sum_{(k,m)\in E}L_{km}\sqrt{D_{km}}\right),

where λ\lambda is a Lagrange multiplier. Minimising L\mathcal{L} with respect to Dij\sqrt{D_{ij}} and λ\lambda, by (5), we obtain

{∂L∂Dij=(−Qij2Dij2Lij+2∑(k,m)∈EQkmDkm∂Qkm∂DijLkm+λβLij2Dij)2Dij=0∂L∂λ=V−β∑(k,m)∈ELkmDkm=0.\left\{ \begin{aligned} \frac{\partial\mathcal{L}}{\partial\sqrt{D_{ij}}} &=\left(-\frac{Q_{ij}^{2}}{D_{ij}^{2}}L_{ij}+2\sum_{(k,m)\in E}\frac{Q_{km}}{D_{km}}\frac{\partial Q_{km}}{\partial D_{ij}}L_{km} +\lambda\beta\frac{L_{ij}}{2\sqrt{D_{ij}}}\right)2\sqrt{D_{ij}}=0\\ \frac{\partial\mathcal{L}}{\partial\lambda} &=\mathcal{V}-\beta\sum_{(k,m)\in E}L_{km}\sqrt{D_{km}}=0. \end{aligned} \right.

As the second term on the right-hand side of the first equation is zero (cf. lemma 2.1 in [29]), solving these equations with respect to DijD_{ij} and λ\lambda, the values of conductivities that minimize the dissipated energy per unit time of the flow are

Dij∗=α2Qij4/3(∑(k,m)∈ELkmQkm2/3)2(10)D_{ij}^{*}=\alpha^{2}\frac{Q_{ij}^{4/3}}{\left(\sum_{(k,m)\in E}L_{km}Q_{km}^{2/3}\right)^{2}} \tag*{(10)}

and Dij∗∗=0D_{ij}^{**}=0.

Comparing the conductivity solution (10) with (9), making the choice g(Qij)=Qij2/3g(Q_{ij})=Q_{ij}^{2/3} in (9), by the conditions ddτDij=0\frac{d}{d\tau}\sqrt{D_{ij}}=0, the dissipated energy per unit time at the steady state of the adaptive H-P flow is minimal.

For a single channel with one source and one sink, equation (9) reduces to ddτD12=α/L12−D12\frac{d}{d\tau}\sqrt{D_{12}}=\alpha/L_{12}-\sqrt{D_{12}}, which has a unique stable fixe point for D12=α/L12\sqrt{D_{12}}=\alpha/L_{12}, coinciding with (10). Therefore, for a simple H-P flow in a channel and the conductivity D12=α2/L122=πr124/β2D_{12}=\alpha^{2}/L_{12}^{2}=\pi r_{12}^{4}/\beta^{2}, the dissipated energy per unit time of the H-P flow is minimal, is independent of the choice of the function g(.)g(.) and is consistent with the Kirchhoff law (cf. [26] for this discussion). This property justifies the ansatz made in (6) by adding the term Dij\sqrt{D_{ij}}.

In the following, we analyse volume conserving H-P flows in networks with adaptation equations

ddτDij=α∣Qij∣γ∑(k,m)∈ELkm∣Qkm∣γDij,(i,j)∈E(11)\frac{d}{d\tau}\sqrt{D_{ij}}=\alpha\frac{|Q_{ij}|^{\gamma}}{\sum_{(k,m)\in E}L_{km}|Q_{km}|^{\gamma}}\sqrt{D_{ij}},\quad(i,j)\in E \tag*{(11)}

where γ>0\gamma>0 is a new parameter and the absolute value in QijQ_{ij} emphasises that conductivities are independent of the direction of the flow.

The choice of a monotonous increasing function for g(Qij)g(Q_{ij}) may lead to high conductivity values, only limited by the finitude of the graph G\mathcal{G} and by the volume of fluid in the network. Other choices for g(Qij)g(Q_{ij}) are possible, in particular those leading to saturation effects, [24] and [8].

To analyse the flow of a fluid on a network and the adaptation of the elastic channels, we consider the simplest case where the network is described by a planar graph embedded in the two-dimensional Euclidean space, resulting from a Delaunay triangulation, and with nodes in general position. Some of these nodes can be sources or sinks, with global fluxes obeying condition (1). By increasing the number of nodes of the graph in a finite region of the Euclidean space, the advantage of this choice for the geometry of the graph G\mathcal{G} is the possibility of approaching in a simple way the continuum limit avoiding lattice symmetries.

To describe the flow on G\mathcal{G}, we consider that at some initial time τ=0\tau=0, all the edges of the network have positive conductivities and the flow is driven by the fluxes at sources and sinks. By (3), the volume of the fluid in the network is determined by the initial conductivities Dij(0)D_{ij}(0). The temporal evolution of the radius of the channels starts with the evaluation of a H-P steady state by solving the linear equations (4), for given initial conductivities Dij(0)D_{ij}(0). In a second step, the conductivities of all the channels are adapted according to equations (11). Then, these two steps are repeated over time, until a steady state of the channel conductivities is eventually reached. From the numerical point of view, a steady state is reached if the condition max⁡(i,j)∈E∣Dij(nΔτ)−Dij((n−1)Δτ)∣<10−6\max_{(i,j)\in E}|D_{ij}(n\Delta\tau)-D_{ij}((n-1)\Delta\tau)|<10^{-6} is fulfilled, where nn is the first integer for which the inequality is verified and Δτ\Delta\tau is the time increment to solve numerically equations (11). The time of convergence of the adaptation algorithm is τ∗=nΔτ≪∞\tau^{*}=n\Delta\tau\ll\infty. Several numerical experiments have shown that the above convergence criterion is a good compromise between computing time and the shape of the steady state channels. According to equation (11), the conductivities of edges may asymptotically approach zero, but in the numerical simulations the limit is never reached, and thus, the graph G\mathcal{G} remains always as a single connected component.

To test the adaptation mechanism (11), we have considered a square lattice of side length 1, with N=25×25N=25\times25 nodes. The positions of the interior nodes of the lattice have been randomly perturbed with a Gaussian noise, with standard deviation σ=0.5\sigma=0.5. Then, a Delaunay triangulation of the lattice sites is performed, resulting the graph network G\mathcal{G}. The edge lengths LijL_{ij} are then obtained. We have considered K=3K=3 sources and R=4R=4 sinks, randomly allocated to the nodes of the network G\mathcal{G}. Two sources have intensities Ssource=0.4S_{\mathrm{source}}=0.4 and a third source has intensity Ssource=0.2S_{\mathrm{source}}=0.2. The sinks have equal intensities Ssink=−0.25S_{\mathrm{sink}}=-0.25. The adaptation process has been calculated with equations (11), for the parameter values β=1\beta=1 and γ=2/3\gamma=2/3, using the Euler explicit numerical method with time increment Δτ=0.1\Delta\tau=0.1. (A simple calculation shows that the discretised Euler method preserves the volume of the channels in the graph, simplifying numerical calculations.) Two different sets of initial conductivities have been considered: homogeneous conductivities all over the edges, Dij(0)=1D_{ij}(0)=1, and random conductivities uniformly distributed in the interval [1/2,3/2][1/2,3/2]. In Figure 1, we show the resulting adapted steady state networks. The steady state graphs in the figure are different but can be considered metrically close.

The lengths of the steady state trees are, in a), L=2.936L = 2.936, and, in b), L=2.859L = 2.859. For comparison, an upper bound for the length of the Steiner tree connecting sources and sinks is Lus=2.333L_{\mathrm{us}} = 2.333, [30].

Several numerical simulations have shown that the steady state optimised network depends on the time step Δτ\Delta\tau, on the fluxes imposed by the sources and sinks, and on the initial distribution of conductivities.

If the number of sources and sinks are equal and the absolute value of their fluxes are the same, then the steady state may be a set of “apparently” disconnected graph trees. With a careful manipulation of the localisation of sources and sinks, it is possible to build networks with several “apparently” disconnected trees as steady states of the H-P flow. In fact, for every γ≥0\gamma\ge0, the graph G\mathcal{G} has only one connected component with conductivities partitioned in two sets of low and high values. This distribution of conductivities enables to count the number of effectively conducting channels of the steady state flow.

Further numerical analysis of the adaptive equation (11) shows that a phase transition occurs for γ≃1/2\gamma\simeq1/2. If γ<1/2\gamma< 1/2, the steady state of the flow is a connected graph with closed loops, as shown in Figure 2. As shown previously, if γ>1/2\gamma> 1/2, the steady state of the flow with meaningful conductivities is a tree connecting sources and sinks (Figure 1). This phase transition is consistent with the one found by Bohn and Magnasco [9] in resistors network which minimizes the dissipation rate under the cost constraint ∑(i,j)CijΓ=const.\sum_{(i,j)} C_{ij}^{\Gamma} = \mathrm{const.}, where CijC_{ij} are the edge conductances. The conductance and the currents of the optimal network obey to a similar power-law relationship, with the natural identification of γ=1/(1+Γ)\gamma= 1/(1+\Gamma)

Image not extracted

Figure 1. Steady states of an adaptive H-P flow with 3 sources (circles) and 4 sinks (triangles), calculated for two different initial distributions of conductivities, with adaptation calculated by equations (11). The initial Delaunay triangulation G\mathcal{G} is shown in grey. The thickness of the black lines is proportional to the radius of the edges (∼Dij1/4\sim D_{ij}^{1/4}). At steady states, the dissipated energy per unit time is minimal. The steady states solutions have been reached after n=329n = 329 iterations in a) and, after n=444n = 444 iterations in b). At steady state, τ∗=nΔτ\tau^* = n\Delta\tau, the tree conductivities obey to 130<Dij(τ∗)<2750130 < D_{ij}(\tau^*) < 2750, and the grey edges conductivities obey to 0<Dij(τ∗)<0.00050 < D_{ij}(\tau^*) < 0.0005.

Image not extracted

Figure 2. Steady state of the adaptive H-P flow for the order parameter γ=0.47\gamma= 0.47, below the phase transition at γ≃1/2\gamma\simeq1/2, for the initial network of Figure 1a). The steady state network length is L≃41.50L \simeq41.50, calculated at the iteration number n=2449n = 2449. The thickness of the black lines is proportional to the radius of the edges.

(cf. equation (5) of [9] with the first term on the right hand side of (11)). Using a relaxation algorithm to find the optimal network for each Γ\Gamma, the authors have shown that the system exhibited a phase transition at Γ=1\Gamma= 1, with redundant uniform networks for Γ>1\Gamma> 1 and loopless trees for Γ<1\Gamma< 1.

In Figure 3, we show the histogram of frequencies of the steady state conductivities Dij(τ∗)D_{ij}(\tau^*), for γ=0.47\gamma= 0.47 and γ=2/3\gamma= 2/3, and initial conditions as in Figure 1a). The distribution of conductivities enables the evaluation of the steady state network length LL by considering the edges of the full graph G\mathcal{G} with conductivities above the threshold Dthr=5×10−4D_{\mathrm{thr}} = 5 \times10^{-4}.

Image not extracted

Figure 3. Histogram of frequencies of the steady state conductivities Dij(τ∗)D_{ij}(\tau^*), for γ=0.47\gamma= 0.47 and γ=2/3\gamma= 2/3, and initial conditions as in Figure 1a).

The phase transition at γ≃1/2\gamma\simeq1/2 is quantified by analysing the dissipated energy per unit time at steady state, or by the length of the steady state graph, as a function of γ\gamma.

In Figure 4, we show the dependence on γ\gamma of these two quantities characterising the phase transition. The transition observed at γ=1/2\gamma= 1/2 suggests the existence of a discontinuity on the first derivative of the dissipated energy per unit time (5), calculated at steady state, relative to the order parameter γ\gamma, which may correspond, in the Ehrenfest classification, to a first order phase transition. Further simulations show that the phase transition is independent of the initial distribution of conductivities, of the distribution of sources and sinks and of the positions of the nodes of the mesh. Numerical analysis shows that P(γ)\mathcal{P}(\gamma) has a local minimum for γ=2/3\gamma= 2/3, as derived in (10).

Image not extracted

Figure 4. Normalised dissipated energy per unit time at steady state P/P0\mathcal{P}/\mathcal{P}_0 and normalised graph length L/L0L/L_0 of the steady states, as a function of γ\gamma, for the initial network of Figure 1a). The initial dissipated energy and the initial length of the graph length are P0\mathcal{P}_0 and L0L_0, respectively. For the initial conditions of Figure 1b), the corresponding graphs are similar.

To establish further the analogy between the H-P flow and the flows in biological and physical systems, we have simulated an H-P adaptive flow with a geometry similar to the ones found in plant leaves, tumor vascularisation or electric circuits. The steady states of the adapted H-P flows are shown in Figure 5. In these simulations, the steady stated are different but are metrically close. The structure of the tree network is similar to the vascularisation channels found in plant leaves [2], or electric circuits [9]. However, is all these simulations, we have not found edge loops in directions transverse to the radial flow emanating from food sources, as observed in Physarum.

Image not extracted

Figure 5. Steady state of the adaptive H-P flow with one source (circle) and ten sinks (triangles), for γ=2/3\gamma= 2/3, and initial conductivities Dij(0)=1D_{ij}(0)=1 and Dij(0)∈[1/2,3/2]D_{ij}(0) \in[1/2,3/2], for the same parameters values of the simulations in Figure 1. For values of γ\gamma in the interval (0.5,2](0.5,2], the results are similar. The intensity of the source is Ssource=1S_{\mathrm{source}}=1, and the intensities of the sinks are Ssink=−1/10S_{\mathrm{sink}}=-1/10. The thickness of the black lines is proportional to the radius of the edges.

For graphs describing mazes, the adaptation algorithm described here converges to a path connecting the entrance with the goal of the maze, a phenomenon reported in Physarum [16].

Some of the results described here are based on extensive numerical simulations and on the convergence criteria assumed for the conductivities or graph weights. The phase transition, the steady state trees, the discontinuity of the derivative of the dissipated energy per unit time and the discontinuity of the derivative of the graph length relative to the order parameter γ\gamma may be derived exactly in the limit when the areas of the Delaunay triangles goes to zero. In this case, the steady state conductivities limits, Dij∗D_{ij}^{*} and Dij∗∗D_{ij}^{**}, should also be reached.

Conclusions and outlook.– We have derived a class of equations describing an adaptive H-P fluid flow in networks of straight channels, embedded in any Euclidean space, independently of the dimension. The adaptation mechanism models the transverse elasticity of channels. The flow preserves the volume of the fluid in the network and the channel diameters converge to fixed values, minimising the dissipated energy per unit time. This class of equations have a very general form, enabling the introduction of different choices for the adaptive elasticity functions of channels, simulating different biological and physical systems. In general, this adaptation formalism can be extended to networks with time- and space-dependent sources and sinks and different mesh topologies.

References

References

  1. [1]S. I. Rubinow, Mathematical Problems in the Biological Sciences, SIAM, Philadelphia, 1973.DOI
  2. [2]E. Katifori, G. J. Szollosi and M. O. Magnasco, Damage and fluctuations induce loops in optimal transport networks, Phys. Rev. Lett. 104 (2010) 048704.pubmed.ncbi.nlm.nih.gov/20366746
  3. [3]H. Ronellenfitsch and E. Katifori, Phenotypes of Vascular Flow Networks, Phys. Rev. Lett. 123 (2016) 248101.DOI
  4. [4]D. Hu and D. Cai, Adaptation and optimization of biological transport networks, Phys. Rev. Lett. 111 (2013) 138701.pubmed.ncbi.nlm.nih.gov/24116821
  5. [5]W. Baumgarten, T. Ueda and M. J. B. Hauser, Plasmodial vein networks of the slime mold Physarum polycephalum form regular graphs, Phys. Rev. E 82 (2010) 046113.pubmed.ncbi.nlm.nih.gov/21230351
  6. [6]C. Oettmeier, K. Brix, H.-G. Döbereiner, Physarum polycephalum — a new take on a classic model system, J. of Phys. D: Appl. Phys. 50 (2017) 413001.DOI
  7. [7]S. Almeida and R. Dilão, Directional sensing and streaming in Dictyostelium aggregation, Physical Review E 93(5) (2016) 052402.DOI
  8. [8]A. Tero, R. Kobayashi and T. Nakagaki, Physarum solver: A biologically inspired method of road-network navigation. Physica A 363 (2006) 115-119.DOI
  9. [9]S. Bohn and M. O. Magnasco, Structure, scaling, and phase transition in the optimal transport network, Phys. Rev. Lett. 98 (2007) 088702.pubmed.ncbi.nlm.nih.gov/17359138
  10. [10]L. Zhu, S.-J. Kim, M. Hara and M. Aono, Remarkable problem-solving ability of unicellular amoeboid organism and its mechanism, R. Soc. open sci. 5 (2018) 180396.DOI
  11. [11]A. Tero, T. Nakagaki, K. Toyabe, K. Yumiki, and R. Kobayashi. A method inspired by Physarum for solving C. D. Howard, Models of first-passage percolation, in: Kesten H. (eds) Probability on Discrete Structures. Encyclopaedia of Mathematical Sciences (Probability Theory), vol. 110. Springer, Berlin, Heidelberg.
  12. [13]K. Alim, G. Amselem, F. Peaudecerf, M. P. Brenner, A. Pringle, Random network peristalsis in Physarum polycephalum organizes fluid flows across an individual, PNAS 110 (2013) 13306-13311.DOI
  13. [14]M. Kramar and K. Alim, Encoding memory in tube diameter hierarchy of living flow network, PNAS 118 (2021) e2007815118.DOI
  14. [15]J.-D. Julien and K. Alim, Oscillatory fluid flow drives scaling of contraction wave with system size, PNAS 115 (2018) 10612-10617.DOI
  15. [16]T. Nakagaki, H. Yamada and Á. Tóth, Maze-solving by an amoeboid organism, Nature 407 (2000) 470.
  16. [17]A. Tero, R. Kobayashi and T. Nakagaki, A mathematical model for adaptive transport network in path finding by true slime mold, J. Theo. Biol. 244 (2007) 553-564.pubmed.ncbi.nlm.nih.gov/17069858
  17. [18]V. A. Teplov, Journal of Physics D: Applied Physics 50, 213002 (2017).
  18. [19]A. Tero, S. Takagi, T. Saigusa, K. Ito, D. P. Bebber, M. D. Fricker, K. Yumiki, R. Kobayashi, and T. Nakagaki, Rules for biologically inspired adaptive network design, Science 327 (2010) 439-442.DOI
  19. [20]M. Caleffi, I. F. Akyildiz and L. Paura. On the solution of the Steiner tree NP-hard problem via Physarum bionetwork. IEEE/ACM Transactions on Networking 23(4) (2015) 1092-1106DOI
  20. [21]L. Landau and E. Lefchitz, Mécanique des fluides, MIR, Moscou, 1971, section 17.
  21. [22]C. Godsil and G. Royle, Algebraic Graph Theory, Springer-Verlag, New York, 2001.DOI
  22. [23]J. Gallier and J. Quaintance, Linear algebra and optimization with applications to machine learning, vol I, World Scientific, 2020, cap.18, Proposition 18.1.
  23. [24]S. I. Rubinow and J. B. Keller, Flow of a viscous fluid through an elastic tube with applications to blood flow, J. Theor. Biol. 35 (1972) 299-313.pubmed.ncbi.nlm.nih.gov/5039296
  24. [25]K. E. Wohlfarth-Bottermann, Oscillatory contraction activity in Physarum, J. Exp. Biol. 81(1) (1979) 15-32.
  25. [26]R. P. Feynman, R. B. Leighton and M. Sands, The Feynman lectures on physics, vol. II, , 1975, cap. 19, ”Note added after the lecture”.
  26. [27]D. A. Van Baak, Variational alternatives to Kirchhoff’s loop theorem in dc circuits, Am. J. Phys. 67(1) (1999) 36-44.DOI
  27. [28]F. Corson, Fluctuations and redundancy in optimal transport networks, Phys. Rev. Lett. 104(4) (2010) 048703.pubmed.ncbi.nlm.nih.gov/20366745
  28. [29]J. Haskovec, L. M. Kreussler and P. Markowich, ODE- and PDE-based modeling of biological transportation networks, Commun. Math. Sci. 17(5) (2019) 1235-1256, Lemma 2.1.DOI
  29. [30]L. Kou, G. Markowsky and L. Berman, A fast algorithm for Steiner trees, Acta Informatica 15(2) (1981) 141-145.DOI

Paper details

vlnc:W_9f9cbgsr
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents