This article isolates my investigations into extending a Hodge-Laplacian-based scale-selection pipeline to three-dimensional manifolds and evaluating witness-complex constructions. The starting point was an existing model-selection framework [1]; my work focused on testing its behaviour beyond simple two-dimensional examples, investigating alternative complex constructions, and identifying where the computational and statistical assumptions break down –.
1. Scale selection from the Hodge heat operator
Let \(M\subset\mathbb R^d\) be an unknown manifold and \(X=\{x_1,\ldots,x_n\}\) a finite sample from it. To estimate a Betti number \(\beta_q(M)\), construct a family of simplicial complexes \(\Sigma(r)\) indexed by a scale \(r\). The scale matters: too little connectivity leaves genuine structure disconnected, while too much connectivity fills cycles or merges components. Under sampling and reach assumptions, manifold-reconstruction results constrain the scale at which a complex can recover a manifold, although those quantities may be difficult to estimate in practice [7].
For a complex at scale \(r\), let \(\Delta_{q,r}\) be its degree-\(q\) Hodge Laplacian. The heat operator
suppresses nonzero spectral modes as \(t\) increases. In the finite-dimensional setting, its long-time limit is the orthogonal projection onto the harmonic subspace [2], [3]:
A family of candidate dissimilarities \(d\) compares a finite-time heat operator with its limiting projection, yielding a score such as [4]:
This is a model-selection heuristic, not a general guarantee that the maximizing scale recovers the topology [1]. The investigation asked how far the approach could be taken when the geometry and topology became more complicated.
2. Extending the evaluation to three-dimensional geometry
I extended the experimental investigation to point clouds sampled from surfaces in three-dimensional ambient space, including spheres, multiple spheres, tori, and higher-genus tori,. These cases test different topological signatures: for example, a sphere has \(\beta_2=1\), while a standard torus has \(\beta_1=2\) and \(\beta_2=1\).
The experiments showed why results on circles cannot be treated as evidence of general reliability. The scale-selection criteria varied substantially across geometries. Even with uniform sampling, several methods struggled on toroidal examples, especially as the topology became more complex. This was an important negative result: extending the code and running the method in 3D is not the same as establishing a robust 3D estimator.
The archived experiments evaluated relative entropy, Hilbert–Schmidt distance, trace distance, and a barcode-based alternative [8]. The following are representative accuracies across 50 trials in the recorded experiments:
| Geometry | Target | Relative entropy | Hilbert–Schmidt | Trace | Barcode |
|---|---|---|---|---|---|
| Sphere | \(\beta_2=1\) | 0.84 | 0.22 | 0.00 | 0.86 |
| Two disjoint spheres | \(\beta_2=2\) | 0.26 | 0.00 | 0.02 | 0.40 |
| Torus | \(\beta_1=2\) | 0.16 | 0.22 | 0.30 | 0.10 |
| Genus-2 torus | \(\beta_1=4\) | 0.00 | 0.00 | 0.00 | 0.02 |
These results are specific to the recorded implementation and test settings. They should be read as evidence of uneven behaviour, not as universal rankings of the dissimilarity measures.
3. Why investigate witness complexes?
Vietoris–Rips complexes can become expensive because a dense 1-skeleton generates many higher-dimensional cliques. Witness complexes offer a way to build a complex on a smaller landmark set \(L\), using the remaining data points as witnesses to relationships among landmarks [5], [6].
I tested both strong and lazy witness constructions. Random landmark selection was unsatisfactory in the initial experiments, so I switched to a maxmin strategy: after choosing an initial landmark, repeatedly select the data point whose distance to its nearest existing landmark is largest. This spreads landmarks across the observed data rather than allowing them to cluster in already well-sampled regions. The witness-complex construction and landmark strategy are discussed in the cited witness-complex literature [5].
The motivation was practical as well as mathematical. A smaller complex reduces the storage burden of the Hodge Laplacian, and landmark selection can change how well a complex reflects a non-uniform sample. In the recorded experiments, witness complexes reduced storage and helped in some settings, but the improvement was not universal. Accuracy could remain poor for difficult geometries or strongly non-uniform samples.
4. The trade-off: fewer simplices, harder construction
Witness complexes exchange one computational burden for another. They can reduce the number of simplices stored and therefore make subsequent linear algebra more manageable. However, checking witness conditions can itself be expensive, particularly for geometries such as tori that need many landmarks to represent their structure adequately.
Landmark count is therefore not a harmless implementation setting. Too few landmarks can erase features before the scale-selection stage has a chance to recover them; too many can diminish the computational advantage. A landmark budget suitable for a sphere need not be suitable for a torus or a higher-genus surface,.
5. What I take from these experiments
- Three-dimensional tests expose weaknesses that are easy to miss on circles and other simple examples.
- The choice of simplicial-complex construction affects both memory use and the topology available to the estimator.
- Maxmin landmark selection was a more useful starting point than random landmarks in the experiments I recorded.
- Witness complexes offered computational benefits, but did not remove the difficulty of scale selection or guarantee accurate Betti-number estimates.
The contribution documented here is the extension and experimental investigation: carrying the scale-selection pipeline into 3D test cases, implementing and evaluating witness-complex alternatives, and recording both the gains and the failure modes –. The results motivate further work, but do not establish a general theorem guaranteeing correct scale selection.
References
- Guzmán-Tristán, A., Rieser, A., & Velázquez-Richards, E. (2024). Noncommutative model selection and the data-driven estimation of real cohomology groups.
- Mémoli, F., Wan, Z., & Wang, Y. (2022). “Persistent Laplacians: Properties, algorithms and implications.” SIAM Journal on Mathematics of Data Science, 4(2), 858–884.
- Ebli, S., & Spreemann, G. (2019). “A notion of harmonic clustering in simplicial complexes.” CoRR, abs/1910.07247.
- Grande, V. P., & Schaub, M. T. (2024). “Disentangling the spectral properties of the Hodge Laplacian: not all small eigenvalues are equal.” In ICASSP 2024, pp. 9896–9900. IEEE, April 2024.
- de Silva, V., & Carlsson, G. (2004). “Topological estimation using witness complexes.” In SPBG’04 Symposium on Point-Based Graphics 2004, Eurographics Association.
- Arafat, N. A., Basu, D., & Bressan, S. (2023). “Topological Data Analysis with ε-Net Induced Lazy Witness Complex.” arXiv preprint:2303.07356.
- Majhi, S. (2024). “Demystifying Latschev’s Theorem: Manifold Reconstruction from Noisy Data.” arXiv preprint:2305.17288.
- Chazal, F., Cohen-Steiner, D., Glisse, M., Guibas, L., & Oudot, S. Y. (2009). “Proximity of persistence modules and their diagrams.” In SoCG 2009: 25th Annual Symposium on Computational Geometry, Aarhus, Denmark, June 2009. ACM Press.