Non-Homogeneous Economic Fitness & Complexity

• Non-Homogeneous Economic Fitness and Complexity is a reformulation of the Fitness–Complexity method that introduces additive offsets to prevent score collapse.
• The method modifies the iterative recursion with non-homogeneous terms and rescaling, resulting in a stable, parameter-free fixed point while preserving economic intuition.
• NHEFC ensures convergence and stability, facilitates analytic approximations, and extends to arbitrary network graphs beyond the traditional bipartite setting.

Non-Homogeneous Economic Fitness and Complexity (NHEFC) is a regularized reformulation of the nonlinear Fitness–Complexity framework for country–product bipartite networks. It preserves the core economic-complexity intuition that countries are fit if they export complex products and products are complex if only fit countries export them, but it modifies the homogeneous recursion by introducing positive non-homogeneous offsets and a subsequent rescaling that yields a stable, parameter-free limiting map. In the original presentation, this modification was introduced to cure a central weakness of the homogeneous formulation: empirically common matrix shapes can drive some country fitnesses and product complexities to zero. Later work recast NHEFC as the minimization of a specific cost function, established uniqueness of the solution, and extended the same inverse-coupled logic to arbitrary graphs beyond the traditional bipartite setting (Servedio et al., 2018, Bellina et al., 5 Jul 2025, Servedio et al., 2024).

1. Position within the fitness–complexity tradition

NHEFC belongs to the fitness–complexity branch of economic complexity, not to the linear eigenvector branch associated with ECI. The standard nonlinear Fitness–Complexity algorithm starts from a binary country–product matrix $M_{cp}$, where $M_{cp}=1$ means that country $c$ is competitively exporting product $p$, and iterates

$$F_c^{(n)}=\sum_p M_{cp}Q_p^{(n-1)}, \qquad Q_p^{(n)}=\left(\sum_c M_{cp}\frac{1}{F_c^{(n-1)}}\right)^{-1},$$

with normalization at each step. In this homogeneous formulation, country fitness is additive over product complexities, whereas product complexity is determined by a reciprocal aggregation over exporter fitnesses, so low-fitness exporters penalize complexity disproportionately (Servedio et al., 2018).

The motivation for NHEFC is inseparable from the convergence pathology of the homogeneous map. The convergence analysis of the original Fitness–Complexity Algorithm showed that the structure of the ordered matrix $M$ is essential to determine which countries and products converge to non zero values, and that only those matrices whose diagonal does not cross the empty part are guaranteed to have non zero outputs when the algorithm reaches the fixed point (Pugliese et al., 2014). Inward-bellied or sparse ordered matrices can therefore induce structural collapse of some scores to zero. This problem is not repaired by normalization alone, because normalization fixes scale but does not remove the absorbing boundary at zero. NHEFC was introduced precisely as a non-homogeneous regularization of that instability (Servedio et al., 2018).

A further conceptual distinction is that not every extension of the original Fitness–Complexity Method is non-homogeneous in the strict sense. For example, the generalized Fitness–Complexity metric with extremality parameter $\gamma$,

$$\tilde{Q}_{\alpha}^{(n)}(\gamma)=\Biggl[\sum_{i}M_{i\alpha}\bigl(F^{(n-1)}_{i}\bigr)^{-\gamma}\Biggr]^{-1/\gamma},$$

is a parameterized nonlinear homogeneous generalization because it changes the exponent in the reciprocal aggregation but does not introduce additive offsets or affine corrections (Mariani et al., 2015). NHEFC differs by adding explicit non-homogeneous terms.

2. Formal definition and parameter-free limit

The original NHEFC paper rewrites the product side of the standard method through product simplicity $P_p=Q_p^{-1}$, giving the homogeneous system

$$\left\{ \begin{array}{ll} F_c^{(n)} = \sum_{p'} M_{cp'}/P_{p'}^{(n-1)} \ P_p^{(n)} = \sum_{c'} M_{c'p}/F_{c'}^{(n-1)} . \end{array} \right.$$

NHEFC modifies this by adding positive non-homogeneous terms $M_{cp}=1$0 and $M_{cp}=1$1: $M_{cp}=1$2 The initialization is

$M_{cp}=1$3

Because the map is no longer homogeneous under multiplication by a common constant, the simplex normalization used by the original algorithm is not needed. At the fixed point, the variables automatically satisfy

$M_{cp}=1$4

In the original construction, $M_{cp}=1$5 is interpreted as intrinsic fitness and $M_{cp}=1$6 as an innovation threshold or baseline quality of a product (Servedio et al., 2018).

For practical simplicity, the paper sets

$M_{cp}=1$7

with a common scalar $M_{cp}=1$8. It then introduces the rescaled variables

$M_{cp}=1$9

so that the map becomes

$c$0

The key technical step is to take the limit $c$1 only after this rescaling, which yields the parameter-free fixed-point system

$c$2

In this limiting form, the meaningful product complexity is

$c$3

The method is therefore called parameter free not because no regularization is introduced, but because after suitable rescaling the relevant fixed point becomes independent of $c$4 for sufficiently small $c$5 (Servedio et al., 2018).

3. Convergence, stability, and optimization structure

The non homogeneous terms guarantee both convergence and stability in the original NHEFC formulation (Servedio et al., 2018). The local convergence proof proceeds through the Jacobian of the non-homogeneous map. With diagonal matrices

$c$6

the Jacobian is

$c$7

and in the empirical regime relevant to country–product data, with $c$8 and $c$9, the analysis shows that the spectral radius is below one, implying asymptotic stability and exponentially fast local convergence (Servedio et al., 2018).

A later theoretical development reformulated NHEFC as an optimization problem and established the uniqueness of the NHEFC solution (Bellina et al., 5 Jul 2025). In the monopartite notation

$p$0

the associated cost function is

$p$1

After the logarithmic reparameterization

$p$2

the cost becomes

$p$3

This reformulation clarifies the role of the regularization parameter and the intrinsic logarithmic structure of the algorithm. It also leads to a conservative, gradient-based update rule that substantially accelerates algorithmic convergence (Bellina et al., 5 Jul 2025).

These results are best understood against the background of the homogeneous algorithm’s geometric convergence theory. In the standard Fitness–Complexity map, the ordered support of $p$4 controls whether some components collapse to zero, and in simplified block matrices the critical condition can be written through the area ratio

$p$5

If $p$6, the lower block’s fitness decays to zero; if $p$7, it decays as $p$8; if $p$9, it converges to a positive limit (Pugliese et al., 2014). NHEFC is a response to that structural fragility.

4. Analytical approximations and derived indicators

One of the distinctive features of NHEFC is that the rescaled parameter-free limit admits an approximate analytic solution for actual binarized RCA matrices in the regime

$$F_c^{(n)}=\sum_p M_{cp}Q_p^{(n-1)}, \qquad Q_p^{(n)}=\left(\sum_c M_{cp}\frac{1}{F_c^{(n-1)}}\right)^{-1},$$0

Let

$$F_c^{(n)}=\sum_p M_{cp}Q_p^{(n-1)}, \qquad Q_p^{(n)}=\left(\sum_c M_{cp}\frac{1}{F_c^{(n-1)}}\right)^{-1},$$1

be country diversification and

$$F_c^{(n)}=\sum_p M_{cp}Q_p^{(n-1)}, \qquad Q_p^{(n)}=\left(\sum_c M_{cp}\frac{1}{F_c^{(n-1)}}\right)^{-1},$$2

the co-production matrix that counts how many products two countries export in common. Then the first-order approximation is

$$F_c^{(n)}=\sum_p M_{cp}Q_p^{(n-1)}, \qquad Q_p^{(n)}=\left(\sum_c M_{cp}\frac{1}{F_c^{(n-1)}}\right)^{-1},$$3

or componentwise

$$F_c^{(n)}=\sum_p M_{cp}Q_p^{(n-1)}, \qquad Q_p^{(n)}=\left(\sum_c M_{cp}\frac{1}{F_c^{(n-1)}}\right)^{-1},$$4

Hence product complexity is approximately

$$F_c^{(n)}=\sum_p M_{cp}Q_p^{(n-1)}, \qquad Q_p^{(n)}=\left(\sum_c M_{cp}\frac{1}{F_c^{(n-1)}}\right)^{-1},$$5

This makes explicit the usual economic-complexity intuition that a product is less complex if it is exported by countries with low diversification (Servedio et al., 2018).

For countries, the corresponding first-order approximation is

$$F_c^{(n)}=\sum_p M_{cp}Q_p^{(n-1)}, \qquad Q_p^{(n)}=\left(\sum_c M_{cp}\frac{1}{F_c^{(n-1)}}\right)^{-1},$$6

or

$$F_c^{(n)}=\sum_p M_{cp}Q_p^{(n-1)}, \qquad Q_p^{(n)}=\left(\sum_c M_{cp}\frac{1}{F_c^{(n-1)}}\right)^{-1},$$7

Fitness is therefore diversification minus a penalty for overlap with other countries, weighted by how diversified those other countries are. This decomposition yields a graph-theoretic quantity

$$F_c^{(n)}=\sum_p M_{cp}Q_p^{(n-1)}, \qquad Q_p^{(n)}=\left(\sum_c M_{cp}\frac{1}{F_c^{(n-1)}}\right)^{-1},$$8

which measures redundancy or inefficiency through weighted common-neighbor overlap in the bipartite graph (Servedio et al., 2018).

From this decomposition the paper defines country net-efficiency. Since inefficiency follows approximately

$$F_c^{(n)}=\sum_p M_{cp}Q_p^{(n-1)}, \qquad Q_p^{(n)}=\left(\sum_c M_{cp}\frac{1}{F_c^{(n-1)}}\right)^{-1},$$9

in the empirical data, net-efficiency is defined approximately as

$M$0

It is interpreted as a measure of how efficiently a country invests in capabilities able to generate innovative complex high quality products. Fitness and net-efficiency are complementary: the former is tied mainly to diversification, whereas the latter is a detrended measure of how sophisticated the export basket is relative to that diversification level (Servedio et al., 2018).

5. Generalizations and relation to neighboring methods

NHEFC has been generalized from the original country–product bipartite setting to arbitrary graphs. Using a full adjacency matrix $M$1, the generalized recursion is

$M$2

In the bipartite case, if

$M$3

this reduces exactly to the symmetric NHEFC recursion. In the monopartite case, the converged node score defines a new centrality measure called fitness centrality, and its degree-orthogonalized version defines orthofitness centrality (Servedio et al., 2024). This extension shows that the non-homogeneous regularization is not merely a device for trade data; it is what makes the inverse-coupled fitness logic well defined beyond strictly bipartite networks.

The distinction between NHEFC and other neighboring methods is mathematically sharp. Standard FC has been shown to be equivalent to the Sinkhorn–Knopp matrix-scaling problem at the level of the fixed point, up to normalization and rescaling, and this equivalence reveals the scale invariance of the homogeneous algorithm (Mazzilli et al., 2022). NHEFC departs from that homogeneous structure by introducing additive offsets. For the same reason, generalized FC methods based only on alternative exponents, such as the extremality parameter $M$4, remain homogeneous generalizations rather than non-homogeneous ones (Mariani et al., 2015).

NHEFC also differs from linear eigenvector methods. ECI minimizes a quadratic form associated with the network Laplacian, whereas NHEFC minimizes the inverse-logarithmic cost function given above (Bellina et al., 5 Jul 2025). This difference is substantive rather than cosmetic: ECI is spectral and smoothing, while NHEFC is nonlinear, regularized, and inverse-coupled.

6. Empirical scope, related applications, and limitations

Empirically, NHEFC almost reproduces the results of the original homogeneous metric while avoiding zero-score collapse. The original paper reports very high correlations between the new metric and the standard one, with country-fitness correlation around $M$5 and product-complexity correlation around $M$6 in 2007, and it reports that the analytic approximation for $M$7 has relative error below $M$8 for more than $M$9 of countries. In random bit-flip robustness tests, NHEFC performs essentially identically to the original metric, so the gain is regularization and interpretability rather than a wholesale change in rankings (Servedio et al., 2018).

Much of the subsequent applied literature remains outside NHEFC in the strict formal sense. Urban patent work adapted the standard Fitness–Complexity framework to metropolitan area–technology matrices and added coherent diversification, but explicitly did not introduce a non-homogeneous FC algorithm (Straccamore et al., 2022). A later cross-scale patent study found that technological fitness and coherence–growth relations are strongly scale-dependent across metropolitan areas, regions, and countries, which suggests the need for a scale-aware or non-homogeneous extension even though the underlying FC iteration remained standard (Straccamore et al., 28 Mar 2025). City-complexity work based on deviations from urban scaling laws mixed heterogeneous social, economic, environmental, and governance outcomes in a city–outcome matrix, but the non-homogeneity resided in the construction of the input matrix rather than in the iterative operator itself (Sahasranaman et al., 2019). Comparable subnational applications to US counties and Indian states likewise generalized the domain of the homogeneous algorithm rather than the recursion (Sbardella et al., 2016, Sahasranaman et al., 2018).

The limitations of NHEFC are correspondingly specific. The original analytic approximation is developed for binarized RCA matrices and the empirically relevant regime $\gamma$0, and the original stability proof is local rather than global (Servedio et al., 2018). The later optimization-based reinterpretation provides uniqueness and faster computation, but the empirical foundations of most applications still depend on how the country–product or entity–activity matrix is built, binarized, or regularized (Bellina et al., 5 Jul 2025). A plausible implication is that NHEFC should be distinguished from the broader class of heterogeneous-input FC applications: the former modifies the dynamics through explicit non-homogeneous terms, whereas the latter usually leave the homogeneous recursion unchanged.