Graph theory and probability
Random connections can create surprisingly organised networks.
This prototype explores random graphs in the style of G(n, p), where each possible edge appears with probability p. Learners can change n and p, then watch connected components form and merge.
The aim is to connect graph theory with probability, networks and the idea of phase transitions in a visual, experimental way.
Random graph lab
Change edge probability and watch structure appear
This prototype generates a random graph in the style of G(n, p): start with n vertices, then include each possible edge with probability p.
Edges
19
Average degree
2.71
Components
2
Largest component
13 / 14
Joy in the process
The point is not just to finish. It is to notice, test and return.
These tools are invitations to explore. A good mistake, a surprising pattern or a question you cannot yet answer is part of the work, not a failure of it.
The challenge is deliberate: the site should support thinking, not remove the need for it.
Future extensions