Structural analysis on Facebook.

Three graph algorithms from a UT Dallas big data assignment, ported to TypeScript so they run live in your browser. The arc moves from descriptive statistics on a real social graph to structural decomposition to reliability under random edge failure.

PageRank and friends on Facebook

The original was a PySpark and GraphFrames pipeline that ran five algorithms over the Facebook MUSAE edge list. The TypeScript port implements PageRank, triangle count, connected components, in degree, and out degree. The 22,000 node graph ships as a bundled CSV. Upload your own edge list or use the default.

K core peeling

A classical structural decomposition. Repeatedly remove vertices with degree less than k, and what survives is the k core. Three sample graphs to try (Petersen, K5, and a small example), with animated peeling that shows each round of removals.

Network reliability polynomial

Exact two terminal reliability computed by exhaustively enumerating every edge failure subset. For a graph with E edges, that means 2^E of them. For each subset, remove the failed edges, check connectivity from source to target with a BFS, and weight by the probability of that subset. Summing across all subsets gives the reliability at a given edge failure probability. The demo sweeps p from zero to one and plots the polynomial. Edit the graph and watch the curve change live.