Primoz Skraba

Dr. Primoz Skraba


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 March 2020 in Physical Review E
Verified
Journal Article
Closed access
PDF file
OBOmer Bobrowski
Omer Bobrowski
PSPrimoz Skraba
Primoz Skraba
In this paper we study the connection between the zeros of the expected Euler characteristic curve and the phenomenon which we refer to as homological percolation—the formation of “giant” cycles in persistent homology, which is intimately related to classical notions of percolation. We perform an experimental study that covers four different models: site percolation on the cubical and permutahedral lattices, the Poisson-Boolean model, and Gaussian random fields. All the models are generated on the flat torus Td for d=2,3,4. The simulation results strongly indicate that the zeros of the expected Euler characteristic curve approximate the critical values for homological percolation. Our results also provide some insight about the approximation error. Further study of this connection could have powerful implications both in the study of percolation theory and in the field of topological data analysis.

3 April 2020 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
PSPrimoz Skraba
Primoz Skraba
GTGugan Thoppe
Gugan Thoppe
DYD. Yogeshwaran
D. Yogeshwaran
A weighted $d$-complex is a simplicial complex of dimension $d$ in which each face is assigned a real-valued weight. We derive three key results here concerning persistence diagrams and minimal spanning acycles (MSAs) of such complexes. First, we establish an equivalence between the MSA face-weights and death times in the persistence diagram. Next, we show a novel stability result for the MSA face-weights which, due to our first result, also holds true for the death and birth times, separately. Our final result concerns a perturbation of a mean-field model of randomly weighted $d$-complexes. The $d$-face weights here are perturbations of some i.i.d. distribution while all the lower-dimensional faces have a weight of $0$. If the perturbations decay sufficiently quickly, we show that suitably scaled extremal nearest face-weights, face-weights of the $d$-MSA, and the associated death times converge to an inhomogeneous Poisson point process. This result completely characterizes the extremal points of persistence diagrams and MSAs. The point process convergence and the asymptotic equivalence of three point processes are new for any weighted random complex model, including even the non-perturbed case. Lastly, as a consequence of our stability result, we show that Frieze's $\zeta(3)$ limit for random minimal spanning trees and the recent extension to random MSAs by Hino and Kanazawa also hold in suitable noisy settings.

12 August 2020 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
RBRickard Brüel‐Gabrielsson
Rickard Brüel‐Gabrielsson
VGVignesh Ganapathi‐Subramanian
Vignesh Ganapathi‐Subramanian
PSPrimoz Skraba
Primoz Skraba
LGLeonidas J. Guibas
Leonidas J. Guibas

28 July 2023 in Scientific Reports
Verified
Journal Article
Open access
PDF file
OBOmer Bobrowski
Omer Bobrowski
PSPrimoz Skraba
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.

6 September 2017 in Foundations of Computational Mathematics
Verified
Journal Article
Closed access
PDF file
DGDejan Govc
Dejan Govc
PSPrimoz Skraba
Primoz Skraba

1 January 2022 in Foundations of Data Science
Verified
Journal Article
Closed access
PDF file
GBGabriele Beltramo
Gabriele Beltramo
PSPrimoz Skraba
Primoz Skraba
RARayna Andreeva
Rayna Andreeva
RSRik Sarkar
Rik Sarkar
YGYlenia Giarratano
Ylenia Giarratano
MBMiguel O. Bernabeu
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.