SearcharxivSearch

arXiv subjects

Georgios Gounaris

Publications and source records attributed to Georgios Gounaris.

2 recordsLinked to original sources

The central role of metabolism in vascular morphogenesis

As nutrients travel through microcirculation and are absorbed, their availability continuously decreases. However, a uniform nutrient distribution is critical, as it prevents tissue death in poorly supplied areas. How, then, do vascular networks achieve equi-perfusion? Given the extensive number of vessels in animal vascular systems, the structure of smaller vessels cannot be fully genetically predetermined and thus relies on a self-organizing developmental mechanism. We propose a simple, optimization-based adaptation rule to control vessel radii, aiming to equalize perfusion while minimizing flow resistance and material cost. This adaptation balances three competing factors: perfusion efficiency, energy dissipation, and material expenditure, which together drive complex network morphologies. These morphologies range from hierarchical architectures optimized for minimal resistance and material cost to dense networks that achieve efficient perfusion. Notably, metabolic demand is the primary factor modulating the transition between these contrasting structures. By applying our adaptation rule to networks in the rat mesentery and comparing the resulting optimal perfusion architectures with the experimental data, we can estimate the biologically relevant parameters, such as the oxygen absorption rate, for which the optimization and experimental networks align the most. Surprisingly, the optimal absorption rate we derive matches independent in vivo measurements. This suggests that reduced-order models like ours can provide valuable insights into the development and function of real vascular networks.

q-bio.TO

A Braess' paradox analog in physical networks of optimal exploration

In the stochastic exploration of geometrically embedded graphs, intuition suggests that providing a shortcut between a pair of nodes reduces the mean first passage time of the entire graph. Counterintuitively, we find a Braess paradox analog. For regular diffusion, shortcuts can worsen the overall search efficiency of the network, although they bridge topologically distant nodes. We propose an optimization scheme under which each edge adapts its conductivity to minimize the graph's search time. The optimization reveals a relationship between the structure and diffusion exponent and a crossover from dense to sparse graphs as the exponent increases.

nlin.AO