Probabilistic validation of homology computations for nodal domains
Probabilistic validation of homology computations for nodal domains
Homology has long been accepted as an important computable tool for quantifying complex structures. In many applications, these structures arise as nodal domains of real-valued functions and are therefore amenable only to a numerical study based on suitable discretizations. Such an approach immediately raises the question of how accurate the …