PSPrimoz Skraba

Primoz Skraba

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Primoz Skraba has a total of 22 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Möbius homology

    by Amit Patel, Primoz Skraba

    This paper introduces and develops Möbius homology, a homology theory for representations of finite posets into abelian categories. Although the connection between poset topology and Möbius functions is classical, we go further by establishing a direct connection between poset topology and Möbius inversions. In particular, we show that Möbius homology categorifies the Möbius inversion, as its Euler characteristic coincides with the Möbius inversion applied to the dimension function of the representation. We also present a homological version of Rota’s Galois Connection Theorem, relating the Möbius homologies of two posets connected by a Galois connection. Our main application concerns persistent homology over general posets. We prove that, under a suitable definition, the persistence diagram arises as an Euler characteristic over a poset of intervals, and thus Möbius homology provides a categorification of the persistence diagram. This furnishes a new invariant for persistent homology over arbitrary finite posets. Finally, leveraging our homological variant of Rota’s Galois Connection Theorem, we establish several results about the persistence diagram.

  • Open Access

    Persistent Local Systems of Periodic Spaces

    by Adam Onus, Primoz Skraba

    The topology of periodic spaces has attracted a lot of interest in recent years in order to study and classify crystalline structures and other large homogeneous data sets, such as the distribution of galaxies in cosmology. In practice, these objects are studied by taking a finite sample and introducing periodic boundary conditions, however this introduces and removes many subtle homological features. Here, build on the work of Onus and Robins (2022) and Onus and Skraba (2023) to investigate whether one can recover the (persistent) homology of a periodic cell complex $K$ from a finite quotient space $G$ of equivalence classes under translations. In particular, we search for a computationally friendly method to identify all ''toroidal cycles'' of $G$ which do not lift to cycles in $K$. We show that all toroidal and non-toroidal cycles of $G$ of arbitrary homology degree can be completely classified for $K$ of arbitrary periodicity using the recently developed machinery of bisheaves and persistent local systems. In doing so, we also introduce a framework for a computationally viable persistence theory of periodic spaces. Finally, we outline algorithms for how to apply our results to real data, including a polynomial time algorithm for calculating the canonical persistent local system attributed to a given bisheaf.

  • Open Access

    Probabilistic Analysis of Multiparameter Persistence Decompositions

    by Ángel Javier Alonso, Michael Kerber, Primoz Skraba

    Multiparameter persistence modules can be uniquely decomposed into indecomposable summands. Among these indecomposables, intervals stand out for their simplicity, making them preferable for their ease of interpretation in practical applications and their computational efficiency. Empirical observations indicate that modules that decompose into only intervals are rare. To support this observation, we show that for numerous common multiparameter constructions, such as density- or degree-Rips bifiltrations, and across a general category of point samples, the probability of the homology-induced persistence module decomposing into intervals goes to zero as the sample size goes to infinity.

  • Central limit theorem for euclidean minimal spanning acycles

    by Primoz Skraba, Primoz Skraba, Primoz Skraba, D. Yogeshwaran, D. Yogeshwaran, D. Yogeshwaran

    In this paper, we investigate asymptotics for the minimal spanning acycles (MSAs) of the (Alpha)-Delaunay complex on a stationary Poisson process on [ ]. MSAs are topological (or higher-dimensional) generalizations of minimal spanning trees. We establish a central limit theorem (CLT) for total weight of the MSA on a Poisson Alpha-Delaunay complex. Our approach also allows us to establish CLTs for the sum of birth times and lifetimes in the persistent diagram of the Delaunay complex. The key to our proof is in showing the so-called weak stabilization of MSAs which proceeds by establishing suitable chain maps and uses matroidal properties of MSAs. In contrast to the proof of weak-stabilization for Euclidean minimal spanning trees via percolation-theoretic estimates, our weak-stabilization proof is algebraic in nature and provides an alternative proof even in the case of minimal spanning trees.


  • Open Access

    Wasserstein Stability for Persistence Diagrams

    by Primoz Skraba, Katharine Turner

    The stability of persistence diagrams is among the most important results in applied and computational topology. Most results in the literature phrase stability in terms of the bottleneck distance between diagrams and the $\infty$-norm of perturbations. This has two main implications: it makes the space of persistence diagrams rather pathological and it is often provides very pessimistic bounds with respect to outliers. In this paper, we provide new stability results with respect to the $p$-Wasserstein distance between persistence diagrams. This includes an elementary proof for the setting of functions on sufficiently finite spaces in terms of the $p$-norm of the perturbations, along with an algebraic framework for $p$-Wasserstein distance which extends the results to wider class of modules. We also provide apply the results to a wide range of applications in topological data analysis (TDA) including topological summaries, persistence transforms and the special but important case of Vietoris-Rips complexes.


  • Top Cited Papers
    Open Access

    A universal null-distribution for topological data analysis

    by Omer Bobrowski, Primoz Skraba

    One of the most elusive challenges within the area of topological data analysis is understanding the distribution of persistence diagrams arising from data. Despite much effort and its many successful applications, this is largely an open problem. We present a surprising discovery: normalized properly, persistence diagrams arising from random point-clouds obey a universal probability law. Our statements are based on extensive experimentation on both simulated and real data, covering point-clouds with vastly different geometry, topology, and probability distributions. Our results also include an explicit well-known distribution as a candidate for the universal law. We demonstrate the power of these new discoveries by proposing a new hypothesis testing framework for computing significance values for individual topological features within persistence diagrams, providing a new quantitative way to assess the significance of structure in data.


  • Open Access

    Central Limit Theorem for Euclidean Minimal Spanning Acycles

    by Primoz Skraba, D. Yogeshwaran

    We investigate asymptotics for the minimal spanning acycles of the (Alpha)-Delaunay complex on a stationary Poisson process on $\mathbb{R}^d, d \geq 2$. Minimal spanning acycles are topological (or higher-dimensional) generalization of minimal spanning trees. We establish a central limit theorem for total weight of the minimal spanning acycle on a Poisson-Delaunay complex. Our approach also allows us to establish central limit theorems for sum of birth times and lifetimes in the persistent diagram of the Delaunay complex. The key to our proof is in showing the so-called weak stabilization of minimal spanning acycles which proceeds by establishing suitable chain maps and uses matroidal properties of minimal spanning acycles. In contrast to the proof of weak-stabilization for Euclidean minimal spanning trees via percolation-theoretic estimates, our weak-stabilization proof is algebraic in nature and provides an alternative proof even in the case of minimal spanning trees.

  • Preface

    by Gunnar Carlsson, Kathryn Hess, Facundo Mémoli, Raul Rabadan, Primoz Skraba

  • Euler characteristic surfaces

    by Gabriele Beltramo, Primoz Skraba, Rayna Andreeva, Rik Sarkar, Ylenia Giarratano, Miguel O. Bernabeu

    In this paper, we investigate the use of the Euler characteristic for the topological data analysis, particularly over higher dimensional parameter spaces. The Euler characteristic is a classical, well-understood topological invariant that has appeared in numerous applications, primarily in the context of random fields. The goal of this paper, is to present the extension of using the Euler characteristic in higher dimensional parameter spaces. The topological data analysis of higher dimensional parameter spaces using stronger invariants such as homology, has and continues to be the subject of intense research. However, as important theoretical and computational obstacles remain, the use of the Euler characteristic represents an important intermediary step toward multi-parameter topological data analysis. We show the usefulness of the techniques using generated examples as well as a real world dataset of detecting diabetic retinopathy in retinal images.


  • Open Access

    Topology-Aware Surface Reconstruction for Point Clouds

    by Rickard Brüel-Gabrielsson, Vignesh Ganapathi-Subramanian, Primoz Skraba, Leonidas J. Guibas

    We present an approach to inform the reconstruction of a surface from a point scan through topological priors. The reconstruction is based on basis functions which are optimized to provide a good fit to the point scan while satisfying predefined topological constraints. We optimize the parameters of a model to obtain likelihood function over the reconstruction domain. The topological constraints are captured by persistence diagrams which are incorporated in the optimization algorithm promote the correct topology. The result is a novel topology-aware technique which can: 1.) weed out topological noise from point scans, and 2.) capture certain nuanced properties of the underlying shape which could otherwise be lost while performing surface reconstruction. We showcase results reconstructing shapes with multiple potential topologies, compare to other classical surface construction techniques, and show the completion of real scan data.