The tree-to-cycle transition scale is introduced, a single number given by the radius of the thickest edge outside the maximum spanning tree, which is interpreted as the highest cost a network accepts for redundancy and suggests a route to comparing observed networks by the trade-off they realize.
Abstract
Biological transport networks range from tree-like to highly reticulated architectures, which have been proposed to reflect different balances between viscous dissipation and metabolic cost. This balance cannot currently be inferred from structure: available descriptors either discard edge width entirely or preserve it only as a hierarchical decomposition that has not been mapped to the dissipation–cost trade-off. Here we introduce the tree-to-cycle transition scale, a single number given by the radius of the thickest edge outside the maximum spanning tree, which we interpret as the highest cost a network accepts for redundancy. We compute it for networks adapting to spatially correlated load fluctuations, whose correlation length sets their position on the Pareto front. The transition scale decreases linearly with dissipation and increases linearly with metabolic cost. Its scatter is largest in the regime where some networks end up off the front, and adding a growth term removes the scatter but splits the correlation into two branches. A single quantity read off the static network architecture thus characterizes where a network sits on the Pareto front, and is sensitive to the trajectory the network took through the optimization landscape. This suggests a route to comparing observed networks, for example leaf venations across species or growth conditions, by the trade-off they realize.
The long-term rise of civilizational complexity on macroscopic scales has been widely explained from technological or institutional perspectives, yet a unified mechanism linking physical-level constraints to civilizational-level dynamics remains absent. Drawing on dissipative structure theory, energy competition can be...
Adding links generally improves classical transport by increasing the number of available paths. We show that coherent quantum transport can display the opposite behavior. Using continuous-time quantum walks on a percolated hierarchical small-world network, we identify a coherent overconnectivity penalty: root-to-bound...
We derive a one-dimensional reduction for nonlinear dynamics on simplicial complexes containing both pairwise and triangular (higher-order) interactions. The effective state is defined using a mixed weight determined by the pairwise and triangular degrees of each node. The resulting reduced equation retains two structu...
Amit Tiwari, C. Hens, Prosenjit Kundu· 0 citations
This work introduces Scale Partitioning by Incremental Nested Entropy (SPINE), a deterministic framework that identifies scale structure without these inputs and applies to geometric, categorical, network, spectral, and dynamical measures.
Spectral gaps are widely interpreted as signatures of collective organization, yet it is rarely clear whether the resulting modes correspond to physical variables or merely to convenient mathematical coordinates. Here we show that, in resistor-coupled LC networks, the graph Laplacian defines an experimentally accessibl...
Establishing a robust and physically interpretable link between static structure and heterogeneous relaxation dynamics remains a fundamental challenge in glass physics. Here, we introduce a weighted pair-entropy descriptor based on the conventional two-body excess entropy. For this, we multiply the integrand used to ca...
Jun Wu, Walter Kob, Yu-Jie Wang et al.· 0 citations
Related blog posts
Microsoft Research Blog· microsoft.comOct 29, 2026
Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.