Between 2013 and 2015, Marcus, Spielman and Srivastava wrote a sequence of papers where they famously solved the Kadison-Singer problem, proved the existence of infinitely many Ramanujan graphs of any fixed degree, and derived strong restricted invertibility results. With the goal of putting their results (and the results of other follow up work) under the same umbrella, we introduce amalgamated finite free probability, which is a framework that draws connections between real stable polynomials and free probability. This is joint work with Nikhil Srivastava.