On the existence of Ulanowicz's optimal structural resilience in complex networks

Si-Yao Wei; Wei-Xing Zhou

arxiv: 2601.14747 · v2 · submitted 2026-01-21 · ⚛️ physics.soc-ph · cs.IT· cs.NA· math.IT· math.NA

On the existence of Ulanowicz's optimal structural resilience in complex networks

Si-Yao Wei , Wei-Xing Zhou This is my paper

Pith reviewed 2026-05-16 12:44 UTC · model grok-4.3

classification ⚛️ physics.soc-ph cs.ITcs.NAmath.ITmath.NA

keywords structural resiliencecomplex networksUlanowicz indexoptimal flow configurationasymptotic scalingdirected weighted networksexistence proofredundancy-efficiency balance

0 comments

The pith

Optimal Ulanowicz resilience is unattainable in two-node networks but exists for every directed weighted network with three or more nodes.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that Ulanowicz's optimal efficiency-redundancy balance cannot be reached in two-node networks. For any weighted directed network of size at least three with no self-loops, at least one flow configuration inside the feasible probability space attains the optimum. The authors introduce a parameterized symmetric model with uniform marginals to obtain exact existence results and to derive the required flow scalings. These scalings separate primary links, which decay as one over network size, from background redundancy links, which decay quadratically. The work therefore supplies a precise mathematical boundary rather than an engineering recipe.

Core claim

We rigorously prove that while optimal resilience is structurally unattainable in two-node networks, there exists at least one optimal flow configuration within the feasible probability space for any weighted and directed network with the network size N_V >=3 and no self-loops. Using a parameterized symmetric network model with uniform marginal distributions, the analytical and numerical results show that adjacent primary links must scale as O(N_V^{-1}) while non-adjacent background links scale as O(N_V^{-2}) with logarithmic corrections, so that an optimally resilient system differentiates into high-throughput primary channels and sparse redundancy pathways.

What carries the argument

The parameterized symmetric network model with uniform marginal distributions, which renders the existence proof and the asymptotic flow scalings analytically tractable.

If this is right

For every network of size three or larger, at least one flow configuration reaches the optimal resilience value inside the allowed probability space.
Primary links must decay in strength as one over network size while non-adjacent background links decay quadratically with logarithmic corrections.
The optimal configuration naturally separates into a small set of high-throughput primary channels and a much sparser set of redundancy pathways.
These scaling relations are required to maintain optimality as network size grows.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Empirical networks could be checked to see whether observed link weights follow the predicted primary-versus-background decay rates.
The existence result may extend to other resilience measures that combine efficiency and redundancy beyond Ulanowicz's specific index.
For very large networks the quadratic decay of background links implies that redundancy becomes extremely sparse, potentially limiting robustness to targeted removals.
Engineering approximations for large systems could focus resources on the primary channels while treating background links as a low-cost correction term.

Load-bearing premise

The derivations require a parameterized symmetric network model with uniform marginal distributions to keep the mathematics tractable.

What would settle it

Explicit construction of any three-node directed weighted network without self-loops in which no assignment of flows achieves the target optimal resilience value would falsify the existence claim.

Figures

Figures reproduced from arXiv: 2601.14747 by Si-Yao Wei, Wei-Xing Zhou.

**Figure 1.** Figure 1: The function R = −α ln α. Eq. (2) yields e(p) = X 2 i=1 X 2 j=1 pi j ln pi j p out i p in j = −p ln p − (1 − p) ln(1 − p). (7) According to Eq. (4), we have r(p) = − X 2 i=1 X 2 j=1 pi j ln pi j p out i − X 2 i=1 X 2 j=1 pi j ln pi j p in j = 0. (8) Accordingly, the ratio α(p) = e(p) e(p) + r(p) ≡ 1 for p ∈ [0, 1], (9) and the resilience R(p) = −α(p) ln α(p) = −1 · ln(1) = 0, (10) which represents that a t… view at source ↗

**Figure 2.** Figure 2: The network represented by Eq. (11). Simplifying, we get x + y + (NV − 3)z = 1 NV . (14) Due to symmetry, all nodes have identical marginals: p out i = p in j = x + y + (NV − 3)z = 1 NV , (15) which is the same as the probability normalization condition. Accordingly, we have e = X NV i=1 X NV j=1 pi j ln pi j p out i p in j = X NV i=1 X NV j=1 pi j ln pi j + 2 ln NV, (16) where X NV i=1 X NV j=1 pi j ln pi… view at source ↗

**Figure 3.** Figure 3: Four cases of governing equations. (a) x = y, (b) x = z, (c) z = 0, and (d) x = 0. where x,z ≥ 0. The normalization condition yields x = 1 2NV − (NV − 3)z 2 . (25) Substituting this expression into the second equation gives 2 " 1 2NV − (NV − 3)z 2 # ln " 1 2NV − (NV − 3)z 2 # + (NV − 3)zln z = − 2e e + 1 · ln NV NV . (26) The feasibility condition requires 0 ≤ z ≤ 1 NV(NV − 3) . (27) 10 [PITH_FULL_IMAGE:f… view at source ↗

**Figure 4.** Figure 4: The functions f(z) for NV = 4, 5, 6 (a), the values of x (b), and z (c) for different NV. The black dashed line denotes its first-order approximation and the red line denotes denotes its second-order approximation, where a1 and b1 are shown in Eq. (43). The entropy balance equation 2x ln x + (NV − 3)zln z = − 2e e + 1 · ln NV NV (39) can then be recast in terms of A and B as A ln A + B ln B − A ln 2 − B ln… view at source ↗

**Figure 5.** Figure 5: The values of x (a) and z (b) for different NV. The black dashed line denotes its firstorder approximation and the red line denotes denotes its second-order approximation, where a1 and b1 are shown in Eq. (64). 3.3.3. Existence of the optimal resilience Here we employ the case of y = z to prove the universality of the optimal resilience in complex networks and thereby propose two theorems. Theorem 1. Let … view at source ↗

**Figure 6.** Figure 6: Complete network (a) and unidirectional ring network (b). [PITH_FULL_IMAGE:figures/full_fig_p019_6.png] view at source ↗

**Figure 7.** Figure 7: The relationship between NV and the parameter of the optimal condition λ ∗ . 3.4. The case of z = 0 Assume z = 0. Eqs. (23) reduce to    x + y = 1 NV , x ln x + y ln y = − 2e e + 1 · ln NV NV , (96) where x, y ≥ 0. The normalization condition yields y = 1 NV − x. (97) 24 [PITH_FULL_IMAGE:figures/full_fig_p024_7.png] view at source ↗

**Figure 8.** Figure 8: The function f(x) and roots x for NV = 4. 26 [PITH_FULL_IMAGE:figures/full_fig_p026_8.png] view at source ↗

**Figure 9.** Figure 9: The functions f(z) for NV = 4, 5, 6 (a), the values of x (b), and z (c) for different NV. The black dashed line denotes its first-order approximation and the red line denotes denotes its second-order approximation, where a1 and b1 are shown in Eq. (125). 3.5.2. Asymptotic behavior of solutions Furthermore, by numerically solving f(z) = 0 for increasing NV, we observe that when NV becomes sufficiently large… view at source ↗

read the original abstract

This study provides a foundational theoretical investigation into the mathematical existence and asymptotic properties of Ulanowicz's structural resilience. While ecological evidence suggests that sustainable systems gravitate toward an optimal efficiency-redundancy balance at $\alpha = 1/\mathrm{e}$, the mathematical attainability of this configuration across broader network topologies remains unverified. We rigorously prove that while optimal resilience is structurally unattainable in two-node networks, there exists at least one optimal flow configuration within the feasible probability space for any weighted and directed network with the network size $N_\mathcal{V} \geq 3$ and no self-loops. To make the derivations analytically tractable, we introduce a parameterized symmetric network model with uniform marginal distributions. Using this stylized ansatz, our analytical and numerical results reveal that maintaining the optimal state requires distinct asymptotic scaling behaviors as $N_\mathcal{V}$ increases: adjacent primary links scale as $O(N_\mathcal{V}^{-1})$, whereas non-adjacent background links exhibit a steeper quadratic decay of $O(N_\mathcal{V}^{-2})$ with specific logarithmic corrections. Rather than serving as an immediate engineering tool, this work establishes a rigorous mathematical boundary for the optimal resilience framework, demonstrating analytically how an optimally resilient system differentiates into high-throughput primary channels and sparse redundancy pathways.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper proves optimal Ulanowicz resilience is impossible for two nodes but attainable for N_V >=3 inside a symmetric uniform-marginal model, with explicit scaling laws, though the abstract claims generality without showing it.

read the letter

The main point is that this work supplies the first explicit proof that the alpha=1/e configuration cannot be reached in two-node networks but can be reached for any larger network size in their setup, plus clean asymptotic rules for how primary and background flows must decay with N_V. They handle the two-node impossibility separately and then construct a feasible flow configuration that hits the target in the larger case. The derivations for the O(N_V^{-1}) primary links and O(N_V^{-2}) background links with logarithmic corrections are straightforward to follow and could be verified numerically without much trouble. That part of the paper is solid and new. The soft spot is the reliance on a parameterized symmetric network model with uniform marginal distributions, introduced to keep the math tractable. The abstract states the existence result holds for any weighted directed network with N_V >=3 and no self-loops, but the derivations stay inside the symmetric ansatz and no step shows the result survives when symmetry or uniformity is removed. That gap makes the strongest claim run a bit ahead of what is demonstrated. This paper is aimed at network theorists and ecologists who want a mathematical anchor for the 1/e rule rather than an immediate modeling tool. A reader who cares about existence proofs in stylized network models will get something concrete from it. It deserves a serious referee because the core math is grounded, the two-node case is handled cleanly, and the scaling results are reproducible within the model they actually use. I would send it to peer review and ask the authors to clarify whether the existence extends beyond the symmetric case or to adjust the abstract accordingly.

Referee Report

2 major / 2 minor

Summary. The manuscript claims to rigorously prove that Ulanowicz's optimal structural resilience (at efficiency-redundancy balance α = 1/e) is structurally unattainable in two-node networks but that at least one optimal flow configuration exists within the feasible probability space for any weighted directed network with N_V ≥ 3 and no self-loops. All analytical derivations and asymptotic scaling results (adjacent primary links O(N_V^{-1}), non-adjacent background links O(N_V^{-2}) with logarithmic corrections) are obtained inside a parameterized symmetric network model with uniform marginal distributions introduced for tractability.

Significance. If the existence result generalizes beyond the symmetric uniform-marginal ansatz, the work supplies a useful mathematical boundary condition for the optimal-resilience framework, clarifying how optimally resilient networks differentiate into high-throughput primary channels and sparse redundancy pathways. The two-node impossibility result and the scaling laws are concrete contributions that could guide future numerical and empirical studies.

major comments (2)

[Abstract] Abstract and the central existence statement: the claim that an optimal configuration exists 'for any weighted and directed network with N_V ≥ 3' is not supported by a general argument; all derivations are performed inside the stylized symmetric model with uniform marginals, and no robustness check or extension to asymmetric or non-uniform cases is supplied. This directly affects the load-bearing generality of the main theorem.
[Proof of existence for N_V ≥ 3] The transition from the two-node impossibility proof to the N ≥ 3 existence result relies on the same symmetric ansatz; it is therefore unclear whether the existence statement survives removal of symmetry or uniformity, which is required to justify the 'any network' phrasing.

minor comments (2)

Notation for network size alternates between N_V and N_ℛ; adopt a single symbol throughout.
The definition of the 'feasible probability space' should be stated explicitly for the general (non-symmetric) case before specializing to the model.

Simulated Author's Rebuttal

2 responses · 1 unresolved

We thank the referee for the careful reading and for identifying the need to align the abstract and central claims more precisely with the scope of the analysis. We agree that the existence result is derived within the parameterized symmetric network model with uniform marginals, introduced for analytical tractability, and that the phrasing 'for any weighted and directed network' requires qualification. We will revise the manuscript accordingly while preserving the two-node impossibility result and the scaling laws. Point-by-point responses follow.

read point-by-point responses

Referee: [Abstract] Abstract and the central existence statement: the claim that an optimal configuration exists 'for any weighted and directed network with N_V ≥ 3' is not supported by a general argument; all derivations are performed inside the stylized symmetric model with uniform marginals, and no robustness check or extension to asymmetric or non-uniform cases is supplied. This directly affects the load-bearing generality of the main theorem.

Authors: We agree that the existence statement is established inside the symmetric uniform-marginal model and that no extension or robustness check for asymmetric cases is supplied. The two-node impossibility holds independently of the full ansatz, but the positive existence result for N_V ≥ 3 relies on it. We will revise the abstract and the statement of the main result to specify that at least one optimal configuration exists for networks belonging to this parameterized symmetric class with N_V ≥ 3. The scaling behaviors and the two-node result remain unchanged. revision: yes
Referee: [Proof of existence for N_V ≥ 3] The transition from the two-node impossibility proof to the N ≥ 3 existence result relies on the same symmetric ansatz; it is therefore unclear whether the existence statement survives removal of symmetry or uniformity, which is required to justify the 'any network' phrasing.

Authors: The transition does rely on the symmetric ansatz for the N_V ≥ 3 case. We will revise the relevant sections and the abstract to remove the unqualified 'any network' language and to state explicitly that the existence result is shown under the symmetric uniform-marginal parameterization. A brief discussion of this modeling choice and its limitations will be added to the conclusions. revision: yes

standing simulated objections not resolved

A general existence proof for optimal resilience configurations in arbitrary asymmetric weighted directed networks that does not rely on the symmetric uniform-marginal ansatz.

Circularity Check

0 steps flagged

No circularity; derivations use explicit tractability model without reduction to inputs by construction

full rationale

The paper introduces a parameterized symmetric network model with uniform marginal distributions explicitly 'to make the derivations analytically tractable' and performs all analytical and numerical work inside that model. The existence claim for N_V >= 3 is stated for general weighted directed networks, but the provided text shows no self-definitional loop, no fitted parameter renamed as prediction, no load-bearing self-citation, and no ansatz smuggled via prior work. All steps rest on standard probability-space and flow constraints within the chosen model; the generalization step is a separate logical gap rather than a circular reduction. This meets the criteria for a self-contained derivation with score 0.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 0 invented entities

The central claim rests on a stylized symmetric network model introduced to enable closed-form analysis; this model is not derived from first principles but chosen for tractability.

free parameters (1)

parameterized symmetric network model parameters
Chosen to enforce uniform marginal distributions and enable analytical tractability of the flow configurations.

axioms (1)

domain assumption Uniform marginal distributions on the stylized symmetric network
Invoked to make the asymptotic scaling derivations analytically tractable.

pith-pipeline@v0.9.0 · 5537 in / 1125 out tokens · 24567 ms · 2026-05-16T12:44:50.128430+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel contradicts

?

contradicts
CONTRADICTS: the theorem conflicts with this paper passage, or marks a claim that would need revision before publication.

To make the derivations analytically tractable, we introduce a parameterized symmetric network model with uniform marginal distributions... x+y+(N_V-3)z=1/N_V ... α=e/(2 ln N_V - e) ... optimal when α=1/e
IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 1 ... existence of at least one optimal flow configuration ... for any weighted and directed network with N_V ≥3

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages

[1]

Journal of Operations Management 33-34, 111–122

Firm’s resilience to supply chain disruptions: scale development and empirical examination. Journal of Operations Management 33-34, 111–122. doi:10.1016/j.jom.2014.11.002. Brunnermeier, M.K.,

work page doi:10.1016/j.jom.2014.11.002 2014
[2]

Journal of Finance 79, 3683–3728

Presidential address: Macrofinance and resilience. Journal of Finance 79, 3683–3728. doi:10.1111/jofi.13403. Chen, X., Ma, S., Chen, L., Yang, L.,

work page doi:10.1111/jofi.13403
[3]

Transportation Research Part D 131, 104202

Resilience measurement and analysis of intercity public transportation network. Transportation Research Part D 131, 104202. doi:10.1016/ j.trd.2024.104202. Cohen, M., Cui, S., Doetsch, S., Ernst, R., Huchzermeier, A., Kouvelis, P., Lee, H., Matsuo, H., Tsay, A.A.,

work page arXiv 2024
[4]

Journal of Operations Management 68, 515–531

Bespoke supply-chain resilience: the gap between theory and practice. Journal of Operations Management 68, 515–531. doi:10.1002/joom.1184. Goerner, S.J., Lietaer, B., Ulanowicz, R.E.,

work page doi:10.1002/joom.1184
[5]

Ecological Economics 69, 76–81

Quantifying economic sustainability: Im- plications for free-enterprise theory, policy and practice. Ecological Economics 69, 76–81. doi:10.1016/j.ecolecon.2009.07.018. 32 Ivanov, D.,

work page doi:10.1016/j.ecolecon.2009.07.018 2009
[6]

Omega-International Journal of Management Science 127, 103081

Supply chain resilience: conceptual and formal models drawing from immune system analogy. Omega-International Journal of Management Science 127, 103081. doi:10. 1016/j.omega.2024.103081. Kahiluoto, H., Makinen, H., Kaseva, J.,

work page arXiv 2024
[7]

International Journal of Operations & Production Management 40, 271–292

Supplying resilience through assessing diversity of responses to disruption. International Journal of Operations & Production Management 40, 271–292. doi:10.1108/IJOPM-01-2019-0006. Khakifirooz, M., Fathi, M., Dolgui, A., Pardalos, P.M.,

work page doi:10.1108/ijopm-01-2019-0006 2019
[8]

International Journal of Production Research 63, 3331–3364

Assessing resiliency in scale-free supply chain networks: a stress testing approach based on entropy measurements and value- at-risk analysis. International Journal of Production Research 63, 3331–3364. doi:10.1080/ 00207543.2024.2361850. Kharrazi, A., Rovenskaya, E., Fath, B.D.,

work page arXiv 2024
[9]

Caziot and B

Network structure impacts global commod- ity trade growth and resilience. PLoS One 12, e0171184. doi:10.1371/journal.pone. 0171184. Kharrazi, A., Rovenskaya, E., Fath, B.D., Yarime, M., Kraines, S.,

work page doi:10.1371/journal.pone
[10]

Ecological Economics 90, 177–186

Quantifying the sustain- ability of economic resource networks: An ecological information-based approach. Ecological Economics 90, 177–186. doi:10.1016/j.ecolecon.2013.03.018. Liang, S., Yu, Y ., Kharrazi, A., Fath, B.D., Feng, C., Daigger, G.T., Chen, S., Ma, T., Zhu, B., Mi, Z., Yang, Z.,

work page doi:10.1016/j.ecolecon.2013.03.018 2013
[11]

doi:10.1038/s43016-020-0098-6

Nature Food 1, 365–375. doi:10.1038/s43016-020-0098-6. Liu, X., Li, D., Ma, M., Szymanski, B.K., Stanley, H.E., Gao, J.,

work page doi:10.1038/s43016-020-0098-6
[12]

Physics Reports 971, 1–108

Network resilience. Physics Reports 971, 1–108. doi:10.1016/j.physrep.2022.04.002. Lücker, F., Timonina-Farkas, A., Seifert, R.W.,

work page doi:10.1016/j.physrep.2022.04.002 2022
[13]

Production and Operations Management 34, 1495–1511

Balancing resilience and efficiency: a liter- ature review on overcoming supply chain disruptions. Production and Operations Management 34, 1495–1511. doi:10.1177/10591478241302735. 33 Luo, Z., Yu, Y ., Kharrazi, A., Fath, B.D., Matsubae, K., Liang, S., Chen, D., Zhu, B., Ma, T., Hu, S.,

work page doi:10.1177/10591478241302735
[14]

Nature Food 5, 48–58

Decreasing resilience of China’s coupled nitrogen-phosphorus cycling network requires urgent action. Nature Food 5, 48–58. doi:10.1038/s43016-023-00889-5. Pettit, T.J., Croxton, K.L., Fiksel, J.,

work page doi:10.1038/s43016-023-00889-5
[15]

Journal of Business Logistics 40, 56–65

The evolution of resilience in supply chain manage- ment: a retrospective on ensuring supply chain resilience. Journal of Business Logistics 40, 56–65. doi:10.1111/jbl.12202. Reggiani, A.,

work page doi:10.1111/jbl.12202
[16]

Journal of Theoretical Biology 57, 355–371

Ecological stability: An information theory viewpoint. Journal of Theoretical Biology 57, 355–371. doi:10.1016/0022-5193(76) 90007-2. Seidl, R., Spies, T.A., Peterson, D.L., Stephens, S.L., Hicke, J.A.,

work page doi:10.1016/0022-5193(76
[17]

Journal of Applied Ecology 53, 120–129

Searching for resilience: addressing the impacts of changing disturbance regimes on forest ecosystem services. Journal of Applied Ecology 53, 120–129. doi:10.1111/1365-2664.12511. Ulanowicz, R.E.,

work page doi:10.1111/1365-2664.12511
[18]

Oe- cologia 43, 295–298

Complexity, stability and self-organization in natural communities. Oe- cologia 43, 295–298. doi:10.1007/BF00344956. Ulanowicz, R.E.,

work page doi:10.1007/bf00344956
[19]

Ecological Modelling 220, 1886–1892

The dual nature of ecosystem dynamics. Ecological Modelling 220, 1886–1892. doi:10.1016/j.ecolmodel.2009.04.015. Ulanowicz, R.E., Goerner, S.J., Lietaer, B., Gomez, R.,

work page doi:10.1016/j.ecolmodel.2009.04.015 2009
[20]

Ecological Complexity 6, 27–36

Quantifying sustainability: Re- silience, efficiency and the return of information theory. Ecological Complexity 6, 27–36. doi:10.1016/j.ecocom.2008.10.005. Ulanowicz, R.E., Norden, J.S.,

work page doi:10.1016/j.ecocom.2008.10.005 2008
[21]

International Journal of Systems Science 21, 429–437

Symmetrical overhead in flow networks. International Journal of Systems Science 21, 429–437. doi:10.1080/00207729008910372. 34 Yang, Z., Wu, M., Sun, J., Zhang, Y .,

work page doi:10.1080/00207729008910372
[22]

Possible Harms of Artificial Intelligence and the EU AI act: Fundamental Rights and Risk

Aligning redundancy and flexibility for supply chain resilience: a literature synthesis. Journal of Risk Research 27, 313–335. doi:10.1080/ 13669877.2024.2328196. Zhu, Y ., Bao, Y ., Qin, L., Sun, Q., Shia, B.C., Chen, M.C.,

work page arXiv 2024
[23]

Annals of Operations Research doi:10.1007/s10479-024-06426-2

Resilience analysis based on multi-layer network community detection of supply chain network. Annals of Operations Research doi:10.1007/s10479-024-06426-2. Zorach, A.C., Ulanowicz, R.E.,

work page doi:10.1007/s10479-024-06426-2
[24]

doi:10.1002/cplx.10075

Quantifying the complexity of flow networks: How many roles are there? Complexity 8, 68–76. doi:10.1002/cplx.10075. 35

work page doi:10.1002/cplx.10075

[1] [1]

Journal of Operations Management 33-34, 111–122

Firm’s resilience to supply chain disruptions: scale development and empirical examination. Journal of Operations Management 33-34, 111–122. doi:10.1016/j.jom.2014.11.002. Brunnermeier, M.K.,

work page doi:10.1016/j.jom.2014.11.002 2014

[2] [2]

Journal of Finance 79, 3683–3728

Presidential address: Macrofinance and resilience. Journal of Finance 79, 3683–3728. doi:10.1111/jofi.13403. Chen, X., Ma, S., Chen, L., Yang, L.,

work page doi:10.1111/jofi.13403

[3] [3]

Transportation Research Part D 131, 104202

Resilience measurement and analysis of intercity public transportation network. Transportation Research Part D 131, 104202. doi:10.1016/ j.trd.2024.104202. Cohen, M., Cui, S., Doetsch, S., Ernst, R., Huchzermeier, A., Kouvelis, P., Lee, H., Matsuo, H., Tsay, A.A.,

work page arXiv 2024

[4] [4]

Journal of Operations Management 68, 515–531

Bespoke supply-chain resilience: the gap between theory and practice. Journal of Operations Management 68, 515–531. doi:10.1002/joom.1184. Goerner, S.J., Lietaer, B., Ulanowicz, R.E.,

work page doi:10.1002/joom.1184

[5] [5]

Ecological Economics 69, 76–81

Quantifying economic sustainability: Im- plications for free-enterprise theory, policy and practice. Ecological Economics 69, 76–81. doi:10.1016/j.ecolecon.2009.07.018. 32 Ivanov, D.,

work page doi:10.1016/j.ecolecon.2009.07.018 2009

[6] [6]

Omega-International Journal of Management Science 127, 103081

Supply chain resilience: conceptual and formal models drawing from immune system analogy. Omega-International Journal of Management Science 127, 103081. doi:10. 1016/j.omega.2024.103081. Kahiluoto, H., Makinen, H., Kaseva, J.,

work page arXiv 2024

[7] [7]

International Journal of Operations & Production Management 40, 271–292

Supplying resilience through assessing diversity of responses to disruption. International Journal of Operations & Production Management 40, 271–292. doi:10.1108/IJOPM-01-2019-0006. Khakifirooz, M., Fathi, M., Dolgui, A., Pardalos, P.M.,

work page doi:10.1108/ijopm-01-2019-0006 2019

[8] [8]

International Journal of Production Research 63, 3331–3364

Assessing resiliency in scale-free supply chain networks: a stress testing approach based on entropy measurements and value- at-risk analysis. International Journal of Production Research 63, 3331–3364. doi:10.1080/ 00207543.2024.2361850. Kharrazi, A., Rovenskaya, E., Fath, B.D.,

work page arXiv 2024

[9] [9]

Caziot and B

Network structure impacts global commod- ity trade growth and resilience. PLoS One 12, e0171184. doi:10.1371/journal.pone. 0171184. Kharrazi, A., Rovenskaya, E., Fath, B.D., Yarime, M., Kraines, S.,

work page doi:10.1371/journal.pone

[10] [10]

Ecological Economics 90, 177–186

Quantifying the sustain- ability of economic resource networks: An ecological information-based approach. Ecological Economics 90, 177–186. doi:10.1016/j.ecolecon.2013.03.018. Liang, S., Yu, Y ., Kharrazi, A., Fath, B.D., Feng, C., Daigger, G.T., Chen, S., Ma, T., Zhu, B., Mi, Z., Yang, Z.,

work page doi:10.1016/j.ecolecon.2013.03.018 2013

[11] [11]

doi:10.1038/s43016-020-0098-6

Nature Food 1, 365–375. doi:10.1038/s43016-020-0098-6. Liu, X., Li, D., Ma, M., Szymanski, B.K., Stanley, H.E., Gao, J.,

work page doi:10.1038/s43016-020-0098-6

[12] [12]

Physics Reports 971, 1–108

Network resilience. Physics Reports 971, 1–108. doi:10.1016/j.physrep.2022.04.002. Lücker, F., Timonina-Farkas, A., Seifert, R.W.,

work page doi:10.1016/j.physrep.2022.04.002 2022

[13] [13]

Production and Operations Management 34, 1495–1511

Balancing resilience and efficiency: a liter- ature review on overcoming supply chain disruptions. Production and Operations Management 34, 1495–1511. doi:10.1177/10591478241302735. 33 Luo, Z., Yu, Y ., Kharrazi, A., Fath, B.D., Matsubae, K., Liang, S., Chen, D., Zhu, B., Ma, T., Hu, S.,

work page doi:10.1177/10591478241302735

[14] [14]

Nature Food 5, 48–58

Decreasing resilience of China’s coupled nitrogen-phosphorus cycling network requires urgent action. Nature Food 5, 48–58. doi:10.1038/s43016-023-00889-5. Pettit, T.J., Croxton, K.L., Fiksel, J.,

work page doi:10.1038/s43016-023-00889-5

[15] [15]

Journal of Business Logistics 40, 56–65

The evolution of resilience in supply chain manage- ment: a retrospective on ensuring supply chain resilience. Journal of Business Logistics 40, 56–65. doi:10.1111/jbl.12202. Reggiani, A.,

work page doi:10.1111/jbl.12202

[16] [16]

Journal of Theoretical Biology 57, 355–371

Ecological stability: An information theory viewpoint. Journal of Theoretical Biology 57, 355–371. doi:10.1016/0022-5193(76) 90007-2. Seidl, R., Spies, T.A., Peterson, D.L., Stephens, S.L., Hicke, J.A.,

work page doi:10.1016/0022-5193(76

[17] [17]

Journal of Applied Ecology 53, 120–129

Searching for resilience: addressing the impacts of changing disturbance regimes on forest ecosystem services. Journal of Applied Ecology 53, 120–129. doi:10.1111/1365-2664.12511. Ulanowicz, R.E.,

work page doi:10.1111/1365-2664.12511

[18] [18]

Oe- cologia 43, 295–298

Complexity, stability and self-organization in natural communities. Oe- cologia 43, 295–298. doi:10.1007/BF00344956. Ulanowicz, R.E.,

work page doi:10.1007/bf00344956

[19] [19]

Ecological Modelling 220, 1886–1892

The dual nature of ecosystem dynamics. Ecological Modelling 220, 1886–1892. doi:10.1016/j.ecolmodel.2009.04.015. Ulanowicz, R.E., Goerner, S.J., Lietaer, B., Gomez, R.,

work page doi:10.1016/j.ecolmodel.2009.04.015 2009

[20] [20]

Ecological Complexity 6, 27–36

Quantifying sustainability: Re- silience, efficiency and the return of information theory. Ecological Complexity 6, 27–36. doi:10.1016/j.ecocom.2008.10.005. Ulanowicz, R.E., Norden, J.S.,

work page doi:10.1016/j.ecocom.2008.10.005 2008

[21] [21]

International Journal of Systems Science 21, 429–437

Symmetrical overhead in flow networks. International Journal of Systems Science 21, 429–437. doi:10.1080/00207729008910372. 34 Yang, Z., Wu, M., Sun, J., Zhang, Y .,

work page doi:10.1080/00207729008910372

[22] [22]

Possible Harms of Artificial Intelligence and the EU AI act: Fundamental Rights and Risk

Aligning redundancy and flexibility for supply chain resilience: a literature synthesis. Journal of Risk Research 27, 313–335. doi:10.1080/ 13669877.2024.2328196. Zhu, Y ., Bao, Y ., Qin, L., Sun, Q., Shia, B.C., Chen, M.C.,

work page arXiv 2024

[23] [23]

Annals of Operations Research doi:10.1007/s10479-024-06426-2

Resilience analysis based on multi-layer network community detection of supply chain network. Annals of Operations Research doi:10.1007/s10479-024-06426-2. Zorach, A.C., Ulanowicz, R.E.,

work page doi:10.1007/s10479-024-06426-2

[24] [24]

doi:10.1002/cplx.10075

Quantifying the complexity of flow networks: How many roles are there? Complexity 8, 68–76. doi:10.1002/cplx.10075. 35

work page doi:10.1002/cplx.10075