English
Related papers

Related papers: Reeb Graph of Sample Thickenings

200 papers

Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. We propose the systematic use of symmetric spaces in representation learning,…

Machine Learning · Computer Science 2021-06-10 Federico López , Beatrice Pozzetti , Steve Trettel , Michael Strube , Anna Wienhard

In this paper we consider adaptive sampling's local-feature size, used in surface reconstruction and geometric inference, with respect to an arbitrary landmark set rather than the medial axis and relate it to a path-based adaptive metric on…

Computational Geometry · Computer Science 2018-07-24 Nicholas J. Cavanna , Donald R. Sheehy

Graph Sampling provides an efficient yet inexpensive solution for analyzing large graphs. While extracting small representative subgraphs from large graphs, the challenge is to capture the properties of the original graph. Several sampling…

Data Structures and Algorithms · Computer Science 2019-10-21 Muhammad Irfan Yousuf , Raheel Anwar

With the popularization of Topological Data Analysis, the Reeb graph has found new applications as a summarization technique in the analysis and visualization of large and complex data, whose usefulness extends beyond just the graph itself.…

Computational Geometry · Computer Science 2020-01-14 Junyi Tu , Mustafa Hajij , Paul Rosen

Sampling and interpolation have been extensively studied, in order to reconstruct or estimate the entire graph signal from the signal values on a subset of vertexes, of which most achievements are about continuous signals. While in a lot of…

Signal Processing · Electrical Eng. & Systems 2021-09-28 Wenwei Liu , Hui Feng , Kaixuan Wang , Feng Ji , Bo Hu

Recently, multi-scale notions of local homology (a variant of persistent homology) have been used to study the local structure of spaces around a given point from a point cloud sample. Current reconstruction guarantees rely on constructing…

Computational Geometry · Computer Science 2013-04-24 Primoz Skraba , Bei Wang

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

Combinatorics · Mathematics 2015-02-03 Guy Moshkovitz , Asaf Shapira

The Reeb space of a continuous function is the space of connected components of the level sets. In this paper we first prove that the Reeb space of a smooth function on a closed manifold with finitely many critical values has the structure…

Geometric Topology · Mathematics 2020-06-03 Osamu Saeki

The vertices of an interval graph represent intervals over a real line where overlapping intervals denote that their corresponding vertices are adjacent. This implies that the vertices are measurable by a metric and there exists a linear…

Physics and Society · Physics 2015-03-26 Chuan Wen Loe , Henrik Jeldtoft Jensen

We introduce a generalized framework for sampling and reconstruction in separable Hilbert spaces. Specifically, we establish that it is always possible to stably reconstruct a vector in an arbitrary Riesz basis from sufficiently many of its…

Numerical Analysis · Mathematics 2010-12-01 Ben Adcock , Anders C. Hansen

As a branch of algebraic and differential topology of manifolds, the theory of Morse functions and their higher dimensional versions or fold maps and its application to algebraic and differential topology of manifolds is fundamental,…

K-Theory and Homology · Mathematics 2020-05-26 Naoki Kitazawa

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

Combinatorics · Mathematics 2022-05-06 Stefan Steinerberger

Temporal graphs are commonly used to represent time-resolved relations between entities in many natural and artificial systems. Many techniques were devised to investigate the evolution of temporal graphs by comparing their state at…

Social and Information Networks · Computer Science 2024-11-20 Lorenzo Dall'Amico , Alain Barrat , Ciro Cattuto

The classical Reifenberg's theorem says that a set which is sufficiently well approximated by planes uniformly at all scales is a topological H\"older manifold. Remarkably, this generalizes to metric spaces, where the approximation by…

Metric Geometry · Mathematics 2024-06-21 Nicola Gigli , Ivan Yuri Violo

The Reeb space of a continuous function is the space of connected components of the level sets. In this paper we characterize those smooth functions on closed manifolds whose Reeb spaces have the structure of a finite graph. We also give…

Geometric Topology · Mathematics 2023-08-14 Osamu Saeki

We prove that the Reeb space of a proper definable map $f:X \rightarrow Y$ in an arbitrary o-minimal expansion of a real closed field is realizable as a proper definable quotient. This result can be seen as an o-minimal analog of Stein…

Algebraic Topology · Mathematics 2020-07-29 Saugata Basu , Nathanael Cox , Sarah Percival

Searching topological similarity between a pair of shapes or data is an important problem in data analysis and visualization. The problem of computing similarity measures using scalar topology has been studied extensively and proven useful…

Computational Geometry · Computer Science 2020-08-31 Tripti Agarwal , Yashwanth Ramamurthi , Amit Chattopadhyay

Using the orbicell decomposition of the Deligne-Mumford compactification of the moduli space of Riemann surfaces studied previously, a chain complex based on semistable ribbon graphs is constructed which is an extension of Konsevich's graph…

Algebraic Topology · Mathematics 2016-10-25 Javier Zúñiga

In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…

Logic in Computer Science · Computer Science 2026-04-15 Vedran Čačić , Matea Čelar , Marko Horvat , Zvonko Iljazović

In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…

Combinatorics · Mathematics 2015-01-14 Felix Pogorzelski