• Produce large random flow or pore networks from a given template or base network. • Spatial heterogeneity of nodes or pores are preserved from the base network. • Connectivity and throat-/pore-statistics are preserved as well. • Bounded and unbounded, that is periodic networks can be generated. • Tests involving homogeneous and highly heterogeneous networks are documented. Over the past years, tomographic scanning techniques like micro-CT have become popular for the acquisition of high-fidelity void-space geometries of natural porous media (e.g., Bultreys et al., 2016; Raeini et al., 2017). Limitations both in computing time and memory prohibit, however, direct numerical simulations of flow and transport in large resp. detailed sample geometries. Flow or pore networks derived from scans alleviate this limitation, but still necessitate a methodology to extrapolate to larger samples. In this work, we present a network generation algorithm that is particularly suited for heterogeneous irregular networks. While emulating from an existing base network new networks of equal or larger sizes, the outlined algorithm scales approximately linearly with the network node or pore count and maintains (1) node connectivity resp. pore coordination-number statistics, (2) geometrical pore/throat properties, as well as (3) the potentially inhomogeneous spatial clustering of pores. While existing methods address the first two properties, the third point is crucial especially in heterogeneous media to match flow/transport properties like the permeability that have a strong dependence on the spatial distance between connected pores. Moreover, the cubical networks generated by our algorithm are periodic in all spatial directions, thus eliminating topological boundary effects, which are not present in natural media. Bounded networks of arbitrary sizes can then be recovered by cutting the generated networks and thus flow/transport processes at larger scales can be studied while incorporating physically-based descriptions of pore-scale processes. [ABSTRACT FROM AUTHOR]