Compressing networks: when roads become points express

Original: "Lossy compression of weighted graph adjacency matrices by transform coding"
arXiv:2607.14834 · 2026-07-16 · CC BY 4.0 · 1 min
Scientists found a clever way to compress numeric networks: lines become dots, and barely noticeable fluctuations are discarded.

📄 Showing the "Simple" version — "Popular" is not ready yet. Add it to favorites to help prioritize it.

An ordinary road map with traffic is a heap of numbers. Sending them all as is takes too long. But you can reduce the volume without losing the gist. Researchers found a clever solution: first redraw the map so that streets become points, and intersections become bridges between these points. Then street traffic is analyzed like sound: complex noise is decomposed into simple rhythms (the principle of spectroscopy). The quietest, barely perceptible beats are discarded — no one will notice their disappearance. The remaining loud rhythms are packed using entropy coding — a method that squeezes out repeats and keeps only the essentials. Scientists also derived a simple smoothness measure: if traffic on neighboring streets changes smoothly, the map compresses much better. In practice, this gives tenfold compression with almost no loss. Interestingly, the trick of turning streets into points was invented back in 1932, but only now has it started working in full force.

The compression ratio is directly tied to information entropy — a concept introduced by Claude Shannon. The more chaotic the data, the harder it is to pack; smoothness is a sign of order.

Scientists
Ludwig BoltzmannRudolf ClausiusJacob BekensteinStephen HawkingJames Clerk MaxwellEdward Witten
Concepts
weight Graphs graph neural network weighted mean autoencoder data compression phylogenetic network elliptic curve homotopy