Related papers: Structure and Stability of the 1-Dimensional Mappe…
Topological data analysis can provide insight on the structure of weighted graphs and digraphs. However, some properties underlying a given (di)graph are hardly mappable to simplicial complexes. We introduce \textit{steady} and…
Reeb graphs are widely used in a range of fields for the purposes of analyzing and comparing complex spaces via a simpler combinatorial object. Further, they are closely related to extended persistence diagrams, which largely but not…
We prove a theorem on structural stability of smooth attractor-repellor endomorphisms of compact manifolds, with singularities. By attractor-repellor, we mean that the non-wandering set of the dynamics $f$ is the disjoint union of a…
The Reeb graph $\mathcal{R}(f) $ is one of the fundamental invariants of a smooth function $f\colon M\to \mathbb{R} $ with isolated critical points. It is defined as the quotient space $M/_{\!\sim}$ of the closed manifold $M$ by a relation…
A bar framework determined by a finite graph $G$ and configuration $\bf p$ in $d$ space is universally rigid if it is rigid in any ${\mathbb R}^D \supset {\mathbb R}^d$. We provide a characterization of universally rigidity for any graph…
We investigate the problem of the realization of a given graph as the Reeb graph $\mathcal{R}(f)$ of a smooth function $f\colon M\rightarrow \mathbb{R}$ with finitely many critical points, where $M$ is a closed manifold. We show that for…
We derive a sufficient condition for stability in probability of an equilibrium of a randomly perturbed map in ${\mathbb R}^d$. This condition can be used to stabilize weakly unstable equilibria by random forcing. Analytical results on…
We consider the setting of Reeb graphs of piecewise linear functions and study distances between them that are stable, meaning that functions which are similar in the supremum norm ought to have similar Reeb graphs. We define an edit…
We determine the graphene morphology regulated by substrates with herringbone and checkerboard surface corrugations. As the graphene/substrate interfacial bonding energy and the substrate surface roughness vary, the graphene morphology…
We revisit the concept of minimal rigidity as applied to soft repulsive, frictionless sphere packings in two-dimensions with the introduction of the jamming graph. Minimal rigidity is a purely combinatorial property encoded via Laman's…
We study the expanding properties of random perturbations of regular interval maps satisfying the summability condition of exponent one. Under very general conditions on the interval maps and perturbation types, we prove strong stochastic…
$f$-vertex stability number $vs_f(G)=\min\{|X|: X\subseteq V(G) \enspace \text{and} \enspace f(G-X)\neq f(G)\}$, and $f$-edge stability number is defined similarly by setting $X\subseteq E(G)$. In this paper, for multiplicative and mining…
Since its introduction as a computable approximation of the Reeb graph, the Mapper graph has become one of the most popular tools from topological data analysis for performing data visualization and inference. However, finding an…
The Reeb graph of a function on a smooth manifold is the graph obtained as the space of all connected components of level sets such that the set of all vertices coincides with the set of all connected components of level sets including…
The recently introduced continuous Hopfield network (see Ramsauer et al.) exhibits large memorization capabilities, which manifest as attractive fixed points of its update rule -- a differentiable function consisting of two linear mappings…
Persistence diagrams are efficient descriptors of the topology of a point cloud. As they do not naturally belong to a Hilbert space, standard statistical methods cannot be directly applied to them. Instead, feature maps (or representations)…
Delay-coordinate mapping is an effective and widely used technique for reconstructing and analyzing the dynamics of a nonlinear system based on time-series outputs. The efficacy of delay-coordinate mapping has long been supported by Takens'…
Networks are inherently vulnerable to vertex failures, making the analysis of their structural robustness a fundamental problem in graph theory. In this study, we investigate the closeness and vertex residual closeness of graphs, with a…
The first result in this study is a non-existence theorem for $\alpha-$harmonic mappings. Additionally, a direct connection between the $\alpha-$ harmonic and harmonic maps is made possible via conformal deformation. Second, the instability…
Stability is a fundamental notion in dynamical systems and control theory that, traditionally understood, describes asymptotic behavior of solutions around an equilibrium point. This notion may be characterized abstractly as continuity of a…