Related papers: Stability of Extended Functional Persistence in Di…
A (2-dimensional) realisation of a graph $G$ is a pair $(G,p)$, where $p$ maps the vertices of $G$ to $\mathbb{R}^2$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise. We…
Persistence diagrams (PD)s play a central role in topological data analysis. This analysis requires computing distances among such diagrams such as the $1$-Wasserstein distance. Accurate computation of these PD distances for large data sets…
We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse…
We study the stability of various kinds of graphene samples under soft X-ray irradiation. Our results show that in single layer exfoliated graphene (a closer analogue to two dimensional material), the in-plane carbon-carbon bonds are…
The primary objective of this paper is to introduce Hyers-Ulam-type stability results for monotone, subadditive, and convex graphs. We consider their standard definitions in an approximate sense and demonstrate the existence of a…
Many attempts have been made in recent decades to integrate machine learning (ML) and topological data analysis. A prominent problem in applying persistent homology to ML tasks is finding a vector representation of a persistence diagram…
A realization of a graph $G=(V,E)$ is a map $v\colon V\to\Bbb R^d$ that assigns to each vertex a point in $d$-dimensional Euclidean space. We study graph realizations from the perspective of representation theory (expressing certain…
Relationship for dynamical properties in the vicinity of fixed points between two-dimensional continuous and its positivity-preserving discretized dynamical systems is studied. Based on linear stability analysis, we reveal the conditions…
A {\em faithful (unit) distance graph} in $\mathbb{R}^d$ is a graph whose set of vertices is a finite subset of the $d$-dimensional Euclidean space, where two vertices are adjacent if and only if the Euclidean distance between them is…
A geometric $t$-spanner on a set of points in Euclidean space is a graph containing for every pair of points a path of length at most $t$ times the Euclidean distance between the points. Informally, a spanner is $\mathcal{O}(k)$-robust if…
Fourier matrices naturally appear in many applications and their stability is closely tied to performance guarantees of algorithms. The starting point of this article is a result that characterizes properties of an exponential system on a…
We solve a problem on a construction of a separately continuous mapping with the given diagonal, which is the pointwise limit of a sequence of continuous mappings valued in an equiconnected space. We construct an example of a closed-valued…
Stability, akin to reproducibility, is crucial in statistical analysis. This paper examines the stability of sparse network inference in high-dimensional graphical models, where selected edges should remain consistent across different…
Let $(X,d,m)$ be a proper, non-branching, metric measure space. We show existence and uniqueness of optimal transport maps for cost written as non-decreasing and strictly convex functions of the distance, provided $(X,d,m)$ satisfies a new…
Consider a dataset of n(d) points generated independently from R^d according to a common p.d.f. f_d with support(f_d) = [0,1]^d and sup{f_d([0,1]^d)} growing sub-exponentially in d. We prove that: (i) if n(d) grows sub-exponentially in d,…
A graphic sequence $\pi$ is potentially $H$-graphic if there is some realization of $\pi$ that contains $H$ as a subgraph. The Erd\H{o}s-Jacobson-Lehel problem asks to determine $\sigma(H,n)$, the minimum even integer such that any $n$-term…
Let $E$ be a finite dimensional vector space over a local field, and $F$ be its dual. For a closed subset $X$ of $E$, and $Y$ of $F$, consider the space $D^{-\xi}(E;X,Y)$ of tempered distributions on $E$ whose support are contained in $X$…
This paper investigates the stability of distance-based \textit{flexible} undirected formations in the plane. Without rigidity, there exists a set of connected shapes for given distance constraints, which is called the ambit. We show that a…
Motivated by persistent homology and topological data analysis, we consider formal sums on a metric space with a distinguished subset. These formal sums, which we call persistence diagrams, have a canonical 1-parameter family of metrics…
Multidimensional persistence studies topological features of shapes by analyzing the lower level sets of vector-valued functions. The rank invariant completely determines the multidimensional analogue of persistent homology groups. We prove…