Paper List
-
The Effective Reproduction Number in the Kermack-McKendrick model with age of infection and reinfection
This paper addresses the challenge of accurately estimating the time-varying effective reproduction number ℛ(t) in epidemics by incorporating two crit...
-
Covering Relations in the Poset of Combinatorial Neural Codes
This work addresses the core challenge of navigating the complex poset structure of neural codes to systematically test the conjecture linking convex ...
-
Collective adsorption of pheromones at the water-air interface
This paper addresses the core challenge of understanding how amphiphilic pheromones, previously assumed to be transported in the gas phase, can be sta...
-
pHapCompass: Probabilistic Assembly and Uncertainty Quantification of Polyploid Haplotype Phase
This paper addresses the core challenge of accurately assembling polyploid haplotypes from sequencing data, where read assignment ambiguity and an exp...
-
Setting up for failure: automatic discovery of the neural mechanisms of cognitive errors
This paper addresses the core challenge of automating the discovery of biologically plausible recurrent neural network (RNN) dynamics that can replica...
-
Influence of Object Affordance on Action Language Understanding: Evidence from Dynamic Causal Modeling Analysis
This study addresses the core challenge of moving beyond correlational evidence to establish the *causal direction* and *temporal dynamics* of how obj...
-
Revealing stimulus-dependent dynamics through statistical complexity
This paper addresses the core challenge of detecting stimulus-specific patterns in neural population dynamics that remain hidden to traditional variab...
-
Exactly Solvable Population Model with Square-Root Growth Noise and Cell-Size Regulation
This paper addresses the fundamental gap in understanding how microscopic growth fluctuations, specifically those with size-dependent (square-root) no...
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.