In the paper Quotient-convergence of submodular setfunctions, we developed a limit theory for matroids, and more generally for submodular setfunctions. We later showed in Cycle Matroids of Graphings: From Convergence to Duality that the theory is in line with the notion of local-global convergnece of bounded-degree graphs. In a new paper titled Convergent sequences of combinatorial submodular setfunctions we show that the limit theory applies to a variety of further combinatorially interesting submodular setfunctions, like the rank functions of linear spaces, cut capacity functions, homomorphism density functions, and matroids of many dense graphs.