Related papers: Morse Theory for the k-NN Distance Function

We introduce a novel approach for studying random k-coverage, using Morse theory for the k-nearest neighbor (k-NN) distance function. We prove a sharp phase transition for the number of critical points of the k-NN distance function, from…

In this short note, we show that the distance function to any finite set $X\subset \mathbb{R}^n$ is a topological Morse function, regardless of whether $X$ is in general position. We also precisely characterize its topological critical…

We define a notion of Morse function and establish Morse theory-like theorems over offsets of any compact set in a Euclidean space at regular values of their distance function. Using non-smooth analysis and tools from geometric measure…

We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance {\delta} from a given input function. The result is achieved by establishing a connection between discrete Morse…

This paper brings together three distinct theories with the goal of quantifying shape textures with complex morphologies. Distance fields are central objects in shape representation, while topological data analysis uses algebraic topology…

Let $Y\subseteq \mathbb{R}^n$ be a closed definable subset and $X\subseteq \mathbb{R}^n$ be a smooth manifold. We construct a version of Morse theory for the restriction to $X$ of the Euclidean distance function from $Y$. This is done using…

We construct random Morse functions on surfaces by random walk and compute related distributions. We study the space of Morse functions through these random variables. We consider subspaces characterized by the surfaces with boundary…

For a finite set of points $P$ in $R^d$, the function $d_P: R^d \to R^+$ measures Euclidean distance to the set $P$. We study the number of critical points of $d_P$ when $P$ is a Poisson process. In particular, we study the limit behavior…

We study the graph constructed on a Poisson point process in $d$ dimensions by connecting each point to the $k$ points nearest to it. This graph a.s. has an infinite cluster if $k > k_c(d)$ where $k_c(d)$, known as the critical value,…

Topological data analysis can extract effective information from higher-dimensional data. Its mathematical basis is persistent homology. The persistent homology can calculate topological features at different spatiotemporal scales of the…

In this paper we examine the use of topological methods for multivariate statistics. Using persistent homology from computational algebraic topology, a random sample is used to construct estimators of persistent homology. This estimation…

We develop a discrete Morse theory for open simplicial complexes $K=X\setminus T$ where $X$ is a simplicial complex and $T$ a subcomplex of $X$. A discrete Morse function $f$ on $K$ gives rise to a discrete Morse function on the order…

We introduce a version of discrete Morse theory for posets. This theory studies the topology of the order complexes K(X) of h-regular posets X from the critical points of admissible matchings on X. Our approach is related to R. Forman's…

Suppose $V$ is an $n$-element set where for each $x \in V$, the elements of $V \setminus \{x\}$ are ranked by their similarity to $x$. The $K$-nearest neighbor graph is a directed graph including an arc from each $x$ to the $K$ points of $V…

We introduce a version of discrete Morse theory specific for manifolds with boundary. The idea is to consider Morse functions for which all boundary cells are critical. We obtain "Relative Morse Inequalities" relating the homology of the…

In bounding the homology of a manifold, Forman's Discrete Morse theory recovers the full precision of classical Morse theory: Given a PL triangulation of a manifold that admits a Morse function with c_i critical points of index i, we show…

Piecewise-linear (PL) Morse theory and discrete Morse theory are used in shape analysis tasks to investigate the topological features of discretized spaces. In spite of their common origin in smooth Morse theory, various notions of critical…

1) We introduce random discrete Morse theory as a computational scheme to measure the complicatedness of a triangulation. The idea is to try to quantify the frequence of discrete Morse matchings with a certain number of critical cells. Our…

Topological data analysis can reveal higher-order structure beyond pairwise connections between vertices in complex networks. We present a new method based on discrete Morse theory to study topological properties of unweighted and…

We denote the matching complex of the complete graph with $n$ vertices by $M_n$. Bouc first studied the topological properties of $M_n$ in connection with the Quillen complex. Later Bj\"{o}rner, Lov\'{a}sz, Vre\'{c}ica, and…