Least change in the Determinant or Permanent of a matrix under perturbation of a single element: continuous and discrete cases

We formulate the problem of finding the probability that the determinant of a matrix undergoes the least change upon perturbation of one of its elements, provided that most or all of the elements of the matrix are chosen at random and that the randomly chosen elements have a fixed probability of being non-zero. Also, we show that the procedure for finding the probability that the determinant undergoes the least change depends on whether the random variables for the matrix elements are continuous or discrete.

💡 Research Summary

The paper addresses a fundamental probabilistic question: given an n × n matrix whose entries are random variables, what is the probability that perturbing a single entry produces the smallest possible change in the determinant (or permanent) of the matrix? The authors consider two distinct probabilistic models for the matrix entries. In the “continuous” model each entry is zero with probability p and, with probability 1 − p, takes a value drawn from a continuous density f(x). In the “discrete” model each entry is zero with probability p and, with probability 1 − p, takes one of a finite set of non‑zero constants {c₁,…,c_k} according to a prescribed mass function. All entries are assumed independent and identically distributed.

The analysis begins with the classical cofactor expansion of the determinant. If the (p,q) entry a_{pq} is altered by an amount ε, the change in the determinant is Δ = ε·C_{pq}, where C_{pq}=(-1)^{p+q}det(M_{pq}) is the cofactor of a_{pq} and M_{pq} is the (n‑1) × (n‑1) sub‑matrix obtained by deleting row p and column q. Consequently, the determinant experiences the “least possible change” (i.e., Δ = 0) precisely when C_{pq}=0. Thus the problem reduces to evaluating the probability that the cofactor of a randomly chosen entry vanishes.

In the continuous setting the cofactor is a continuous function of the independent random entries of M_{pq}. The event {C_{pq}=0} is equivalent to the sub‑matrix M_{pq} being singular. Because each entry of M_{pq} is zero with probability p, the singularity probability can be expressed as a polynomial in p and (1‑p). The authors develop a recursive formulation based on the inclusion‑exclusion principle and on a transition‑matrix representation of the process of building a singular sub‑matrix row by row. They show that for sparse matrices (p → 0) the singularity probability scales linearly with p, reflecting the fact that the dominant singular configurations are those in which at least one row (or column) of M_{pq} is entirely zero.

In the discrete case the situation is more nuanced because the entries can only assume a finite set of values. The determinant change Δ can be zero in two mutually exclusive ways: (i) the perturbed entry itself is zero (a_{pq}=0), which automatically yields Δ=0 regardless of the cofactor, or (ii) a_{pq}=c_k (non‑zero) while the cofactor C_{pq}=0. Hence the overall probability of minimal change is
P_min = p + (1‑p)·P(C_{pq}=0).
The probability that C_{pq}=0 again coincides with the singularity probability of M_{pq}, but now the singular configurations are combinatorial: a sub‑matrix is singular if it contains a row (or column) of all zeros. Because each row of M_{pq} consists of n‑1 independent entries, the probability that a particular row is all zero is p^{,n‑1}. Using the union bound and exact inclusion‑exclusion, the authors derive closed‑form expressions for P(C_{pq}=0) as a function of p and n.

The paper then turns to the permanent, per(A), which lacks the alternating sign of the determinant. The change induced by perturbing a_{pq} is Δ = ε·P_{pq}, where P_{pq} is the permanent‑cofactor (the permanent of M_{pq}). In the continuous model, P_{pq}=0 occurs with probability zero, so the only way to achieve Δ=0 is again a_{pq}=0, giving P_min = p. In the discrete model, however, P_{pq}=0 precisely when M_{pq} has a zero row, an event with probability p^{,n‑1}. Consequently the minimal‑change probability for the permanent becomes p + (1‑p)·p^{,n‑1}.

Beyond the derivations, the authors discuss several applications. In numerical linear algebra, the probability that a single perturbation leaves the determinant unchanged quantifies the sensitivity of matrix‑based algorithms to localized errors. In signal processing, a small perturbation of a channel coefficient that does not affect the overall system determinant indicates robustness of the filter structure. In quantum computing, where unitary evolutions are represented by matrices, the probability that a gate error confined to one matrix element does not alter the determinant (which for unitary matrices is of unit magnitude) can be used to assess error‑propagation characteristics.

A key insight of the work is the stark contrast between continuous and discrete random models. In the continuous case the cofactor being exactly zero is a measure‑zero event; therefore the determinant’s minimal change is governed almost entirely by the probability that the perturbed entry itself is zero. In the discrete case, the cofactor can vanish with positive probability because the underlying sub‑matrix can be singular in a combinatorial sense. This dichotomy leads to different analytical techniques: integration and transition‑matrix recursions for the continuous case, versus combinatorial inclusion‑exclusion for the discrete case. The paper thus provides a unified framework for quantifying the least‑change probability of determinants and permanents under single‑entry perturbations, highlighting how the nature of the underlying randomness fundamentally shapes the answer.