Tech News
← Home  ·  All topics

Transitive Graphs

1 GoKawiil brief on this topic

Mathematicians resolve long-standing 'sharpness conjecture' in percolation theory

Researchers have completed a proof of the sharpness conjecture for percolation on infinite transitive graphs, closing a problem that mathematicians including Itai Benjamini and Oded Schramm had pursued for decades. The result establishes how quickly phase transitions occur in these systems, confirming that above the critical threshold the connected structure behaves like a vast, dominant network rather than scattered isolated clusters.