Algorithmics · FIB-UPC

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.

View Source on GitHub
📊
Phase Transitions in Random Graphs

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.

Graph family:
Grid side:10×10 = 100 nodes
Percolation:
Retention probability:1.00
Phase transition curve:Sweeps retention probability 0→1, measuring P(connected) and P(all complex) over multiple trials.

About this project

Originally a Python project for the Algorithmics course at FIB-UPC, studying phase transitions in random graphs using NetworkX. This full-stack web app wraps the original Python/NetworkX logic in a FastAPI backend with a Lit (Web Components) + Canvas + D3.js frontend for interactive graph visualization and Monte Carlo phase transition charts.

Previous MPIDS Solver Interactive graph dominance solver with D3 force-directed visualization. Find the minimum positive influence dominating set using greedy and SA-style local search.
  • Elm
  • D3.js
  • FastAPI
  • Graph Theory
 Next Travel agency (PDDL) Automated planning practice: PDDL domain for trips with flights, hotels, numeric constraints, and metric minimization.
  • PDDL
  • Planning
  • UPC

More Projects

Recommendation System
  • Java
  • Spring Boot
  • Recommendation
Computer Graphics Shader Playground
  • WebGL2
  • GLSL
  • Shaders
  • UPC
Robotics Dashboard
  • Ember.js
  • Babylon.js
  • Robotics
  • Canvas
  • EKF
Desastres IA
  • Solid.js
  • FastAPI
  • Local search
  • Canvas
  • UPC