Two datasets that share hidden structure have high coupling. A bridge frequency connecting them reveals the relationship. Same math as finding a common friend between two strangers.
K here is spectral coupling between datasets. Two signals that share structure have high K. A bridge frequency connecting them reveals the relationship.
There is one equation that finds fraud in financial networks, finds disease-causing mutations in proteins, and places 40 million transistors on a chip in 4.5 seconds. Same equation. Same code. Different inputs.
The equation takes any network — any set of things connected to other things — and finds the weakest link. The point where the network would split in two if you cut one connection. The bottleneck. The fault line.
In a financial network, that fault line is where the laundering happens. Enron, Madoff, Wirecard, FTX, Danske Bank — five fraud patterns tested, five detected. The fraudulent structure always sits at the bottleneck because that is where the money has to pass through the fewest hands. The equation finds it by looking at the coupling structure, not the transactions.
In a protein, the same fault line identifies which mutations will cause disease. Change an amino acid at the structural bottleneck and the entire protein’s fold propagates the damage. Change one at the surface and nothing happens. The equation predicts pathogenicity with 82% accuracy using only the shape of the contact network. No training data. No machine learning. Just the coupling structure.
In a computer chip, the same fault line identifies where to partition 40 million gates into groups that minimize wire crossings. Place strongly coupled gates near each other. Weakly coupled gates far apart. 4.5 seconds for 40 million placements.
This is not a claim that proteins are financial networks. The physics differ. What is identical is the graph structure. A bottleneck in a money flow and a bottleneck in a protein backbone and a bottleneck in a chip layout are all the same mathematical object: a sign change in the second-smallest eigenvector of the Laplacian. One number. Same code path in all three domains.
The equation is from 1973 (Fiedler). We did not discover it. We ran it on three things nobody thought to run it on at the same time.
Could you detect financial fraud by treating transactions like amino acid contacts? Could you find protein mutations by treating contact maps like transaction flows?
The answer is yes — because the spectral gap doesn't care what the nodes are. A bottleneck in a protein is structurally identical to a bottleneck in a money laundering network. Both show up as sign changes in the same eigenvector.