Graph Phase Transitions
Explore how random graphs transition from connected to disconnected as you remove nodes or edges. Generate binomial (Erdős–Rényi), geometric, or grid graphs, apply percolation, and watch the phase transition happen in real time.
Generate random graphs and apply percolation (random removal of nodes or edges) to observe phase transitions — the sharp change from connected to disconnected as the retention probability drops. Each connected component is shown in a different color.
About this project
Originally a Python project for the Algorithmics course at FIB-UPC, studying phase transitions in random graphs using NetworkX. This browser demo is a port of the graph generation, percolation, and connectivity/complexity analysis to TypeScript with interactive visualization.