Whitney's 2-isomorphism theorem for graphings

We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. For locally finite graphings, we define a weak isomorphism to be an edge-measure-preserving Borel bijection that preserves cycles and hyperfinite subgraphs, modulo null sets. Our rigidity theorem sho