Daniel Amankwah

The Scaling Limit of Random Two-Connected Series–Parallel Maps

A finite graph embedded in the plane is called a series–parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series–parallel maps with n edges and show that under fairly general integrability conditions on these w...