SearcharxivSearch

arXiv subjects

Lars M. Salbu

Publications and source records attributed to Lars M. Salbu.

8 recordsLinked to original sources

Encoding the Euler Characteristic Transform

The Euler Characteristic Curve (ECC) records the Euler characteristic of a linearly embedded cell complex as a function of filtration height in a given direction, and the Euler Characteristic Transform (ECT) is the injective shape descriptor obtained by collecting ECCs over many directions. How the ECT is encoded for a neural network is itself an inductive bias, conventionally fixed by discretizing each ECC. We introduce a continuous encoding: for each direction and each vertex it records the net Euler-characteristic change attributed to that vertex, producing a per-direction token sequence that a small transformer maps to a feature vector. We separate the resulting pipeline into two stages on orthogonal axes: an ECC encoder that acts within each direction, mapping its curve to a fixed-length vector, and an ECT representation that acts across directions, aggregating the per-direction vectors into one. We study six ECT representation architectures spanning a range of inductive biases, from a structure-agnostic feedforward baseline to convolutional and complex-valued models that preserve equivariance under planar rotations. Across six classification benchmarks covering point clouds, graphs, cubical complexes, and meshes, the continuous encoding improves accuracy on all six datasets, and control experiments attribute the gain to the tokenization itself rather than to the added transformer capacity. The representation architecture matters less than the encoding, and the payoff from its inductive biases depends on the encoding: a feedforward network performs best under continuous encoding but is less robust under discretization than convolutional architectures.

cs.LG

Reeb Graph of Sample Thickenings

We consider the Reeb graph of a thickening of points sampled from an unknown space. Our main contribution is a framework to transfer reconstruction results similar to the well-known work of Niyogi, Smale, and Weinberger to the setting of Reeb graphs. To this end, we first generalize and study the interleaving distances for Reeb graphs. We find that many of the results previously established for constructible spaces also hold for general topological spaces. We use this to show that under certain conditions for topological spaces with real-valued Lipschitz maps, the Reeb graph of a sample thickening approximates the Reeb graph of the underlying space. Finally, we provide an algorithm for computing the Reeb graph of a sample thickening.

cs.CG

Monoidal Rips: Stable Multiparameter Filtrations of Directed Networks

We introduce the monoidal Rips filtration, a filtered simplicial set for weighted directed graphs and other lattice-valued networks. Our construction generalizes the Vietoris-Rips filtration for metric spaces by replacing the maximum operator, determining the filtration values, with a more general monoidal product. We establish interleaving guarantees for the monoidal Rips persistent homology, capturing existing stability results for real-valued networks. When the lattice is a product of totally ordered sets, we are in the setting of multiparameter persistence. Here, the interleaving distance is bounded in terms of a generalized network distance. We use this to prove a novel stability result for the sublevel Rips bifiltration. Our experimental results show that our method performs better than Flagser in a graph regression task, and that combining different monoidal products in point cloud classification can improve performance.

math.AT

Core Bifiltration

The motivation of this paper is to recognize a geometric shape from a noisy sample in the form of a point cloud. Inspired by the HDBSCAN clustering algorithm, we introduce the core dissimilarity, from which we construct the core bifiltration. We also consider the Delaunay core bifiltration by intersecting with Voronoi cells, giving us a filtered simplicial complex of smaller size. A major advantage of the (Delaunay) core bifiltration is that, for each filtration value, it admits a good cover of balls. By the persistent nerve theorem, the nerve of this cover is homotopy equivalent to the (Delaunay) core bifiltration. We show that the multicover-, core- and Delaunay core bifiltrations are all interleaved, and that they enjoy similar stability properties with respect to the Prohorov distance. We have performed experiments with the Delaunay core bifiltration. In the experiments, we calculated persistent homology along lines in the two-dimensional persistence parameter space, as well as multipersistence module approximations and Hilbert functions for the full Delaunay core bifiltration.

math.AT

Dowker Duality for Relations of Categories

We propose a categorification of the Dowker duality theorem for relations. Dowker's theorem states that the Dowker complex of a relation $R \subseteq X \times Y$ of sets $X$ and $Y$ is homotopy equivalent to the Dowker complex of the transpose relation $R^T \subseteq Y \times X$. Given a relation $R$ of small categories $\mathcal{C}$ and $\mathcal{D}$, that is, a functor of the form $R \colon \mathcal{R} \to \mathcal{C} \times \mathcal{D}$, we define the bisimplicial rectangle nerve $ER$ and the Dowker nerve $DR$. The diagonal $d(ER)$ of the bisimplicial set $ER$ maps to the simplicial set $DR$ by a natural projection $d(π_R) \colon d(ER) \to DR$. We introduce a criterion on relations of categories ensuring that the projection from the diagonal of the bisimplicial rectangle nerve to the Dowker nerve is a weak equivalence. Relations satisfying this criterion are called Dowker relations. If both the relation $R$ of categories and its transpose relation $R^T$ are Dowker relations, then the Dowker nerves $DR$ and $DR^T$ are weakly equivalent simplicial sets. In order to justify the abstraction introduced by our categorification we give two applications. The first application is to show that Quillen's Theorem A can be considered as an instance of Dowker duality. In the second application we consider a simplicial complex $K$ with vertex set $V$ and show that the geometric realization of $K$ is naturally homotopy equivalent to the geometric realization of the simplicial set with the set of $n$-simplices given by functions $\{0,1,\dots,n\}\to V$ whose image is a simplex of $K$.

math.AT

The Rectangle Complex of a Relation

We construct a simplicial complex, the rectangle complex of a relation R, and show that it is homotopy equivalent to the Dowker complex of R. This results in a short and conceptual proof of functorial versions of Dowker's Theorem used in topological data analysis.

math.AT

Determining homology of an unknown space from a sample

The homology of an unknown subspace of Euclidean space can be determined from the intrinsic Čech complex of a sample of points in the subspace, without reference to the ambient Euclidean space. More precisely, given a subspace $X$ of Euclidean space and a sample $A$ of points in $X$, we give conditions for the homology of $X$ to be isomorphic to a certain persistent homology group of the intrinsic Čech complex.

math.AT

The Parameterized Complexity of Finding Minimum Bounded Chains

Finding the smallest $d$-chain with a specific $(d-1)$-boundary in a simplicial complex is known as the \textsc{Minimum Bounded Chain} (MBC$_d$) problem. The MBC$_d$ problem is NP-hard for all $d\geq 2$. In this paper, we prove that it is also W[1]-hard for all $d\geq 2$, if we parameterize the problem by solution size. We also give an algorithm solving the MBC$_1$ problem in polynomial time and introduce and implemented two fixed parameter tractable (FPT) algorithms solving the MBC$_d$ problem for all $d$. The first algorithm is a generalized version of Dijkstra's algorithm and is parameterized by solution size and coface degree. The second algorithm is a dynamic programming approach based on treewidth, which has the same runtime as a lower bound we prove under the exponential time hypothesis.

cs.CG