Structural Susceptibility Matrix

• Structural Susceptibility Matrix is a family of sensitivity operators that quantify how structural perturbations affect system trajectories across various contexts.
• In dynamical systems, it is defined as the Hessian of a least-squares cost, with its eigenvalues revealing stiff (sensitive) and sloppy (insensitive) parameter directions.
• In Bayesian learning and contagion models, it serves as a linear-response map linking data or state perturbations to structural changes, aiding inverse and patterning analyses.

Searching arXiv for the cited papers and closely related work to ground the article. Searching arXiv for (Chachra et al., 2011) and (Elliott et al., 8 May 2026). The structural susceptibility matrix is a matrix-valued object used to quantify how structural perturbations propagate through a modeled system, but its precise definition is context-dependent. In nonlinear dynamical systems, it is the Hessian of a least-squares trajectory-mismatch cost, equivalently $S=J^\top J$, and measures how infinitesimal perturbations of the dynamical law affect an observed trajectory (Chachra et al., 2011). In Bayesian learning, it is a covariance-based linear-response matrix whose entries pair model components with data perturbations, and it is, up to a factor of $n\beta$, the Jacobian of the map from data distributions to structural coordinates (Elliott et al., 8 May 2026). In a susceptibility-stratified contagion model, the same phrase is used for a block matrix that encodes how susceptibility classes contribute to new infections and whose infection block yields $R_0$ through its spectral radius (Rose et al., 2020). This diversity of usage indicates that the term denotes a family of sensitivity operators rather than a single universally standardized construction.

1. Dynamical-systems definition as a Hessian

In the dynamical-systems formulation, one begins from a least-squares cost

$C(\theta)=\tfrac12\sum_k [y_k(\theta)-d_k]^2$

or, in the continuous-time setting,

$$C(\theta)=\tfrac12\int_0^N \|z(t;\theta)-z_0(t)\|^2\,dt,$$

where $\theta=(\theta_1,\dots,\theta_P)$ are parameters, $z_0(t)$ is the unperturbed trajectory, and $z(t;\theta)$ the perturbed one. The structural susceptibility matrix is then defined by

$$S_{ij}\equiv \frac{\partial^2 C}{\partial \theta_i\,\partial \theta_j}\Big|_{\theta=0}.$$

At the best fit, if $J$ is the Jacobian of the model outputs with respect to parameters,

$n\beta$0

then

$n\beta$1

This construction is explicitly identified with the Hessian matrix of the least-squares cost function (Chachra et al., 2011).

The associated interpretation is geometric. The eigenvalues of $n\beta$2 quantify sensitivity along linear combinations of parameters, and diagonalization

$n\beta$3

defines eigenparameters through the eigenvectors $n\beta$4. Large $n\beta$5 correspond to stiff directions in parameter space, whereas small $n\beta$6 correspond to sloppy directions. The data summarize this as an apparently inherent insensitivity to large magnitude variations in certain linear combinations of parameters, with sloppiness quantified by Hessian eigenvalues that typically span many orders of magnitude (Chachra et al., 2011).

A sensitivity-based representation follows from the variational equation. Defining

$n\beta$7

one has

$n\beta$8

with $n\beta$9 or, as stated in the source, with appropriate phase-matching and period corrections. The Hessian entries can then be written as

$R_0$0

In the special case where the cost compares directly the vector field perturbations $R_0$1, one finds the formally simpler approximation

$R_0$2

neglecting state-sensitivity propagation.

2. Polynomial perturbations in the van der Pol oscillator

The canonical van der Pol equations are written in slow-fast form by setting $R_0$3: $R_0$4 or, equivalently,

$R_0$5

To study structural susceptibility, a polynomial perturbation is added to the right-hand side of the $R_0$6-equation: $R_0$7 The perturbation amplitudes $R_0$8 are the parameters, with

$R_0$9

This polynomial basis induces a natural decomposition. For $C(\theta)=\tfrac12\sum_k [y_k(\theta)-d_k]^2$0, the perturbation terms vanish on the critical manifold $C(\theta)=\tfrac12\sum_k [y_k(\theta)-d_k]^2$1, and these are termed fast parameters. For $C(\theta)=\tfrac12\sum_k [y_k(\theta)-d_k]^2$2, the perturbations act on the slow manifold and are termed slow parameters (Chachra et al., 2011).

The significance of this construction is that the structural susceptibility matrix is not merely a local curvature object but also a classifier of perturbation types. The data state that perturbations in the van der Pol dynamics show that most directions in parameter space weakly affect the limit cycle, whereas only a few directions are stiff. This provides an explicit realization of sloppiness in a nonlinear oscillator with multiple time scales.

3. Time-scale separation, eigenvalue clustering, and the singular limit

The van der Pol example is used to connect structural susceptibility to separation of time scales. The summary states that the quantity $C(\theta)=\tfrac12\sum_k [y_k(\theta)-d_k]^2$3 versus $C(\theta)=\tfrac12\sum_k [y_k(\theta)-d_k]^2$4 typically shows an almost straight line over many decades, which is identified as the hallmark of sloppiness. In the single time-scale limit $C(\theta)=\tfrac12\sum_k [y_k(\theta)-d_k]^2$5, the eigenvalues exhibit a broad but moderate spread. As $C(\theta)=\tfrac12\sum_k [y_k(\theta)-d_k]^2$6 and $C(\theta)=\tfrac12\sum_k [y_k(\theta)-d_k]^2$7, the eigenvalues separate into two clusters (Chachra et al., 2011).

The asymptotic structure is explicit. The top $C(\theta)=\tfrac12\sum_k [y_k(\theta)-d_k]^2$8 eigenvalues, corresponding to stiff modes, approach $C(\theta)=\tfrac12\sum_k [y_k(\theta)-d_k]^2$9 constants as $$C(\theta)=\tfrac12\int_0^N \|z(t;\theta)-z_0(t)\|^2\,dt,$$0 increases. The remaining $$C(\theta)=\tfrac12\int_0^N \|z(t;\theta)-z_0(t)\|^2\,dt,$$1 eigenvalues decay as power laws in $$C(\theta)=\tfrac12\int_0^N \|z(t;\theta)-z_0(t)\|^2\,dt,$$2, with two modes numerically scaling as $$C(\theta)=\tfrac12\int_0^N \|z(t;\theta)-z_0(t)\|^2\,dt,$$3 and the rest as $$C(\theta)=\tfrac12\int_0^N \|z(t;\theta)-z_0(t)\|^2\,dt,$$4. The source therefore states that, as $$C(\theta)=\tfrac12\int_0^N \|z(t;\theta)-z_0(t)\|^2\,dt,$$5, slow-manifold perturbations remain costly, with stiff $$C(\theta)=\tfrac12\int_0^N \|z(t;\theta)-z_0(t)\|^2\,dt,$$6, whereas jump-only perturbations become increasingly negligible in the least-squares cost, with sloppy $$C(\theta)=\tfrac12\int_0^N \|z(t;\theta)-z_0(t)\|^2\,dt,$$7 (Chachra et al., 2011).

The eigenvectors sharpen this interpretation. The stiff eigenvectors lie primarily in the subspace of slow parameters $$C(\theta)=\tfrac12\int_0^N \|z(t;\theta)-z_0(t)\|^2\,dt,$$8, and these combinations deform the slow manifold on which the system spends most of its period. The sloppy eigenvectors lie in the subspace of fast parameters with $$C(\theta)=\tfrac12\int_0^N \|z(t;\theta)-z_0(t)\|^2\,dt,$$9; they only deform the short jumps, and as $\theta=(\theta_1,\dots,\theta_P)$0 these jumps occupy vanishing time. In the singular limit, the matrix is approximated analytically by

$\theta=(\theta_1,\dots,\theta_P)$1

so the Hessian acquires a block-diagonal form with stiff and sloppy blocks.

A plausible implication is that structural susceptibility provides a quantitative route from slow-fast geometry to parameter-space anisotropy: the temporal occupancy of different regions of phase space controls which perturbations remain visible to a trajectory-based cost.

4. Bayesian learning: covariance, linear response, and structural coordinates

In Bayesian learning, the structural susceptibility matrix is introduced in a different but formally related way. One first chooses a family of $\theta=(\theta_1,\dots,\theta_P)$2 component observables $\theta=(\theta_1,\dots,\theta_P)$3. If $\theta=(\theta_1,\dots,\theta_P)$4 is a product decomposition isolating component $\theta=(\theta_1,\dots,\theta_P)$5 and $\theta=(\theta_1,\dots,\theta_P)$6 is the trained parameter, then

$\theta=(\theta_1,\dots,\theta_P)$7

where

$\theta=(\theta_1,\dots,\theta_P)$8

is the population loss. The corresponding structural coordinate is its posterior expectation

$\theta=(\theta_1,\dots,\theta_P)$9

with population Gibbs posterior

$z_0(t)$0

Data perturbations are introduced by

$z_0(t)$1

Under $z_0(t)$2, the loss becomes $z_0(t)$3. By the fluctuation-dissipation theorem, for any observable $z_0(t)$4,

$z_0(t)$5

For the basis of perturbations obtained by upweighting a single data point $z_0(t)$6, with $z_0(t)$7, one has $z_0(t)$8, and the structural susceptibility matrix $z_0(t)$9 is defined by

$z(t;\theta)$0

Equivalently,

$z(t;\theta)$1

The matrix is therefore, up to the factor $z(t;\theta)$2, the Jacobian of the map

$z(t;\theta)$3

and its differential form is

$z(t;\theta)$4

In this setting, the structural susceptibility matrix pairs model components with data patterns and supplies a linearized map from distributional perturbations to structural change (Elliott et al., 8 May 2026).

5. Pseudo-inverse, empirical estimation, and patterning

The Bayesian formulation leads directly to an inverse problem. Given a target change $z(t;\theta)$5 in structural coordinates, linearization gives

$z(t;\theta)$6

When $z(t;\theta)$7 is not square or not full-rank, the minimal-norm least-squares solution is given by the Moore-Penrose pseudo-inverse: $z(t;\theta)$8 Equivalently, if $z(t;\theta)$9, then

$$S_{ij}\equiv \frac{\partial^2 C}{\partial \theta_i\,\partial \theta_j}\Big|_{\theta=0}.$$0

The source identifies this as the patterning prescription: the smallest-norm distributional perturbation that achieves the desired first-order change in $$S_{ij}\equiv \frac{\partial^2 C}{\partial \theta_i\,\partial \theta_j}\Big|_{\theta=0}.$$1 (Elliott et al., 8 May 2026).

Empirically, one works with a finite dataset $$S_{ij}\equiv \frac{\partial^2 C}{\partial \theta_i\,\partial \theta_j}\Big|_{\theta=0}.$$2, the empirical posterior

$$S_{ij}\equiv \frac{\partial^2 C}{\partial \theta_i\,\partial \theta_j}\Big|_{\theta=0}.$$3

and the estimator

$$S_{ij}\equiv \frac{\partial^2 C}{\partial \theta_i\,\partial \theta_j}\Big|_{\theta=0}.$$4

where $$S_{ij}\equiv \frac{\partial^2 C}{\partial \theta_i\,\partial \theta_j}\Big|_{\theta=0}.$$5 is the weight on sample $$S_{ij}\equiv \frac{\partial^2 C}{\partial \theta_i\,\partial \theta_j}\Big|_{\theta=0}.$$6. A posterior sampler such as SGLD can be used to draw $$S_{ij}\equiv \frac{\partial^2 C}{\partial \theta_i\,\partial \theta_j}\Big|_{\theta=0}.$$7 samples $$S_{ij}\equiv \frac{\partial^2 C}{\partial \theta_i\,\partial \theta_j}\Big|_{\theta=0}.$$8 and estimate empirical covariances by sample averages. Because $$S_{ij}\equiv \frac{\partial^2 C}{\partial \theta_i\,\partial \theta_j}\Big|_{\theta=0}.$$9 contains a delta-slice, the implementation uses a weight-restricted sampler on $J$0, estimates a renormalized susceptibility $J$1, and then standardizes columns to remove unknown renormalization constants before SVD or patterning. To stabilize inversion, the source gives the ridge-regularized inverse

$J$2

which replaces $J$3 by $J$4 in the SVD representation (Elliott et al., 8 May 2026).

The computational profile is also explicit: $J$5 has size $J$6; typically $J$7; low-rank modes can be extracted by randomized SVD or Lanczos with cost $J$8 rather than $J$9; and if $n\beta$00 is very large, one may subsample a representative batch of data points or cluster data points a priori and treat each cluster as one column. If the posterior is sharply peaked and roughly Gaussian, covariances may be approximated via the Hessian inverse $n\beta$01 at $n\beta$02, whereas in deep nets the posterior is typically non-Gaussian, so SGLD is used.

6. Susceptibility-class matrices in contagion dynamics and terminological variation

In a susceptibility-stratified contagion model, $n\beta$03 denotes individual susceptibility, $n\beta$04 its population density, and $n\beta$05 the susceptible mass at time $n\beta$06 among those with susceptibility $n\beta$07. The governing assumption is that individuals of susceptibility $n\beta$08 are removed from $n\beta$09 at rate $n\beta$10, yielding

$n\beta$11

With

$n\beta$12

the aggregated equations are

$n\beta$13

More generally, the moments

$n\beta$14

satisfy

$n\beta$15

so closure requires carrying infinitely many moments (Rose et al., 2020).

For discrete susceptibility classes $n\beta$16, with $n\beta$17, the state vector is

$n\beta$18

and the dynamics are written in block form as

$n\beta$19

This large matrix $n\beta$20 is called the structural susceptibility matrix. More compactly,

$n\beta$21

The infection block then gives a next-generation matrix

$n\beta$22

with spectral radius

$n\beta$23

For a continuous distribution, the analogous quantity is

$n\beta$24

The herd-immunity condition is expressed through

$n\beta$25

and the herd-immunity fraction is

$n\beta$26

A common misconception would be to treat these three uses of the term as interchangeable. The summarized literature does not support that. In the van der Pol analysis, the matrix is a Hessian of a trajectory cost; in Bayesian learning, it is a covariance-defined response matrix and Jacobian of structural coordinates; in contagion modeling, it is a state-transition block matrix or infection block tied to $n\beta$27. The common thread is susceptibility of structure to perturbation, but the underlying state spaces, derivatives, and inferential roles are distinct.