Notes on Percolation Analysis of Sampled Scalar Fields

Percolation analysis is used to explore the connectivity of randomly connected infinite graphs. In the finite case, a closely related percolation function captures the relative volume of the largest connected component in a scalar field’s superlevel set. While prior work has shown that random scalar fields with little spatial correlation yield a sharp transition in this function, little is known about its behavior on real data. In this work, we explore how different characteristics of a scalar field—such as its histogram or degree of structure—influence the shape of the percolation function. We estimate the critical value and transition width of the percolation function, and propose a corresponding normalization scheme that relates these values to known results on infinite graphs. In our experiments, we find that percolation analysis can be used to analyze the degree of structure in Gaussian random fields. On a simulated turbulent duct flow data set we observe that the critical values are stable and consistent across time. Our normalization scheme indeed aids comparison between data sets and relation to infinite graphs.
QC 20221005