arXiv research

Study on stable translation lengths of surface homeomorphisms and their approximations.

Stable cylinders found in hyperbolic groups and curve graphs.

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 distance for Reeb graphs and prove that it is stable and universal, meaning that it pr…

We study the structure of the stable coefficients of the Jones polynomial of an alternating link. We start by identifying the first four stable coefficients with polynomial invariants of a (reduced) Tait graph of the link projection. This leads us to introduce a free polynomial algebra of invariants of graphs whose ele…

We prove that a strictly stable minimal $C^2_h$ intrinsic graph G is locally area-minimizing, i.e. given any $C^1_h$ graph $S$ with the same boundary, $\text{Area}(G)<\text{Area}(S)$ unless $G=S$. As a consequence we show the existence and the uniqueness of $C^\infty$ minimal graphs with prescribed small boundary datum…

I-SPEC learns stable models from data without full causal knowledge.

For a Riemannian polyhedra, we study the geometry of the unit ball for the unidimensional stable norm (stable ball). In the case of a unidimensional Riemannian polyhedra (graph), we show that the stable ball is a polytope whose vertices are completely described by combinatorial properties of the graph. We study then th…

No stable discrete maps into certain curved spaces exist.

Study shows stable graphs in Heisenberg group are essentially planes.

Stable subgroups identified in genus two handlebody group.

This paper extends stable blanket theory to models with hidden variables and causal cycles.

New representations defined for groups and graphs, with applications to stable representations.

The paper refines 2-factor homology to a stable homotopy type for planar trivalent graphs with perfect matchings.

For the pants graph, there is little known about the behaviour of geodesics, as opposed to quasigeodesics. Brock-Masur-Minsky showed that geodesics or geodesic segments connecting endpoints satisfying a bounded combinatorics condition, such as the stable/unstable laminations of a pseudo-Anosov, all have bounded combina…

Study on stable commutator length in RAAGs and Coxeter groups, proving spectral gaps and hardness results.

It is well-known that a minimal graph of codimension one is stable, i.e. the second variation of the area functional is non-negative. This is no longer true for higher codimensional minimal graphs. In this note, we prove that a minimal graph of any codimension is stable if its normal bundle is flat. We also prove minim…

Study the Gromov boundary of fine curve graph for surface homeomorphisms.

Study shows mapping class groups are one-ended for surfaces with at least one end.

We show that in any right-angled Artin group whose defining graph has chromatic number $k$, every non-trivial element has stable commutator length at least $1/(6k)$. Secondly, if the defining graph does not contain triangles, then every non-trivial element has stable commutator length at least $1/20$. These results are…

Given a hypersurface $M$ of null scalar curvature in the unit sphere $\mathbb{S}^n$, $n\ge 4$, such that its second fundamental form has rank greater than 2, we construct a singular scalar-flat hypersurface in $\Rr^{n+1}$ as a normal graph over a truncated cone generated by $M$. Furthermore, this graph is 1-stable if t…

Model predicts stable molecules with AI and physics constraints.

New findings on translation lengths in Teichmüller and curve graphs for pseudo-Anosovs.

Graph products inherit Morse local-to-global property from their components.

In this paper, we deal with the problem of marginalization over and conditioning on two disjoint subsets of the node set of chain graphs (CGs) with the LWF Markov property. For this purpose, we define the class of chain mixed graphs (CMGs) with three types of edges and, for this class, provide a separation criterion un…

We prove a phenomenon of concentration of total curvature for stable minimal surfaces in the product space H^2xR; where H^2 is the hyperbolic plane. Under some geometric conditions on the asymptotic boundary of an oriented stable minimal surface immersed in H^2xR, it has infinite total curvature. In particular, we infe…

Scattering transforms are non-trainable deep convolutional architectures that exploit the multi-scale resolution of a wavelet filter bank to obtain an appropriate representation of data. More importantly, they are proven invariant to translations, and stable to perturbations that are close to translations. This stabili…

Graph neural networks (GNNs) have emerged as a powerful tool for nonlinear processing of graph signals, exhibiting success in recommender systems, power outage prediction, and motion planning, among others. GNNs consists of a cascade of layers, each of which applies a graph convolution, followed by a pointwise nonlinea…

We propose a symmetric graph convolutional autoencoder which produces a low-dimensional latent representation from a graph. In contrast to the existing graph autoencoders with asymmetric decoder parts, the proposed autoencoder has a newly designed decoder which builds a completely symmetric autoencoder form. For the re…

Proves conjecture on graph configuration spaces' complexity.

This paper focuses on spectral filters on graphs, namely filters defined as elementwise multiplication in the frequency domain of a graph. In many graph signal processing settings, it is important to transfer a filter from one graph to another. One example is in graph convolutional neural networks (ConvNets), where the…

The study examines translation lengths of pseudo-Anosov maps on curve graphs.

Graph neural networks (GNNs), consisting of a cascade of layers applying a graph convolution followed by a pointwise nonlinearity, have become a powerful architecture to process signals supported on graphs. Graph convolutions (and thus, GNNs), rely heavily on knowledge of the graph for operation. However, in many pract…

Formula for volumes of odd strata of quadratic differentials using graph intersection numbers.

The curve graph's model theory reveals its central role in surface study.

We study the problem of sampling k-bandlimited signals on graphs. We propose two sampling strategies that consist in selecting a small subset of nodes at random. The first strategy is non-adaptive, i.e., independent of the graph structure, and its performance depends on a parameter called the graph coherence. On the co…

Let S be a C^2 H-minimal noncharacteristic hypersurface in the first Heisenberg group. We show that if S contains a graphical strip, then it is not a stable minimal surface. Moreover, we show that if S is a C^2 H-minimal noncharacteristic entire graph which is not itself a vertical plane, then S contains a graphical st…

DAGgr aggregates multiple DAGs to stabilize causal structure learning.

We prove that a minimal oriented stable annular end in H^2 x R whose asymptotic boundary is contained in two vertical lines has finite total curvature and converges to a vertical plane. Furthermore, if the end is embedded then it is a horizontal graph.

This paper studies fixed points of graph selfmaps and iwip endomorphisms of free groups.

This note provides an alternate account of Calegari's rationality theorem for stable commutator length in free groups.

Research describes all possible gradient vector fields on a sphere with up to ten singular points.

The success of graph embeddings or node representation learning in a variety of downstream tasks, such as node classification, link prediction, and recommendation systems, has led to their popularity in recent years. Representation learning algorithms aim to preserve local and global network structure by identifying no…

We prove that a stable minimal hypersurface of an open ball having a singular set of locally finite codimension 2 Hausdorff measure which is weakly close to a multiplicity 2 hyperplane is a 2-valued C^{1, alpha} graph in the interior. Applications including a compactness theorem for a class of immersed stable minimal h…

An orientation is defined on a family of curve graphs on which the Torelli group acts. It is shown that the resulting signed stable length of an element of the Torelli group is a cohomology class. This cohomology class is half the dual of the contraction of the Johnson homomorphism, the socalled "Chillingworth class".

Graph braid groups' complexity stabilizes for most graphs.

The paper proves stability of certain graph types in Euclidean space with specific densities.

A planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in any given convex surface which is sufficiently close to the sphere, then we call …

New GCNs solve graph embedding problems efficiently and interpretably.