A team of five mathematicians, Sahar Diskin, Philip Easo, Ritvik Ramanan Radhakrishnan, Benny Sudakov, and Vincent Tassion, at ETH Zurich, successfully developed a proof for a significant open problem in percolation theory. This theory studies the flow within a network, such as fluids seeping through materials or the spread of phenomena through interconnected systems.
The proof specifically addresses a decades-old question concerning the rate at which a percolation network becomes flooded when fluid flow is introduced. Their work provides a fundamental understanding of how large connected areas can take over graphs, which are networks of points connected by lines.
The mathematicians worked through December 2025 to finalize their argument, which they found to be simple yet capable of dealing with a wide variety of graphs. Experts in the field, such as Asaf Nachmias of Tel Aviv University, have described the proof as "stunning" due to its elegance and impact on the understanding of phase transitions in networks.
Percolation theory has broad applications, including modeling virus spread, gas filtration, and wildfire propagation. Its origins trace back to Rosalind Franklin's work in the 1940s at the British Coal Utilization Research Association (BCURA), where she investigated why certain types of coal allowed fluids to pass through while others were impermeable, studying the intricate properties of coal, charcoals, and graphite.
✨ This summary was generated by AI from the outlets' reporting listed below. It is not independently verified and may contain errors — check the original sources. How BrevFeed works →
One email each morning: the day's tech stories, clustered across outlets and summarized. No account needed.
One email a day. Unsubscribe in one click, any time.
Spend a few minutes, get the whole day. Every topic's top stories in one hands-free rundown — listen, watch, or read the transcript.
▶ Play today's briefNew every morning, and the back catalogue is archived by date.
Five mathematicians at ETH Zurich developed a proof for a long-standing problem in percolation theory, which describes how networks are taken over by connected areas. This breakthrough provides a fundamental understanding of how quickly a percolation network floods as fluid flow is introduced.