Omer Bobrowski

Dr. Omer Bobrowski

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
23 January 2018 in Journal of Applied and Computational Topology
Verified
Journal Article
Closed access
PDF file
OBOmer Bobrowski
Omer Bobrowski
MKMatthew Kahle
Matthew Kahle

7 November 2016 in Random Structures & Algorithms
Verified
Journal Article
Closed access
PDF file
OBOmer Bobrowski
Omer Bobrowski
SWShmuel Weinberger
Shmuel Weinberger

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.

17 December 2020 in Journal of Applied and Computational Topology
Verified
Journal Article
Open access
PDF file
ABAdam Brown
Adam Brown
OBOmer Bobrowski
Omer Bobrowski
EMElizabeth Munch
Elizabeth Munch
BWBei Wang
Bei Wang
We study the probabilistic convergence between the mapper graph and the Reeb graph of a topological space $${\mathbb {X}}$$ X equipped with a continuous function $$f: {\mathbb {X}}\rightarrow \mathbb {R}$$ f : X → R . We first give a categorification of the mapper graph and the Reeb graph by interpreting them in terms of cosheaves and stratified covers of the real line $$\mathbb {R}$$ R . We then introduce a variant of the classic mapper graph of Singh et al. (in: Eurographics symposium on point-based graphics, 2007), referred to as the enhanced mapper graph, and demonstrate that such a construction approximates the Reeb graph of $$({\mathbb {X}}, f)$$ ( X , f ) when it is applied to points randomly sampled from a probability density function concentrated on $$({\mathbb {X}}, f)$$ ( X , f ) . Our techniques are based on the interleaving distance of constructible cosheaves and topological estimation via kernel density estimates. Following Munch and Wang (In: 32nd international symposium on computational geometry, volume 51 of Leibniz international proceedings in informatics (LIPIcs), Dagstuhl, Germany, pp 53:1–53:16, 2016), we first show that the mapper graph of $$({\mathbb {X}}, f)$$ ( X , f ) , a constructible $$\mathbb {R}$$ R -space (with a fixed open cover), approximates the Reeb graph of the same space. We then construct an isomorphism between the mapper of $$({\mathbb {X}},f)$$ ( X , f ) to the mapper of a super-level set of a probability density function concentrated on $$({\mathbb {X}}, f)$$ ( X , f ) . Finally, building on the approach of Bobrowski et al. (Bernoulli 23(1):288–328, 2017b), we show that, with high probability, we can recover the mapper of the super-level set given a sufficiently large sample. Our work is the first to consider the mapper construction using the theory of cosheaves in a probabilistic setting. It is part of an ongoing effort to combine sheaf theory, probability, and statistics, to support topological data analysis with random data.

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.

27 October 2022 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
YRYohai Reani
Yohai Reani
OBOmer Bobrowski
Omer Bobrowski
We propose a novel approach for comparing the persistent homology representations of two spaces (or filtrations). Commonly used methods are based on numerical summaries such as persistence diagrams and persistence landscapes, along with suitable metrics (e.g. Wasserstein). These summaries are useful for computational purposes, but they are merely a marginal of the actual topological information that persistent homology can provide. Instead, our approach compares between two topological representations directly in the data space. We do so by defining a correspondence relation between individual persistent cycles of two different spaces, and devising a method for computing this correspondence. Our matching of cycles is based on both the persistence intervals and the spatial placement of each feature. We demonstrate our new framework in the context of topological inference, where we use statistical bootstrap methods in order to differentiate between real features and noise in point cloud data.