Paper List
-
SpikGPT: A High-Accuracy and Interpretable Spiking Attention Framework for Single-Cell Annotation
This paper addresses the core challenge of robust single-cell annotation across heterogeneous datasets with batch effects and the critical need to ide...
-
Unlocking hidden biomolecular conformational landscapes in diffusion models at inference time
This paper addresses the core challenge of efficiently and accurately sampling the conformational landscape of biomolecules from diffusion-based struc...
-
Personalized optimization of pediatric HD-tDCS for dose consistency and target engagement
This paper addresses the critical limitation of one-size-fits-all HD-tDCS protocols in pediatric populations by developing a personalized optimization...
-
Realistic Transition Paths for Large Biomolecular Systems: A Langevin Bridge Approach
This paper addresses the core challenge of generating physically realistic and computationally efficient transition paths between distinct protein con...
-
Consistent Synthetic Sequences Unlock Structural Diversity in Fully Atomistic De Novo Protein Design
This paper addresses the core pain point of low sequence-structure alignment in existing synthetic datasets (e.g., AFDB), which severely limits the pe...
-
MoRSAIK: Sequence Motif Reactor Simulation, Analysis and Inference Kit in Python
This work addresses the computational bottleneck in simulating prebiotic RNA reactor dynamics by developing a Python package that tracks sequence moti...
-
On the Approximation of Phylogenetic Distance Functions by Artificial Neural Networks
This paper addresses the core challenge of developing computationally efficient and scalable neural network architectures that can learn accurate phyl...
-
EcoCast: A Spatio-Temporal Model for Continual Biodiversity and Climate Risk Forecasting
This paper addresses the critical bottleneck in conservation: the lack of timely, high-resolution, near-term forecasts of species distribution shifts ...
A Unified Variational Principle for Branching Transport Networks: Wave Impedance, Viscous Flow, and Tissue Metabolism
Unknown
30秒速读
IN SHORT: This paper solves the core problem of predicting the empirically observed branching exponent (α≈2.7) in mammalian arterial trees, which neither Murray's cubic law (α=3) nor pure impedance matching (α≈2) can explain in isolation.
核心创新
- Methodology Introduces a unified network-level Lagrangian that combines dimensionless wave-reflection and metabolic transport penalties, eliminating the need for a free weighting parameter.
- Theory Formulates the morphological optimization as a zero-sum game and applies von Neumann's minimax theorem to derive a unique saddle point (α*, η*) from an equal-cost condition.
- Biology Derives binary branching (N=2) as a dynamic topological optimum that maximizes the network stiffness ratio κ_eff, rather than assuming it as an anatomical constraint.
主要结论
- The empirical branching exponent α_exp=2.70±0.20 emerges as a robust minimax optimum (α*=2.72 for G=11) between competing wave (α_w≈2.115) and transport (α_t∈[2.90,2.94]) attractors.
- The prediction is structurally robust, with sensitivity |Δα*|<0.01 across physiological parameter ranges, and depends critically only on the histological scaling exponent p=0.77.
- Binary branching (N=2) is uniquely selected as it maximizes the emergent network stiffness ratio κ_eff(N), a derived property of the unified framework.
摘要: The branching geometry of biological transport networks is canonically characterized by a diameter scaling exponent α. Traditionally, this exponent interpolates between two structural attractors: impedance matching (α∼2) for pulsatile wave propagation and viscous-metabolic minimization (α=3) for steady flow. We demonstrate that neither mechanism in isolation can predict the empirically observed αexp=2.70±0.20 in mammalian arterial trees. Incorporating the empirical sub-linear vessel-wall scaling h(r)∝r^p (p=0.77) into a three-term metabolic cost function rigorously breaks the universality of Murray’s cubic law — a consequence of cost-function inhomogeneity established via Cauchy’s functional equation — and bounds the static transport optimum to αt∈[2.90,2.94]. To account for the dynamic pulsatile environment, we formulate a unified network-level Lagrangian balancing wave-reflection penalties against steady transport-metabolic costs. Because the operational duty cycle η between pulsatile and steady states is inherently uncertain over developmental timescales, we cast the morphological optimization as a zero-sum game between network architecture and environmental state. By von Neumann’s minimax theorem — for which we provide a direct constructive proof exploiting the strict monotonicity of the cost curves — this game admits a unique saddle point (α∗,η∗) satisfying an exact equal-cost condition, from which the empirical exponent emerges as the robust optimal compromise between competing thermodynamic demands. We further prove that N=2 (binary branching) uniquely maximizes the network stiffness ratio κ_eff(N), establishing the universal preference for bifurcations not as an anatomical assumption but as a derived property of the unified wave-transport framework. Numerical evaluation on the porcine coronary tree (G=11 generations) yields α∗=2.72, in quantitative agreement with morphometric data. Sensitivity analysis confirms that this prediction is structurally robust to metabolic parameter variation (|Δα∗|<0.01 across the physiological range of viscosity and wall metabolic rates), depending critically only on the histological scaling exponent p — the single parameter with direct anatomical grounding. Specifically, the prediction is analytically insensitive to the exact value of the wall-thickness pre-factor c0, making the framework a zero-parameter derivation from fundamental scaling principles.