Related papers: Structure and Stability of the 1-Dimensional Mappe…

Motivation: The Mapper algorithm is an essential tool to explore shape of data in topology data analysis. With a dataset as an input, the Mapper algorithm outputs a graph representing the topological features of the whole dataset. This…

In [MaII] Mather proved that a smooth proper infinitesimally stable map is stable. This result is the key component of the Mather stability theorem [MaV], which can be reformulated as follows: a smooth proper map $f: M\to N$ is stable if…

Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…

Node-link diagrams are a popular method for representing graphs that capture relationships between individuals, businesses, proteins, and telecommunication endpoints. However, node-link diagrams may fail to convey insights regarding graph…

Reeb graphs are structural descriptors that capture shape properties of a topological space from the perspective of a chosen function. In this work we define a combinatorial metric for Reeb graphs of orientable surfaces in terms of the cost…

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…

Let $M$ be a smooth, compact, connected, oriented Riemannian manifold, and let $\imath: M \to \mathbb R^d$ be an isometric embedding. We show that a Sobolev map $f: M \to M$ which has the property that the differential $df(q)$ is close to…

Given a graph $G$ whose edges are perfectly reliable and whose nodes each operate independently with probability $p\in[0,1],$ the node reliability of $G$ is the probability that at least one node is operational and that the operational…

This work proposes a novel distributed framework for verifying the incremental stability of large-scale systems with unknown dynamics and known interconnection structures using graph neural networks. Our proposed approach relies on the…

We study the stability of linear fractional order maps. We show that in the stable region, the evolution is described by Mittag-Leffler functions and a well defined effective Lyapunov exponent can be obtained in these cases. For…

Let $X$ be a compact connected Riemann surface of genus at least two. The Abel-Jacobi map $\varphi: {\rm Sym}^d(X) \rightarrow {\rm Pic}^d(X)$ is an embedding if $d$ is less than the gonality of $X$. We investigate the curvature of the…

We introduce the {\em $\mu$-topological stability}. This is a type of stability depending on the measure $\mu$ different from the set-valued approach \cite{lm}. We prove that the map $f$ is $m_p$-topologically stable if and only if $p$ is a…

To investigate the topological structure of Morse functions on the projective plane we use the Reeb graphs. We describe it properties and prove that it is a complete topological invariant of simple Morse function on $\mathbb{R} P^2$. We…

The complex dynamics of baker's map and its variants in an infinite-precision mathematical domain have been extensively analyzed in the past five decades. However, their real structure implemented in a finite-precision computer remains…

Persistence diagrams are objects that play a central role in topological data analysis. In the present article, we investigate the local and global geometric properties of spaces of persistence diagrams. In order to do this, we construct a…

Let $G$ be a graph and $f: G\rightarrow G$ be a continuous map. We establish a structure theorem which describes the structures of the set $R(f)-\overline{P(f)}$, where $R(f)$ and $P(f)$ are the recurrent point set and the periodic point…

Color maps are a commonly used visualization technique in which data are mapped to optical properties, e.g., color or opacity. Color maps, however, do not explicitly convey structures (e.g., positions and scale of features) within data.…

We derive conditions for the existence of fixed points of cone mappings without assuming scalability of functions. Monotonicity and scalability are often inseparable in the literature in the context of searching for fixed points of…

We investigate both linear and nonlinear stability aspects of rigid motions (resp. M\"obius transformations) of $\mathbb{S}^{n-1}$ among Sobolev maps from $\mathbb{S}^{n-1}$ into $\mathbb{R}^n$. Unlike similar in flavour results for maps…

A spanner is reliable if it can withstand large, catastrophic failures in the network. More precisely, any failure of some nodes can only cause a small damage in the remaining graph in terms of the dilation, that is, the spanner property is…