Streaming Complexity of Computing Expander Decompositions with Repeated Applications

Computing a sequence of expander decompositions, where each decomposition is applied to the inter-cluster edges of the previous one, requires space that depends on the sparsity parameter φ, even in insertion-only streams.